i
Ixigo.com
Filter interviews by
Clear (1)
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
Top trending discussions
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 Naukri.com and was interviewed in Jul 2024. There were 2 interview rounds.
2 questions - 1 was on map and other on graph
Designing an elevator system involves considering factors like capacity, speed, efficiency, and safety.
Consider the number of floors in the building and the expected traffic flow to determine the number of elevators needed.
Choose between different elevator types such as hydraulic, traction, or machine-room-less based on building requirements.
Implement a control system to optimize elevator movement and reduce wait times...
I applied via Job Portal and was interviewed in Jun 2024. There were 2 interview rounds.
3Sum, target sum backtracking quesion, leetcode medium question
MySQL is a relational database management system, while NoSQL databases are non-relational databases.
MySQL is a traditional relational database that uses tables to store data and SQL for querying.
NoSQL databases are non-relational and can be document-based, key-value pairs, wide-column stores, or graph databases.
MySQL is ACID-compliant and suitable for complex queries and transactions.
NoSQL databases are often used for...
based on 2 reviews
Rating in categories
Software Engineer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
MakeMyTrip
Yatra
Cleartrip
Goibibo