SDE - 1
OYO
3 rounds | 9 Coding problems
636 views
Interview preparation journey
Preparation
Duration: 6 months
Topics: Data Structures, Algorithms, OOPS, OS, DBMS
Tip

Tip 1 : Focus on DSA as you will be judged mostly on that for entry-level software engineer profiles.
Tip 2 : Don't mug up the solution as you might not be able to recall the approach or you might face new question that you haven't seen earlier.
Tip 3 : Practice as much as possible from platforms like InterviewBit, LeetCode.

Application process
Where: Campus
Eligibility: 7 CGPA
Resume tip

Tip 1 : Try not to mention those things about which you are not comfortable.
Tip 2 : Having one or two good projects in resume helps.
Tip 3 : Mention good competitive programming ranks (if any)
Tip 4 : Use overleaf.com for making a resume using Latex.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date21 Aug 2019
Problems2
Rotate Matrix right by K times

view more
Word Search

#### You are given a two-dimensional grid having 'N' rows and 'M' columns, consisting of upper case characters. You are also given a word 'WORD'. You have to find the numbe...

view more
Problem approach

1. Coded using recursion and backtracking but the time complexity was of exponential order so time limit exceeded.
2. Tried to code it using DFS but couldn't code it in the given time.

02
Round
Medium
Face to Face
Duration75 minutes
Interview date23 Oct 2020
Problems4

Interview started with an introduction and walk through the resume for first 5 minutes. After that, interview asked few coding questions.

Largest Island

#### The grid can only have values 0 and 1.<...

view more
Problem approach

1. I was little stuck in stuck in start but later on came up with DFS approach.
2. Interviewer was satisfied the approach and asked me to code it.

Given a 2D matrix having 0s and 1s, each row is sorted. Find the row having the maximum number of consecutive ones in the matrix.
Problem approach

1. Told the brute force which is to traverse the whole matrix.
2. Optimized it using binary search on each row. But interviewer want more optimized approach than this.
3. After thinking for few minutes, came up with the approach of starting from top right and take decision whether to go left or down depending on the element in left. Interviewer asked me to further optimize.
4. Optimize...

view more
Pythagorean Triplet

#### An array is sai...

view more
Top View of Binary Tree

#### The Top view of the binary tree is the set of nodes visible when we see the tree from the top.

view more
03
Round
Medium
Face to Face
Duration90 minutes
Interview date23 Aug 2019
Problems3

This round was focused on DSA along with short discussion on computer science fundamentals. For coding problems, I was asked to code the first problem only. For others, had to discuss the approach only. For computer science fundamentals, discussion on OOPS. Differences between process and threads were discussed.

Fix BST

#### You have been given a Binary Search Tree of 'N' nodes, where exactly two nodes of the same tree were swapped by mistake.

view more
Problem approach

After getting some of the hints, was able to come up with in-order traversal approach which takes extra space. Interviewer wanted better approach without extra space. But couldn't think of it.

#### Create a class named 'Stack' which supports the following operations(all in O(1) time):

view more
Given N documents and a set of keywords was given, you have to retrieve document having highest frequency of those keywords first and then others.
Problem approach

1. Told the approach using hashmap.
2. Optimized it further by using tries.

Join the Discussion
28 May 2022
0 replies
Similar interview experiences
SDE - Intern
3 rounds | 10 problems
Interviewed by OYO
426 views
SDE - 1
3 rounds | 5 problems
Interviewed by OYO
362 views
SDE - 1
3 rounds | 5 problems
Interviewed by OYO
0 views
SDE - 2
4 rounds | 4 problems
Interviewed by OYO
421 views
Companies with similar interview experiencs
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
83877 views