OYO Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 189 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at OYO.
OYO
Software Development Engineer
Entry Average Neutral experience No offer 3 rounds
Interview process
Take home Technical screen Technical screen
Interview formats
Coding Technical
It was ok, first they gave an online assessment (OA) with two DSA questions covering graphs and trees. Then there were two more technical interviews. They asked about trees, graphs, and arrays, including questions on stacks and binary search, plus core concepts like OS, DBMS, and CN.
Confirmed questions4 questions
- Could you explain the boundary traversal of trees?
- How would you implement zigzag traversal for trees?
- What's the approach to search in a rotated sorted array?
OYO
Software Development Engineer
Mid Difficult Positive experience Accept offer 3 rounds
Interview process
Technical screen Technical screen Technical screen
Interview formats
Coding Technical
Had 3 rounds. They focused on standard Neetcode 150 questions, mostly medium-hard difficulty. Topics included Linked Lists, Binary Search, and LFU cache. Graphs and Topological sort were also important. Additionally, they asked about basic resume projects and core Computer Science concepts like Operating Systems (OS) and Database Management Systems (DBMS).
Confirmed questions5 questions
- Three rounds covering all DSA, with Linked List at medium difficulty, Binary Search at hard, and LFU at medium-hard.
- Standard Neetcode 150 questions, mostly med-hard.
- Graphs and Topological sort are also important.
OYO
Software Engineer Intern
Intern Average Positive experience Accept offer 3 rounds
Interview process
Technical screen Technical screen Technical screen
Interview formats
Technical Coding
It's a 2 round process, R1 and R2. If you do well in both, you get a 3rd round. They ask easy to medium LeetCode questions and evaluate based on Data Structures, Problem Solving, Algorithms, etc.
Confirmed questions2 questions
- Implement a Minimum Stack.
- Solve a dictionary search problem using a trie.
OYO Software Engineer Interview Questions
Quoted word for word from OYO interview reports.
“If given an integer, how can we generate all valid parenthesis pair patterns? For n=2, the valid pairs are: ()() and (()).”
Read reports →“What is the biggest island of 1's in a nxn matrix with only 0s and 1s?”
Read reports →“If a node in a binary tree catches fire, how long would it take for all nodes to burn?”
Read reports →“What is the minimum number of minutes required for all fresh oranges to rot, given an m x n grid where rot spreads to adjacent fresh oranges every minute? If it's impossible for all oranges to rot, return -1.”
Read reports →“In a 2D grid, where should a bomb be placed so that army personnel take the longest time to reach it?”
Read report →“Given an array, if you can jump from one index to another based on the value at the current index, what is the minimum number of jumps required to reach the last index?”
Read report →“Can you implement a check to see if a linked list is a palindrome in just one traversal?”
Read report →“What's the way to compute 'a' to the power of 'n', and how can we optimize this calculation to achieve a time complexity of O(log n)?”
Read report →“Given an array and several queries, where each query specifies a range (start index, end index) and a value to add to all elements within that range, output the final state of the array after all queries.”
Read report →Formats, difficulty and experience
Across all 189 OYO interview reports.