'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
OYO interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
OYO
upvote
share-icon
3 rounds | 6 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 6 months
Topics: Data Structures, Algorithms, Dynamic Programming, Machine Learning, OOPS
Tip
Tip

Tip 1 : Primary skill to be developed is problem solving, i.e proficient in data structures and algorithms.
Tip 2 : After this, practice competitive programming, start giving contests, this will make you faster.
Tip 3 : Then take any technology, e.g., machine learning, web development etc., make few but good projects using these technologies.

Application process
Where: Campus
Eligibility: Above 6.45 CGPA
Resume Tip
Resume tip

Tip 1 : Make it short, 1-2 pages max. Only mention those projects that you know the best.
Tip 2 : While mentioning projects, do mention numbers in them, like what was the accuracy(in case of ML projects).

Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date11 Nov 2020
Coding problem2

The test was scheduled at 2:30 PM, IST. The test was conducted online, due to the ongoing pandemic situation. Webcam was required to be switched on during the complete duration of the test. I had solved 2/2 coding questions with all test cases successfully passing. Out of the 10 MCQ questions, I had done 6. Around 90 students sat for the online coding round, 19 were shortlisted for the interview. Those who had solved both coding questions were called for interview.

1. Candies
Moderate
10m average time
90% success
0/80
Asked in companies
CognizantTata Consultancy Services (TCS)Apple
View more
Problem approach

Step 1: Since we had to see adjacent students' marks, and then decide the candy to be given, dynamic programming struck my mind.
Step 2: We need to look in both sides, left as well as right. So I constructed an array, say left, in the first traversal.

 

Try solving now
2. Min cost to reach N
Easy
10m average time
90% success
0/40
Asked in companies
SquadstackFlipkartOYO

Ninja Yuki is in the mood of shopping ninja blades t...

View more
Problem approach

This was a simple DP based problem. Construct a DP array of size n+1. And fill the array as follows:
For i between 2 to n:
1). If i is even: then we can reach that i by two ways, one is by adding 1 to i-1, another by doubling i/2, and add their respective costs.
Therefore, dp[i] = min(dp[i-] + A, dp[i/2] + B);
2). If i is odd. This is a bit tricky, one option is adding one to i-1. S...

View more
Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date18 Nov 2020
Coding problem2

This was a pure DSA based round. Two questions were asked in this round. The interviewer was quite good, and helped in between.

1. First Unique Character in a String
Moderate
15m average time
80% success
0/80
Asked in companies
OYOAmdocs

You are given a string A consisting of lower case English letters. You have to find the first non-repeating character from each stream of characters.

For E...

View more
Problem approach

I had solved this question earlier, thanks to Coding Ninja's Codezen. I was able to give the optimised solution. I used the concept of deque. The question was based on the concept of sliding window.

Try solving now
2. Boolean Matrix
Moderate
35m average time
60% success
0/80
Asked in companies
AmazonUberOYO

Given a 2-dimensional boolean matrix mat of size N x M, modify the matrix such that if an element is 1, set its entire row and column to 1 i.e. if mat[i][j] = 1, then make...

View more
Problem approach

I started with the naive approach. I suggested storing the location of all 1s in an array. Then traverse over this array and make required changes in the matrix.
The interviewer asked me to optimise it further. I suggested, when we encounter a one, start making changes in the matrix as: if m[i][j] is 0 then change it to 1, else change the value to -1, so that we know a 1 was present here and...

View more
Try solving now
03
Round
Medium
Video Call
Duration75 minutes
Interview date18 Nov 2020
Coding problem2

This round was also again focused on DSA. Two interviewers were present. This round was very extensive and everything was asked in depth as well as they asked to write the codes as well for all the questions. I was also asked to explain my projects, they were based on ML. Many aspects of OOPs, POP, memory allocation was asked as well.

1. Maximum sum of (i*Arr[i]) among all possible rotations of an array.
Moderate
15m average time
85% success
0/80
Asked in companies
SalesforceMakeMyTripApple

You are given an array 'ARR' consisting of 'N' elements, and you need to find the maximum va...

View more
Problem approach

first found the value of f(0). Now what we need to do is assign last element the index 0, then in next iteration, the 2nd last element as index 0 and last as index 1.
So i ran a loop from 1 to n, and i in each iteration, the last i elements were assigned indices starting from 0. After that, continuing from the last index that was assigned to the last element, we start picking elements from t...

View more
Try solving now
2. Averages of Levels in Binary Tree
Easy
15m average time
85% success
0/40
Asked in companies
OYOInfosys

You are given an arbitrary binary tree consisting of 'N' nodes numbered from 1 ...

View more
Problem approach

This was a simple BFS traversal problem. I was also asked to write the code for the same. I was able to code it successfully.

Try solving now
Start a Discussion
Similar interview experiences
company logo
SDE - Intern
3 rounds | 10 problems
Interviewed by OYO
558 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 3 problems
Interviewed by OYO
1144 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 4 problems
Interviewed by OYO
559 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 5 problems
Interviewed by OYO
300 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
10893 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
9464 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
7350 views
2 comments
0 upvotes