Interview Experience | On Campus - Sep 2022

New update is available. Click here to update.

SDE - 1

OYO

2 rounds | 3 Coding problems

Anonymous

Fresher | Sep 2022

Rejected

63 views

0 comments

0 upvotes

Interview preparation journey

Preparation

Duration: 3 months

Topics: Data Structures, Algorithms, OOPs, DBMS, SQL, Web Development

Tip

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

Resume tip

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.

Interview rounds

Round

Easy

Video Call

Duration45 mins

Interview date16 Sep 2022

Problems2

Reverse Only Letters

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”

Try solving now

Search In The Array

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 ...

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’...

Try solving now

Round

Easy

Video Call

Duration45 mins

Interview date16 Sep 2022

Problems1

Technical Questions

What is JIT compiler?
Scheduling algos.
2nd highest salary using joins of tables