Skip to content
Related Articles

Related Articles

OYO Rooms Interview Experience | Set 9 (Software Developer)
  • Difficulty Level : Hard
  • Last Updated : 12 Jun, 2019

Drive was conducted for software developer (6 months work ex)

Round 1: two written questions
Check if a binary tree is subtree of another binary tree

Round 2: F2F

 discussion of above 2 questions and
Maximum Product Subarray
Bottom View of Binary Tree

Round 3: F2F

– Given n numbers having k unique numbers and rest repeated where k<<n, sort them in time complexity less than O(nlogn)
– Sort array having numbers 1, 2, 3 only
– One thread (for printing 1, 100 times) vs 10 threads ( each printing 1, 10 times), which one is better and why ? advantages and disadvantages of both
– SQL query
(city_name, hotel_id) (hotel_id, hotel_name, date, hotel_price(per day))
find the name of the most expensive hotel in each city, where a hotel is considered most expensive if its average price of past one month > average price of others over the month
– Diamond inheritance problem in c++ and its solution


Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :