Me postulé a través de una facultad o universidad. El proceso tomó 1 día. Acudí a una entrevista en OYO (Roorkee) en dic 2018
Entrevista
HackerRank questions(2) from standard DP and graph problem and questions from OOPS,DBMS and OS.
Interview (two interviews) -
In the first interview i was asked two sum problem then three sum problem and then subset sum.After that an experimental question was asked like how to get an nth Fibonacci number in O(1)(amortised).
In the second
Basic dp problem and string problem
How will you implement round robin algo.
Resume discussion
What is REST API
How is POST different from PUT.
Given an array of numbers.You have to selected some elements such that their sum is maximum.Condition-If you select ith(value not index) number you cannot select i+1 and i-1.
like [2,2,5,5,3,6,5,3,4] if you select 3 then you will have to take all the occurrence of 3 but you cannot take 2 and 4
Me postulé a través de una facultad o universidad. El proceso tomó 2 días. Acudí a una entrevista en OYO (Gurgaon, Haryana) en jul 2025
Entrevista
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
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
Preguntas de entrevista [1]
Pregunta 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
