OYO Rooms Interview Experience | Set 10 (SDE-1)

Off-Campus hiring drive for SDE-1

Round 1: Two Coding Questions on Hackerrank ( 90 minutes )

  1. https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/practice-problems/algorithm/decode-1-6eab2976/
  2. Print a given matrix in spiral form

Round 2: F2F



Discussed approach for these questions and asked to write code for the same.

  1. Remove duplicates from an unsorted array.
  2. Lowest Common Ancestor in a Binary Tree
  3. Minimum number of jumps to reach end of an array

Round 3: F2F

  1. Find the element before which all elements are smaller and after which all elements are greater
  2. Cutting Rod dp
  3. Difference between semaphore, mutex and binary mutex.
  4. Difference between a thread and a process.
  5. What happens when parent process is killed and child process still exist.

Round 4: F2F

Detailed discussion about the work currently doing and features developed.
Discussion about project done in internship.

Round 5: F2F

  1. Given sorted dictionary find precedence characters
  2. LRU implementation
  3. Producer Consumer Problem

It was a positive experience, I was able to answer all the questions. Result awaited.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.




Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.