J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 jours. J'ai passé un entretien chez OYO (Jaipur, Rajasthan) en nov. 2020
Entretien
This was an onsite two days process.
First day
1. online test( Programming + cs fundamentals multiple choice questions): It contained two coding questions.
Second day
2. Two technical interviews: Based on data structures questions like a tree and dynamic programming
Questions d'entretien [1]
Question 1
1. Longest Palindromic Subsequence.
2. Print the top view of a binary tree.
3. Minimum distance between the two nodes of the binary tree.
J'ai passé un entretien chez OYO (Gurgaon, Haryana)
Entretien
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.
Questions d'entretien [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.
Questions d'entretien [1]
Question 1
One was suppose an array which only contains 0,1,2......you have to sort it.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez OYO (Gurgaon, Haryana) en oct. 2024
Entretien
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.
Questions d'entretien [1]
Question 1
q1 clone a linklist .
q2 find the min length of subarray with sum atleast equals to k .
