Interview Experience by Anshul Kansal | Aug 2019 (Exp. 0-2 Years)

New update is available. Click here to update.

SDE - 1

OYO

3 rounds | 9 Coding problems

Anshul Kansal

Experienced | Aug 2019

Selected

636 views

1 comments

1 upvotes

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

Round

Medium

Online Coding Interview

Duration90 minutes

Interview date21 Aug 2019

Problems2

Rotate Matrix right by K times

You have been given a matrix ‘MAT’ of size 'N' * 'M' (where 'N' and 'M' denote the number of rows and columns respectively) and a positive integer ‘K’. Your task is to r...

Try solving now

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

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.

Try solving now

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

You are given two integers 'n' and 'm', the dimensions of a grid. The coordinates are from (0, 0) to (n - 1, m - 1).

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

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.

Try solving now

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

Pythagorean Triplet

You are given an array of n integers (a1, a2,....,an), you need to find if the array contains a pythagorean triplet or not.

An array is sai...

Try solving now

Top View of Binary Tree

You are given a Binary Tree of 'n' nodes.

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

Try solving now

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.

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.

Try solving now

Implement Stack with Linked List