i
Fareportal
Filter interviews by
I applied via LinkedIn and was interviewed in Mar 2024. There were 2 interview rounds.
Top trending discussions
I applied via Recruitment Consulltant and was interviewed in Sep 2021. There was 1 interview round.
I applied via Recruitment Consultant and was interviewed before Jun 2019. There were 5 interview rounds.
I applied via Recruitment Consulltant and was interviewed before May 2023. There were 3 interview rounds.
I was interviewed in Mar 2024.
I have met good experience
I was interviewed in Oct 2024.
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
I applied via LinkedIn and was interviewed before Mar 2023. There were 3 interview rounds.
To find the kth minimum element from a Binary Search Tree (BST)
Perform an in-order traversal of the BST to get elements in sorted order
Return the kth element from the sorted list
Time complexity: O(n) where n is the number of nodes in the BST
To find swapped numbers in a BST, perform inorder traversal and keep track of previous node.
Perform inorder traversal of the BST
Keep track of the previous node while traversing
If at any point, the current node's value is less than the previous node's value, those are the swapped numbers
Logical and qunatative
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Senior Executive
417
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
131
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
129
salaries
| ₹0 L/yr - ₹0 L/yr |
Executive
112
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
103
salaries
| ₹0 L/yr - ₹0 L/yr |
MakeMyTrip
Yatra
Cleartrip
Goibibo