Related Articles
OYO Rooms Interview Experience | Set 7
• Difficulty Level : Medium
• Last Updated : 12 Jun, 2019

Round 1:

2 coding questions:

1. Given an array, find an element before that all elements are smaller than it, and after that all are greater than it. return index if any such item is present. otherwise return -1.
2. Given a binary tree. Print bottom view from left to right.

Round 2:

Discussed round 1 solutions.

1. Print a linked list in zigzag order.
`e.g. 1->2->3->4->5 output should be : 1, 5, 2, 4,3`

Hint: you can modify the list

2. There is incoming stream of integers. You have to continuously find kth largest element.
3. A knight is present at initial position (i,j) in a nxn matrix. you have given a destination position (x,y). Find out minimum number of moves in that knight can reach to destination.

Round 3:

1. You have given an integer array and only three operations are allowed ( subtract x, add x, pass) any of them only once. You have to tell by using these operations can you equalize the array or not. e.g.  arr = {9,3,6} output: yes, by using -3, +3, pass
2. Tell if a given number N is perfect square or not.