I applied through university. The process took 1 day. I interviewed at OYO (Gurgaon, Haryana) in Sept 2024
Interview
3 rounds
All DSA
Linked list (medium)
binary search (hard)
LFU (med-hard)
They have pretty standard Neetcode 150 questions, mostly med-hard.
Graphs and Topological sort is also important.
Other than that basic resume projects and Core CS is asked. Mostly OS, DBMS.
Interview questions [1]
Question 1
3 rounds
All DSA
Linked list (medium)
binary search (hard)
LFU (med-hard)
They have pretty standard Neetcode 150 questions, mostly med-hard.
Graphs and Topological sort is also important.
Other than that basic resume projects and Core CS is asked. Mostly OS, DBMS
It was ok
1st round was an OA, there were two questions of DSA it included graphs and trees questions.
There were two technical interviews after that.
The questions were from Trees, graphs, arrays which included stacks and binary search questions and core concepts as well like OS, DBMS, CN.
Interview questions [1]
Question 1
One question was about boundary traversal of trees, another was zigzag traversal, another was simple search in a rotated sorted array and a graph question using DFS or BFS
they asked me 2 Dsa questions.
One was suppose an array which only contains 0,1,2......you have to sort it.
Another was....2 sorted arrays are given we have to find 4th largest element from both the arrays combined.
Interview questions [1]
Question 1
One was suppose an array which only contains 0,1,2......you have to sort it.
I applied through university. The process took 1 day. I interviewed at OYO (Gurgaon, Haryana) in Oct 2024
Interview
there were 2 rounds of interview :
1st round was pure dsa with 2-3 questions . Questions were random with mostly one hard and one medium on leetcode .
2nd round :
This round was mainly about core cs subjects like OS , OOPS .
Students were also asked 1 DSA problem and mix of system design and sql and web-dev. based on your resume.
Interview questions [1]
Question 1
q1 clone a linklist .
q2 find the min length of subarray with sum atleast equals to k .
