Filter interviews by
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
This had coding MCQ along with aptitude 15qs in 20mins.
3 questions
1 is database design and rest 2 were dsa
Top trending discussions
I applied via Approached by Company and was interviewed in May 2024. There was 1 interview round.
Had online coding round as part of screening. Questions were easy and made it through but didn't hear back form the recruiter
I applied via Approached by Company and was interviewed in Mar 2024. There was 1 interview round.
State props drilling is the process of passing down props from a parent component to a deeply nested child component.
Involves passing props through multiple levels of components
Can lead to prop drilling if not managed properly
Can be avoided by using context or Redux for state management
I applied via Campus Placement and was interviewed before Oct 2022. There were 2 interview rounds.
Design a calendar system that manages events, reminders, and scheduling for users efficiently.
Define user requirements: Understand what features users need, such as event creation, reminders, and recurring events.
Choose data structures: Use arrays or linked lists for storing events, and hash maps for quick access to dates.
Implement user interface: Design a simple UI for users to view, add, and edit events easily.
Consid...
Design a social networking platform with features like user profiles, news feed, messaging, and photo sharing.
Create user profiles with customizable information and privacy settings
Implement a news feed algorithm to display relevant content to users
Include messaging functionality for private communication between users
Allow users to share photos and videos on their profiles and in posts
It had 9 uqestions , one problem solving , one SQL , one API and 6 mcq
Easy assignment , if you hav eOOps knowledge you can do it
DSA - 3 Coding Questions
Design a scalable cab booking system for efficient ride management and user experience.
User Registration: Users can sign up using email or phone number.
Cab Availability: Real-time tracking of cabs using GPS for efficient allocation.
Booking Process: Users can book a cab by entering pickup and drop-off locations.
Payment Integration: Support for multiple payment methods like credit cards, wallets.
Driver App: A separate in...
I applied via Company Website and was interviewed before Dec 2020. There were 3 interview rounds.
Reverse a given Linked List with O(1) and O(N) space complexity.
For O(1) space complexity, use three pointers to reverse the links in place.
For O(N) space complexity, use a stack to store the nodes and then pop them to create the reversed list.
Be careful with edge cases such as empty list or list with only one node.
THis is an answer,jdkiukj froin feiudjcbiufjewbd
Merge Sort and Quick Sort are sorting algorithms that use divide and conquer approach.
Merge Sort divides the array into two halves, sorts them recursively, and then merges them.
Quick Sort selects a pivot element, partitions the array around the pivot, and recursively sorts the sub-arrays.
Merge Sort has a worst-case time complexity of O(nlogn), while Quick Sort has an average case time complexity of O(nlogn).
Merge Sort ...
Compute amount of water trapped in an elevation map after raining
Iterate through the array and find the maximum height on the left and right of each bar
Calculate the amount of water that can be trapped on each bar using the difference between the minimum of the two maximum heights and the height of the bar
Add up the amount of water trapped on each bar to get the total amount of water trapped
Zigzag traversal of a binary tree is a way of traversing the tree in a zigzag pattern.
Use a stack to keep track of nodes to be visited.
For each level, alternate between adding nodes to the stack from left to right and right to left.
Pop nodes from the stack and add their children to the stack in the appropriate order.
Repeat until all nodes have been visited.
Sort a dictionary by key or value in ascending/descending order.
Use sorted() function with lambda function to sort by key or value.
For ascending order, use reverse=False and for descending order, use reverse=True.
Example: sorted_dict = sorted(dictionary.items(), key=lambda x: x[0], reverse=True)
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There were 2 interview rounds.
First round was coding test in online mode which was quite easy.
based on 1 interview experience
Difficulty level
Duration
based on 1 review
Rating in categories
Associate Product Manager
6
salaries
| ₹12 L/yr - ₹20.5 L/yr |
Product Manager
6
salaries
| ₹18 L/yr - ₹31.8 L/yr |
QA Engineer
4
salaries
| ₹7.6 L/yr - ₹8.5 L/yr |
Associate Director
4
salaries
| ₹20 L/yr - ₹40 L/yr |
Customer Success Manager
4
salaries
| ₹7 L/yr - ₹7.5 L/yr |
Udaan
Swiggy
CARS24
BlackBuck