Filter interviews by
Clear (1)
I applied via Naukri.com and was interviewed before Nov 2022. There were 5 interview rounds.
Hashing questions like find the most frequency number in hiven array
Finding the loop in a linked list
Use two pointers, one slow and one fast, to detect a loop
If the fast pointer catches up with the slow pointer, there is a loop
Once a loop is detected, use another pointer to find the start of the loop
I applied via Naukri.com and was interviewed before Sep 2021. There were 6 interview rounds.
Basic Java programming test which will test you on problem solving skills and assess the knowledge on java
High Level overview of product development
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
posted on 16 Oct 2023
I applied via Approached by Company and was interviewed before Oct 2022. There were 2 interview rounds.
Distributed systems are a network of independent computers that work together to achieve a common goal. Security can be maintained through encryption, authentication, access control, and monitoring.
Distributed systems consist of multiple computers that communicate and coordinate actions to achieve a common goal.
Security in distributed systems can be maintained through encryption of data in transit and at rest.
Authentic...
Container orchestration tools are crucial for managing the deployment, scaling, and monitoring of large complex systems.
Container orchestration tools help automate the deployment and scaling of containerized applications, making it easier to manage large complex systems.
They provide features like service discovery, load balancing, health checks, and auto-scaling, which are essential for ensuring high availability and p...
I applied via Approached by Company and was interviewed in Jan 2022. There were 2 interview rounds.
Map and unordered_map are associative containers that store elements in key-value pairs.
Map is implemented as a balanced binary tree while unordered_map is implemented as a hash table.
Map stores elements in sorted order based on the key while unordered_map does not guarantee any specific order.
Map has a slower insertion and deletion time complexity than unordered_map.
Map is useful when we need to maintain elements in a...
Sort array of strings based on frequency of digits in each element.
Create a dictionary to store frequency of digits in each element.
Sort the array based on the frequency of digits using the dictionary.
Handle ties by sorting based on the original order of elements.
I applied via Recruitment Consultant and was interviewed in Aug 2021. There were 3 interview rounds.
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).
based on 1 interview
Interview experience
based on 19 reviews
Rating in categories
Senior Software Engineer
141
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
44
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Developer
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Amadeus
Expedia Group
Booking Holdings
CWT