Filter interviews by
I applied via Referral and was interviewed before Aug 2023. There were 4 interview rounds.
Will ask any medium or easy leetcode questions... mine was to get the longest subset of identical characters and also to give it's length without using the in built length function.
Will ask you to optimise the code as much as possible will ask what is your BigO of your code.
How will you solve and make a bridge crossing system, which have some constraints like during rush hours no heavy transport is allowed.
Yes, I have researched about the company.
Researched company history, mission, and values
Reviewed recent news and press releases
Explored company culture and employee reviews
Examined products/services offered by the company
Looked into the company's competitors and market position
Seeking new challenges and opportunities for growth.
Desire for new challenges and learning opportunities
Looking for career advancement and growth
Seeking a better work-life balance
Company culture or values misalignment
Relocation to a new city or country
Address the issue directly with the peer and offer support and guidance to help improve their performance.
Have a one-on-one conversation with the peer to discuss their performance and identify any challenges they may be facing.
Provide constructive feedback and offer resources or training to help them improve.
Set clear expectations and goals for improvement, and follow up regularly to track progress.
Offer mentorship or ...
Top trending discussions
I was interviewed in Aug 2021.
Round duration - 60 minutes
Round difficulty - Medium
Timing was fine - It was in the afternoon
Interviewer was friendly and helpful
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Handle edge cases like empty array or no duplicates found.
Example: For input [0, 3, 1, 2, 3], output should be [3].
Round duration - 60 minutes
Round difficulty - Medium
- Timing was fine - Afternoon
- Interviewer was friendly
Designing a caching library involves considering data storage, retrieval, expiration policies, and cache invalidation strategies.
Define the caching requirements such as data size, access patterns, and expiration policies.
Choose a suitable data structure for caching like LRU, LFU, or a simple key-value store.
Implement cache eviction policies to handle memory constraints and optimize performance.
Consider thread safety an...
Round duration - 60 minutes
Round difficulty - Medium
- Timing was fine - Afternoon
- Interviewer was friendly
A 10x10 cube has 600 edges.
A cube has 12 edges, so a 10x10 cube would have 12 edges on each of its 6 faces.
12 edges x 6 faces = 72 edges for the entire cube.
However, each edge is shared by two faces, so we need to divide by 2 to get the total number of unique edges.
72 edges / 2 = 36 unique edges on the outer surface of the cube.
Since the cube has 10x10x10 = 1000 unit cubes, each with 12 edges, we need to subtract the e...
Tip 1 : Be confident
Tip 2 : Be always ready for white board coding
Tip 3 : Brush up your basics
Tip 1 : Resume should not be more than 1 page long
Tip 2 : Write down your technical skills, Frameworks
Ds related questions
Detect loop in a LinkedList
Use two pointers, one moving at twice the speed of the other
If there is a loop, the faster pointer will eventually catch up to the slower one
If there is no loop, the faster pointer will reach the end of the list
I applied via Recruitment Consulltant and was interviewed before Jun 2023. There were 2 interview rounds.
Autosuggest debounce is a feature that delays the search suggestions until the user stops typing, and a polyfill is a piece of code that provides functionality that is not natively supported by the browser.
Implement a debounce function to delay the autosuggest feature until the user stops typing.
Use a polyfill to provide support for the autosuggest feature in browsers that do not natively support it.
Example: Implement ...
Kadane's algorithm is used to find the maximum subarray sum in an array of integers.
Iterate through the array and keep track of the maximum sum ending at each index.
At each index, choose between extending the previous subarray or starting a new subarray.
Example: For array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum subarray sum is 6 (from index 3 to 6).
I applied via Approached by Company and was interviewed in Aug 2023. There were 3 interview rounds.
Interviewer asked two coding question medium level
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There was 1 interview round.
I was asked 2 DSA questions. I answered them but the interviewer wasn't aware of the complexity of different Data structures so according to him my solution was taking n^3 complexity whereas it was actually the solution of n
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Developer
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Web Developer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
MakeMyTrip
Cleartrip
Yatra
Goibibo