Agoda Interview Questions, Process, and Tips

Q1. Write program for merge sort
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half, and then merges the sorted halves.
• Divide the array into two halves

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer
Q2. Quick sort using o(1) space complexity
Ans. 
Quick sort can be implemented with O(1) space complexity by using an iterative approach and avoiding recursion.
• Use a stack to keep track of the partition indices instead of using recursion

• Iterate through the stack to perform partitioning and sorting steps

• Example: ['apple', 'banana', 'cherry', 'date', 'fig']
Answered by AI
Add your answer

Q1. Dsa questions medium level
Add your answer
Q2. Hld round to design near by landmarks/hotels
Add your answer

Two questions from LeetCode.

Prepare well for SQL. Rest all are basic DILR and Quant

Case study based on global tourism

Q1. General questions about workex, ambition etc
Add your answer
Q2. Tell me something about yourself
Add your answer
Q3. Why do you want to work in this industry
Add your answer