OYO interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
OYO
2 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Algorithms, OOPs, DBMS, SQL, Web Development
Tip 1 : Do not rush into things. Learning takes time. Focus should be on the concepts and not just on leaving topics half-prepared. Devote 70% of both time and effort to DSA. I solved a total of around 500 questions on sites like GFG and Leetcode. Do not repeat similar questions just to increase the count of the number of questions
Tip 2 : Competitive Programming is a bonus and not a necessity, rather focus on core DSA based problems before trying CP. Do not pursue CP if you do not like it. Devote that extra time to core CS subjects and aptitude preparation.
Tip 3 : Projects play an important role too, do no ignore them. Try to get your hands dirty with a little bit of every field i.e., frontend, backend, and database.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Interview rounds
01
Round
Easy
Video Call
Duration45 mins
Interview date16 Sep 2022
Coding problem2
1. Reverse Only Letters
Easy
15m average time
85% success
0/40
Asked in companies
You are given a string, ‘S’. You need to reverse the string where characters that are not an alphabet stay in the same place, and the rest reverse their positions.
Eg: “a-bcd” becomes “d-cba”
Problem approach
You are given a string, ‘S’. You need to reverse the string where characters that are not an alphabet stay in the same place, and the rest reverse their positions.
Eg: “a-bcd” becomes “d-cba”
2. Search In The Array
Easy
15m average time
85% success
0/40
Asked in companies
You are given two arrays ‘arr’ of size ‘n’ and ‘queries’ of size ‘q’. For each element ‘q’ in the array 'queries', your task is to find the sum of all elements in the array ‘arr’ which are less than or equal to ‘q’.
For example: given array ‘arr = { 1, 2, 3, 3, 4, 5, 6, 7, 9, 10}’ and ‘ queries= { 3, 5}’
Then the sum of all elements whose value is less than or equal to
‘queries[0] = 3’ is ‘ 1+2+3+3 =9’.
‘queries[1] = 5’ is ‘1+2+3+3+4+5 =18’.
You have to return the answer of every query { 9, 18}.
Problem approach
You are given two arrays ‘arr’ of size ‘n’ and ‘queries’ of size ‘q’. For each element ‘q’ in the array 'queries', your task is to find the sum of all elements in the array ‘arr’ which are less than or equal to ‘q’.
For Example: Given Array ‘Arr = { 1, 2, 3, 3, 4, 5, 6, 7, 9, 10}’ And ‘ Queries= { 3, 5}’
Then The Sum Of All Elements Whose Value Is Less Than Or Equal To
‘Queries[0] = 3’ Is ‘ 1+2+3+3 =9’.
‘Queries[1] = 5’ Is ‘1+2+3+3+4+5 =18’.
You have to return the answer of every query { 9, 18}.
02
Round
Easy
Video Call
Duration45 mins
Interview date16 Sep 2022
Coding problem1
1. Technical Questions
What is JIT compiler?
Scheduling algos.
2nd highest salary using joins of tables
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4657 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by OYO
Selected 0 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by OYO
Rejected
1043 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by OYO
Rejected
812 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 114579 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 57825 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 34961 views
7 comments
0 upvotes