Filter interviews by
I applied via LinkedIn and was interviewed in Oct 2023. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed in Oct 2023. There were 2 interview rounds.
Count and say using dp
Recursive problem using stair problem
I want to work with Lyft because of their innovative approach to transportation and the opportunity to analyze their financial data.
I am drawn to Lyft's commitment to revolutionizing the transportation industry through technology.
I am excited about the prospect of analyzing financial data for a company that is constantly evolving and growing.
I believe my experience in data analytics can help Lyft make informed decision...
I appeared for an interview in Apr 2023.
Duriation: 1h
topic: Read N charactor
calling an api, the api will return N charactor. return those charactor until read api have no data
Follow up:
can call mutilple pages, and the api should use multiple times
A booking system for scheduling appointments or reservations
Allow users to select date and time for booking
Include user registration and login functionality
Send confirmation emails or notifications to users
Implement a calendar view for easy scheduling
Include payment processing for reservations if applicable
Lyft interview questions for popular designations
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
One coding and other mcqs on CS concepts
I appeared for an interview before Sep 2020.
Round duration - 45 minutes
Round difficulty - Easy
This round was telephonic round. The interview lasted for approximately 45 minutes. The interviewer asked me three coding questions. I hustled a bit on 3rd question but after a hint was able to solve it.
Round duration - 120 minutes
Round difficulty - Easy
This round was Online Test on Hackerrank for 120 minutes, it contained 3 questions.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Use a combination of hashmap and doubly linked list to implement the LRU cache.
Keep track of the least recently used item and evict it when the cache reaches its capacity.
Update the position of an item in the cache whenever it is accessed or updated.
Handle both get and put operations efficiently to main...
Round duration - 60 minutes
Round difficulty - Easy
This round was face to face Interview at Ola Campus and lasted for 1 hour.
Round duration - 35 minutes
Round difficulty - Easy
This round was again a face to face technical interview, I was just asked one question in this round.
Round duration - 30 minutes
Round difficulty - Easy
Only a question of System Design was asked
Design a toll booth system for Ola cabs with necessary functions and data structures.
Use a queue data structure to manage the order of vehicles waiting at the toll booth.
Implement functions for vehicle entry, toll calculation, and exit.
Store vehicle information such as license plate number, type of vehicle, and toll amount in a hash map.
Utilize a priority queue to handle VIP or premium customers efficiently.
Include a f...
Round duration - 30 minutes
Round difficulty - Easy
Very general HR questions were asked
Tip 1 : Be confident in the projects you have mentioned in your resume.
Tip 2 : Always discuss your approach with the interviewer first for any problem.
Tip 3 : Always start with a basic solution and then discuss further optimisations.
Tip 1 : Good projects showing your skills (Be clear in what you achieved from those projects)
Tip 2 : Internship experience at the top (It gives you an edge over others)
I appeared for an interview in May 2021.
Round duration - 60 minutes
Round difficulty - Medium
This was coding round and was conducted on Google meet with code link shared. Their were 2 interviewers that gave questions and later ran code on sample test cases.
Given a string STR
consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographically increasing order.
Return all permutations of a given string in lexicographically increasing order.
Use backtracking to generate all permutations of the string.
Sort the permutations to get them in lexicographically increasing order.
Ensure the string contains unique characters to avoid duplicate permutations.
Given a non-negative integer 'K', determine the Kth row of Pascal’s Triangle.
K = 2
1 1
K = 4
1 4 6 ...
The task is to find the Kth row of Pascal's Triangle given a non-negative integer K.
Create an array to store the elements of the Kth row of Pascal's Triangle.
Use the formula C(n, k) = C(n-1, k-1) + C(n-1, k) to calculate each element in the row.
Return the array containing the Kth row of Pascal's Triangle.
Round duration - 90 minutes
Round difficulty - Medium
This was a Machine Coding Round/LLD round followed by HLD round which was taken by Video Conferencing and Screen Sharing.
Round duration - 60 minutes
Round difficulty - Easy
This was the last round. This was HM round followed by the HR round.
Tip 1 : Solve previously asked questions. It tells you about the level of questions that the company asks. Check glass-door reviews it will help you to know what kind of questions company ask
Tip 2 : Be real during the interview and don’t show off.
Tip 3 : Prepare for theory subjects like Object-Oriented Programming System, Database Management System, Computer networks, etc.
Tip 1 : Keep your resume simple with all work experience mentioned.
Tip 2 : Any unwanted information on the resume leaves a bad impact on the interviewer.
Tip 3 : You should be prepared to explain anything that’s written on your resume.
Tip 4 : Keep it of 1 page or 2 pages only
based on 5 interviews
Interview experience
Software Engineer
5
salaries
| ₹18 L/yr - ₹126.8 L/yr |
Senior Software Engineer
4
salaries
| ₹58 L/yr - ₹208 L/yr |
Uber
Ola Cabs
Meru cabs
Zoomcar