Filter interviews by
Clear (1)
I applied via Approached by Company and was interviewed in Jun 2024. There were 2 interview rounds.
Search for a target value in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Determine which half of the array the target value lies in based on the pivot point.
Continue binary search in the appropriate half of the array to find the target value.
Design IMDB with concurrent ratings management
Implement a locking mechanism to ensure only one user can update a rating at a time
Use a queue system to handle multiple rating requests in an orderly manner
Consider using distributed systems to handle high concurrency levels
Design a vehicle rental system API
Create endpoints for listing available vehicles, booking a vehicle, and returning a vehicle
Include authentication and authorization mechanisms for users and admins
Implement payment gateway integration for processing rental payments
Include features like vehicle search, filtering, and reviews/ratings
Consider scalability and performance optimizations for handling high traffic
Top trending discussions
I applied via Naukri.com and was interviewed before Sep 2021. There were 4 interview rounds.
System Design. Design backend of Amazon
I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.
It was a ideal machine coding round. Consisting of a question to be completed within 45 mins. For a given manager to employee hierarchy, count direct + indirect repartees.
I applied via Referral and was interviewed in Sep 2024. There was 1 interview round.
Print nodes of n-ary tree in arc wise manner from outside
Traverse the tree level by level from outside to inside
Use a queue to keep track of nodes at each level
Print the nodes at each level in a clockwise or anticlockwise manner
Mostly DSA expect DP, graph problems
Asked medium level graph question.
Asked LLD question with at flow executable.
I applied via Job Portal and was interviewed in May 2024. There was 1 interview round.
React based
problem solving round
I applied via Recruitment Consultant and was interviewed in Sep 2020. There were 4 interview rounds.
Merge two lists with different intervals based on overlapping intervals.
Sort both lists based on start time.
Iterate through both lists and compare intervals for overlap.
Merge overlapping intervals and add non-overlapping intervals to the result list.
I applied via Company Website and was interviewed in Feb 2024. There were 3 interview rounds.
3 easy to medium level DSA questions on hackerank
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.
Iterate through the matrix and find the doors
Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door
Update the distance matrix with the minimum distances
Find kth smallest element in unordered array with O(1) space
Use the QuickSelect algorithm to partition the array and find the kth smallest element
Choose a pivot element and partition the array into two subarrays
Recursively partition the subarray that contains the kth smallest element
Repeat until the pivot element is the kth smallest element
Time complexity: O(n) average case, O(n^2) worst case
To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.
Get your list of friends
For each friend, get their list of friends
Exclude yourself and your friends from the final list of friends of friends
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Operations Specialist
32
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Manager
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Transport Executive
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Ridecell
QuickRide
Rapido
Shuttl