Filter interviews by
I applied via Recruitment Consulltant and was interviewed before May 2021. There were 2 interview rounds.
General coding questions
Top trending discussions
Machine coding, asked about JS concepts
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
Ds related questions
I applied via Naukri.com and was interviewed in Mar 2024. There were 2 interview rounds.
Use Python's built-in 'functools' module to check cache for function results.
Import 'functools' module
Use 'lru_cache' decorator to cache function results
Specify 'maxsize' parameter to limit cache size
Use 'cache_info()' method to get cache statistics
posted on 14 Apr 2024
I applied via Naukri.com and was interviewed before Feb 2023. There were 3 interview rounds.
DSA, linked list, unity movement code,basic unity questions
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 review
Rating in categories
Process Associate
325
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Care Executive
38
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Service Executive
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
23
salaries
| ₹0 L/yr - ₹0 L/yr |
MakeMyTrip
Yatra
Cleartrip
Goibibo