Filter interviews by
I applied via Referral and was interviewed before Mar 2023. There were 3 interview rounds.
I applied via Approached by Company and was interviewed in Oct 2021. There were 3 interview rounds.
Situation bases questions
I am an experienced professional with a strong background in the field. I have a proven track record of success and a passion for what I do.
I have over 10 years of experience in the industry
I have worked with top-tier clients and successfully managed complex projects
I have a deep understanding of the industry trends and market dynamics
I am skilled in building and maintaining strong client relationships
I have a track re...
I applied via Naukri.com and was interviewed before May 2023. There was 1 interview round.
25 basic aptitude asked from train,time and work
2 coding questions which was basic and medium questions
I applied via LinkedIn and was interviewed in Jan 2023. There were 3 interview rounds.
It was 2 coding questions of medium level
Find the longest substring in a given string that does not contain any repeating characters.
Use a sliding window approach to iterate through the string.
Keep track of the characters seen so far using a set.
Update the start and end indices of the window to find the longest substring.
Return the length of the longest substring.
Easy coding questions
Tough level questions , needed high level of thinking
Search for a target value in a 2D matrix efficiently.
Use binary search on rows to find the potential row where the target value may exist.
Then use binary search on that row to find the target value.
Find quadraplets in an array that sum up to a target value.
Use a nested loop to iterate through all possible combinations of quadraplets.
Keep track of the sum of each quadraplet and compare it to the target value.
Return the quadraplets that match the target sum.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a hash table to store key-value pairs
Use a doubly linked list to keep track of the order of items
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the back of the list
Lookup and insertion should be O(1) time complexity
Implement 2 stacks in an array
Divide the array into two halves
Use top1 and top2 to keep track of top elements of stacks
Push and pop elements from respective halves
Check for overflow and underflow conditions
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
Questions from trees and linkedin
Reverse a linked list using multiple approaches.
Iterative approach: Use three pointers to reverse the links between nodes.
Recursive approach: Recursively reverse the rest of the list and adjust the links.
Stack approach: Push all the nodes onto a stack and then pop them to create the reversed list.
I applied via Referral and was interviewed in Apr 2024. There were 3 interview rounds.
1 hr, there were some DSA problems
1 hr, there were some DSA problems
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Assistant Manager
98
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
82
salaries
| ₹0 L/yr - ₹0 L/yr |
Deputy Manager
59
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Senior Executive
55
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager- Corporate Sales
52
salaries
| ₹0 L/yr - ₹0 L/yr |
MagicBricks
Impact Guru
Netmeds.com
Tracxn