On-campus · Jun 2026
Software Engineer at OYO Rooms
A passionate competitive programmer
- Outcome
- Selected
- Rounds
- 2
- Format
- Virtual
- Panel
- Technical panel
What was the difficulty level of the interview? (1- very easy, 10-very difficult)
6/10
Tell us about the written/online test. (Aptitude, Coding, Test Platform, etc)
Online test of 90 minutes consisting of two coding questions. Questions: 1.Given a 2D matrix of characters and a word, find if the word exist in the 2D matrix. Starting from any position we can move in horizontal or vertical direction at each character. 2. Given a 2D matrix of numbers and a number N. Rotate the given matrix by 90° N times.
Describe your all Technical Interviews specifying number of rounds and details of each round (if any).
There were two PI rounds: Round 1 : Two coding question were asked: 1. Distance between two nodes in a given binary tree using only 1 transversal. 2. Given two sorted arrays. The second array has blank positions equal to number of elements in first array. Insert elements of first array in the second array such that resultant array is also sorted. Round 2 : In this round more theoretical questions were asked. Questions: 1. Rearrange a given linked list such that all the even numbers come before the odd numbers. 2. Explain the following: Topological Sorting Banker’s Theorem ( OS ) Indexing in DBMS 3. What happens when we search for google.com 4. Find longest increasing sub-sequence
Log in to view the remaining questions.
Log in