# OYO Rooms Interview Experience | Set 2 (For Fresher)

• Difficulty Level : Hard
• Last Updated : 11 Jun, 2019

There is an array of ‘x’ and ‘o’. From each ‘x’ a signal originates which travels in both direction. It takes one unit of time for the signal to travel to next cell. If a cell contains ‘o’ , the signal changes it to ‘x’ . Time taken so that array contains ‘x’ only.
Ex – Let array is a : {o, o, o, x, o, o, x}
At time t = 0 signal originates from a[3] and a[6]
At t = 1 state of array a:{o, o, x, x, x, x, x}
At t = 2 array a:{0, x, x, x, x, x, x}
At t = 3 a:{x, x, x, x, x, x, x} so ans is 3.

F2F-1 :

1. Regular expression to validate a password
2. Path in Matrix
3. Count ways to reach the n’th stair
4. Minimum number of dice throws to reach end in Snake and ladder game. Position of snakes and ladders are given in hash table.

F2F-2 :

1. Design questions – Hotel booking application design. Database design with classes.
2. About project mentioned in resume
3. Design of Tank game. There is a board in which 2 players will play. Each will have a tank from which they will shoot other tank. Design to implement this functionality. Follow up question how will you design if board size is infinite.
4. Some database queries. Query to update table if n number of rooms are booked for a hotel on a certain date.

F2F-3 :

1. Again database design for hotel bookings. How to handle many users who are trying to book a same hotel room simultaneously.
2. We have a centralized database of hotels and there are different hotels which also maintain their inventory on their side. These two databases need to be in sync always. How to manage this functionality if someone books and then cancels a room after 1 hour. Many follow up questions.
3. Questions related to projects.

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

My Personal Notes arrow_drop_up