J'ai postulé via une autre source. Le processus a pris 2 jours. J'ai passé un entretien chez OYO en juil. 2017
Entretien
1.Written round
A)Given an array of integers,print all the pairs whose sum is present in array?
B)Given an array and few queries.
Query tell you about the start index and end index to which a number is to be added.For example 0 3 8 mean to all elements in array from index 0 to 3 add 8.
There were n queries ,you have to print final modified array
2.Technical Interview
A)Optimize solutions for above questions?
B)Given a linked list which consists of data,next and random pointer.Clone this list?
Questions d'entretien [1]
Question 1
Given an array of integers,print all the pairs whose sum is present in array?
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 (Gurgaon, Haryana) en juil. 2025
Entretien
Began with a test 2 coding ques followed by 2 tech interviews and then hr interview.ques were asked from graph and sliding window slightly molded from the ones at leetcode
J'ai passé un entretien chez OYO (Gurgaon, Haryana)
Entretien
2 rounds with DSA where the topic was trees and had to solve the question in O(n) time and space complexity, but the interview was good and the person behind the desk was also nice
Questions d'entretien [1]
Question 1
2 dsa questions were asked in the interview both fron topic trees
2 dsa and quiz and dbms indexing normalization keys and such questions. Dsa binary search and palindrome partitioning and rest was basic complexity.
Just keep calm and make interactive and confident
