Interview Experience | Dec 2021 (Exp. 0-2 Years)

New update is available. Click here to update.

SDE - 1

MakeMyTrip

3 rounds | 4 Coding problems

Anonymous

Experienced | Dec 2021 | SDE - Intern at OYE! Rickshaw

Selected

160 views

0 comments

1 upvotes

Interview preparation journey

Preparation

Duration: 2 months

Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Java J2EE

Tip

Tip 1 : Get strong hold of the basics of DS and algo
Tip 2 : Among the Computer Engineering subjects, you should be very handy with the concepts from DBMS
Tip 3 : Practice.

Application process

Where: Other

Eligibility:

Resume tip

Tip 1 : Keep the resume as concise as possible.
Tip 2 : Write only relevant projects you did and specify all the previous experiences in short sentences which will give the idea of what the project was.

Interview rounds

Round

Easy

Video Call

Duration60 minutes

Interview date17 Dec 2021

Problems1

Maximum Distance

You have been given an array 'A' of N integers. You need to find the maximum value of j - i subjected to the constraint of A[i] <= A[j], where ‘i’ and ‘j’ are the indices of the array.

Problem approach

Efficient approach
The idea behind this approach is to create a monotonously decreasing array and comparing its values with the given array to find the maximum distance.

Create an auxiliary array ‘RMax’ such that ‘RMax’ holds the greatest element on the right side of the given array.
Declare a variable ‘diff’ initialized to -1 to find the maximum distance.
Now traverse both the ...

Try solving now

Round

Easy

Video Call

Duration60 minutes

Interview date4 Jan 2022

Problems2

Theory questions

What is polymorphism?
What is function overriding?
Explain function overloading?
What is inheritance? Explain different kinds of inheritance
What do you know the concept of virtual functions?

Problem approach

Tip 1 : Prepare well for the OOPs concepts
Tip 2 : Also be aware of the position you're applying to. If Java developer, be aware of the concepts of JAVA.

Maximum Consecutive Ones

Given a binary array 'ARR' of size 'N', your task is to find the longest sequence of continuous 1’s that can be formed by replacing at-most 'K' zeroes by ...

Try solving now

Round

Easy

HR Round

Duration60 minutes

Interview date6 Jan 2022

Problems1

Basic HR Questions

Tell me about yourself
Explain your role in the project you worked on in your previous organisations
What are your strength and weakness?

Problem approach

Tip 1 : Don't put too much skills/projects if you are not confident about it, u need not have very rich resume during on campus placements
Tip 2 : Leadership principles can be very helpful for behavioural questions.