OYO Interview Experience | SDE-2

Round 1:

1. Water island problem : https://www.geeksforgeeks.org/find-number-of-islands/
   • Space & time complexity
2. Sorted output from 2 bst : https://www.geeksforgeeks.org/merge-two-bsts-with-limited-extra-space/
3. Class design for a game of billiards.
4. Caching methodology
   • LRU caching
   • If 4 GB cache and 4 GB RAM available, what will you use? Why?
5. Database indexing techniques.
6. Which SQL will you use? MySQL, PostgreSQL, NoSQL and why?

Round 2:

1. Fully functional code
2. Merge sort for the array: https://www.geeksforgeeks.org/merge-sort/
   • Extended the question to merge 2 linked list: https://www.geeksforgeeks.org/merge-two-sorted-linked-lists/
   • Extended the question to merge sort on the linked list:
3. Binary tree zig-zag traversal : https://www.geeksforgeeks.org/zigzag-tree-traversal/

Round 3:

1. Discussion about projects at current organisation.
2. Distance b/w 2 nodes in a binary tree: https://www.geeksforgeeks.org/find-distance-between-two-nodes-of-a-binary-tree/
3. Your API response time suddenly shot up overnight. Discuss debugging and corrective measures
   • Some code was pushed the previous day
   • No code was pushed the previous day

Round 4:

1. Design promotions for hotels
   • Page ranking basic criteria
   • What parameters will you include?
     • Hotels targetted
     • Users targetted
     • Events targetted
   • Bookings for some group of hotels are less than last week
     • How will you increase the numbers?
     • How will you calculate the revenue/profit metric?