i
Agoda
Filter interviews by
Basic substring matching problem
I applied via LinkedIn and was interviewed in Sep 2023. There were 2 interview rounds.
A subway system designed with multiple lines connecting key locations in a city for efficient transportation.
Create a network of subway lines connecting key locations such as downtown, residential areas, and commercial districts
Include transfer stations where passengers can switch between different lines
Design stations with clear signage, maps, and ticketing systems for easy navigation
Consider factors like frequency of...
Simple array based question, more about problem solving. Try to solve the problem instead of thinking of the most optimal approach.
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
Basic coding test from hackerearth.
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
The Dutch Flag problem involves sorting an array of strings with three possible values in a specific order.
Create three pointers to keep track of the boundaries of each color group
Iterate through the array and swap elements to group them in the correct order
Time complexity of O(n) can be achieved by a single pass through the array
I applied via Approached by Company and was interviewed in Jun 2024. There were 3 interview rounds.
A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward.
Use dynamic programming to solve this problem efficiently.
Iterate through the string and expand around each character to find the longest palindrome.
Consider both odd and even length palindromes.
Example: Input 'babad', Output 'aba' or 'bab'.
Generate all possible subsequences of a given string.
Use recursion to generate all possible combinations of characters in the string.
At each step, include or exclude the current character to form subsequences.
Store each subsequence in an array of strings.
Find and print the longest substring with k unique characters in an array of strings.
Iterate through the array of strings and keep track of the longest substring with k unique characters.
Use a sliding window approach to efficiently find the longest substring.
Keep a hashmap to store the frequency of characters in the current window.
Update the window boundaries based on the number of unique characters.
Return the longest
Designing search systems involves creating efficient algorithms and data structures to quickly retrieve relevant information.
Understand the data structure of the search system (e.g. inverted index, trie)
Implement efficient search algorithms (e.g. binary search, hash tables)
Consider scalability and performance optimization techniques (e.g. caching, indexing)
Include user-friendly features like autocomplete and spell corr...
I applied via Approached by Company and was interviewed in Mar 2024. There was 1 interview round.
The rain water problem involves calculating the amount of rainwater that can be trapped between buildings or structures.
Calculate the maximum height of water that can be trapped at each position
Subtract the height of the building at each position to get the water level
Sum up the water levels at each position to get the total amount of trapped rainwater
The written test consisted of two DS programs.
based on 2 interviews
Interview experience
Software Engineer
31
salaries
| ₹15 L/yr - ₹52 L/yr |
Senior Software Engineer
31
salaries
| ₹25 L/yr - ₹74 L/yr |
Senior Product Manager
10
salaries
| ₹50 L/yr - ₹102 L/yr |
Engineering Manager
9
salaries
| ₹68 L/yr - ₹102.5 L/yr |
Software Developer
7
salaries
| ₹15 L/yr - ₹36 L/yr |
Udaan
BigBasket
Swiggy
CARS24