Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso OYO
Colloquio nella media
Candidatura
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso OYO nel mese di set 2022
Colloquio
Oyo came to our college for job role - SDE-I.
First round was coding round in which there were three questions.
Second round was only on DSA.
Third round had 1 DSA question + DBMS questions + OS questions.
Domande di colloquio [1]
Domanda 1
Coding Round - Three questions were there.
-First one was easy stock buy and sell problem.
- Second one was tree based hard problem . Similar question would be - number of ways to build ant colony on Leetcode.
- Third quesition was medium array based problem
Interview Round 1 - Two coding questions were there and then a little discussion on coding round questions.
- First one was number of rooms required of arrival and departure dates of bookings is given.
- Second one was a array problem. In the problem array of integers was given and we can apply 1 operation which increases the value of a element by 1. We were given the max number of possible operations and asked to find the maximum frequency of any element we can get.
Interview Round 2 - Coding question was - Boundary Traversal of a Binary Tree.
After which he asked me some DBMS and OS question.
I was rejected in this round :(
My recruitment process took 1 coding round and 3 round of interviews. First round of interview was based on standard coding questions, second round was a bit difficult than first one which was also coding round. Third round was theoretical round
Domande di colloquio [1]
Domanda 1
Tree traversal questions, Segment tree, Array simulation questions
the interview consists of 3-4 rounds depending upon your performance.
all 3 rounds were focused on data structure and algorithms and all questions were from geeksforgeeks. so prepare them accordingly. but in my opinion its totally dependent on your luck because they can ask you difficult questions from graph theory or easy one from linked list and trees.
Domande di colloquio [1]
Domanda 1
Minimum number of edges between two vertices of a Graph.
Print all paths from a given source to a destination using BFS
