SDE - 1
OYO
2 rounds | 4 Coding problems
80 views
Interview preparation journey
Preparation
Duration: 3 months
Topics: OOPS, Core Java, DBMS, SQL & PL/SQL, Data Structures and Algorithms, UI (HTML, JS), SDLC, Java 8 concepts, UML diagrams, Collections, Multithreading, Exception Handling, Hashing, Recursion problems.
Tip

Tip 1 : Practice more problem-solving questions
Tip 2 : Understand the concepts in depth
Tip 3 : Try to work on one or two hands on projects to get more experience in that stack.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume tip

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

Interview rounds
01
Round
Medium
Video Call
Duration45 minutes
Interview date5 Sep 2022
Problems2
Kth largest element in the unsorted array

#### You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.

##### Example:
view more
Problem approach

I gave the max-heap based approach, in which I told him to insert every item into the max-heap, and then return the top K. For this, he asked the time Complexity, I answered O(Klog(K*N)). He told me to optimize it further. This time I gave a pointer based approach, i.e., to set a pointer at every category and then check for max among them, then increment count for the pointer of the category in...

view more
DBMS Questions

Draw E-R Diagram for Ola.

Problem approach

Tip 1 : Revise ER diagrams and practice them
Tip 2 : List all entities and their relationships involved with the app.
Tip 3 : After drawing tables apply normalization to reduce redundancy.

02
Round
Medium
Video Call
Duration45 minutes
Interview date5 Sep 2022
Problems2
Maximum sum path from the leaf to root

#### Your task is to find the path from the leaf node to the root node which has the maximum path sum among all the root to leaf paths.

view more
Problem approach

For each node there can be four ways that the max path goes through the node:
1. Node only
2. Max path through Left Child + Node
3. Max path through Right Child + Node
4. Max path through Left Child + Node + Max path through Right Child

The idea is to keep trace of four paths and pick up the max one in the end. An important thing to note is, root of every subtree need to retu...

view more
Sort A Partial Sorted Array

#### Ninja has been given an arbitrary array of integers of size ‘N'. You can think of the array as the concatenation of two individually sorted arrays in non-decreasin...

view more
Problem approach

I didn't knew the solution so I thought of this as given n arrays having m nos in each array and we need to sort all arrays with space cmplexity of the order O(nlogm) but definitely not O(m*n) due to memory constraints.
So this is a common Priority Queue Problem for which I told the approach.

Start a Discussion
Similar interview experiences
SDE - 1
3 rounds | 3 problems
Interviewed by OYO
139 views
SDE - 1
3 rounds | 4 problems
Interviewed by OYO
129 views
SDE - 1
2 rounds | 4 problems
Interviewed by OYO
5 views
SDE - Intern
2 rounds | 5 problems
Interviewed by OYO
7 views
Companies with similar interview experiencs
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
57331 views