OYO Rooms Interview Experience | Set 10 (SDE-1) Improve Improve Improve Like Article Like Save Article Save Share Report issue Report Off-Campus hiring drive for SDE-1 Round 1: Two Coding Questions on Hackerrank ( 90 minutes ) https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/practice-problems/algorithm/decode-1-6eab2976/ Print a given matrix in spiral form Round 2: F2F Discussed approach for these questions and asked to write code for the same. Remove duplicates from an unsorted array. Lowest Common Ancestor in a Binary Tree Minimum number of jumps to reach end of an array Round 3: F2F Find the element before which all elements are smaller and after which all elements are greater Cutting Rod dp Difference between semaphore, mutex and binary mutex. Difference between a thread and a process. 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 Given sorted dictionary find precedence characters LRU implementation Producer Consumer Problem It was a positive experience, I was able to answer all the questions. Result awaited. Last Updated : 12 Jun, 2019 Like Article Save Article Previous OYO Rooms Interview Experience | Set 8 (Software Engineer) Next Python | Message Encode-Decode using Tkinter Share your thoughts in the comments Add Your Comment Please Login to comment...