Filter interviews by
I applied via Company Website and was interviewed in Sep 2024. There was 1 interview round.
Top trending discussions
Implement boolean canConstruct(String targetString, String[] dict) which returns true if we can construct the targetString by concatenating the words given in the dictionary
Implement a key value store for storing and retrieving data efficiently.
Use a hash table or a balanced tree data structure to store key-value pairs.
Implement functions for inserting, updating, deleting, and retrieving key-value pairs.
Consider implementing features like transactions, concurrency control, and data persistence.
Example: Implement a simple key value store using a hash table in Python.
I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.
I appeared for an interview in Jun 2022.
I appeared for an interview before Jul 2023.
45 min round. Similar to Leetcode medium level question.
45 min coding round, 2 question asked
Design a system for proximity service
Utilize geolocation data to track user locations
Implement algorithms to calculate proximity between users
Use real-time updates to notify users of nearby contacts
I applied via Approached by Company and was interviewed before Nov 2022. There were 3 interview rounds.
Brush up on DS and Algorithms
posted on 24 Aug 2024
I applied via Referral and was interviewed before Aug 2023. There were 4 interview rounds.
Find the longest subsequence in an array with sum zero.
Iterate through the array and keep track of the running sum.
Store the running sum in a hashmap along with the index.
If the same sum is encountered again, the subsequence between the two indices has a sum of zero.
The diameter of a tree is the longest path between two leaf nodes in the tree.
Calculate the longest path between two leaf nodes in the tree
This can be done by finding the height of the left and right subtrees and adding them together
The diameter of the tree is the maximum of either the diameter of the left subtree, the diameter of the right subtree, or the sum of the heights of the left and right subtrees
Design a hotel booking system for managing reservations and availability.
Use a database to store hotel information, room availability, and reservations.
Implement user authentication and authorization for booking.
Include a search feature for users to find available rooms based on their criteria.
Allow users to make reservations, modify or cancel them.
Send confirmation emails to users after successful bookings.
Divide one big integer by another
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
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.
posted on 19 Dec 2023
I applied via LinkedIn and was interviewed in Nov 2023. There were 2 interview rounds.
Create subarrays with sum = 0 from given array of integers.
Iterate through the array and keep track of the running sum.
Store the running sum in a hashmap and check if the current sum - any previous sum equals 0.
If yes, then the subarray between those two indices has a sum of 0.
The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
Traverse the tree in a level order manner and keep track of the first node at each level.
Use a queue to store nodes at each level and update the left view nodes accordingly.
Example: For a binary tree with root node 1, left child 2, and right child 3, the left view would be [1, 2].
based on 1 interview
Interview experience
AD Operations Specialist
18
salaries
| ₹3.8 L/yr - ₹8.8 L/yr |
Software Developer
12
salaries
| ₹11 L/yr - ₹31.8 L/yr |
Software Engineer
11
salaries
| ₹7 L/yr - ₹16.4 L/yr |
Technical Lead
11
salaries
| ₹9.3 L/yr - ₹32 L/yr |
Associate Manager
10
salaries
| ₹13.5 L/yr - ₹25 L/yr |
Amazon
Udaan