Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
OYO interview experience Real time questions & tips from candidates to crack your interview

# SDE - Intern

OYO
3 rounds | 3 Coding problems

## Interview preparation journey

Preparation
Duration: 4 months
Topics: Data Structures, Algorithms, Oops, System Design, Data Base, Networks
Tip

Tip 1 : Prepare Data Structures
Tip 2 : Solve atleast 300-400 problems
Tip 3 : Prepare computer science subjects for solving MCQ's

Application process
Where: Campus
Eligibility: BTech(IT, EC), Dual (IT & EC) with no active backlog.
Resume tip

Tip 1 : Projects around oops would be great
Tip 2 : Be confident about everything you write

## Interview rounds

01
Round
Easy
Online Coding Interview
Duration1 hr 30mins
Interview date16 Dec 2020
Coding problem0

1st round was the coding round which consists of 25 MCQâ€™s and 2 Programming Questions. I don't remember the coding questions but one was from arrays and one from strings.

02
Round
Easy
Video Call
Duration90 minutes
Interview date21 Dec 2020
Coding problem2

### 1. Detect Cycle in a Directed Graph

Moderate
25m average time
65% success
0/80

#### Given a directed graph, check whether the graph contains a cycle or not. Your function should return true if the given graph contains at least one cycle, else return false.

Problem approach

I used DFS from every unvisited node. There is a cycle in a graph only if there is a back edge present in the graph.
To find the back edge to any of its ancestor keep a visited array and if there is a back edge to any visited node then there is a loop and return true.

### 2. Next Permutation

Moderate
15m average time
85% success
0/80

#### You have been given a permutation of â€˜Nâ€™ integers. A sequence of â€˜Nâ€™ integers is called a permutation if it contains all integers from 1 to â€˜Nâ€™...

View more
Problem approach

Traverse from right and find the first item that is not following the descending order.
Swap the found character with closest greater (or smallest greater) element on right side of it.
After swapping, sort the string after the position of character found.

03
Round
Easy
Video Call
Duration60 minutes
Interview date21 Dec 2020
Coding problem1

### 1. Validate BST

Moderate
25m average time
70% success
0/80

#### Given a binary tree with N number of nodes, check if that input tree is Partial BST (Binary Search Tree) or not. If yes, return true, return false otherwise.

View more
Problem approach

I gave him two three approaches.
Brute force
using utility class
using in-order traversal:

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

What is the output of print 0.1 + 0.2 == 0.3?

Start a Discussion
Similar interview experiences
SDE - Intern
3 rounds | 10 problems
Interviewed by OYO
835 views
SDE - Intern
3 rounds | 6 problems
Interviewed by OYO
2298 views
SDE - Intern
1 rounds | 2 problems
Interviewed by OYO
814 views
SDE - Intern
3 rounds | 4 problems
Interviewed by OYO
782 views
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
12907 views