New update is available. Click here to update.

SDE - 1

MakeMyTrip

2 rounds | 3 Coding
problems

37 views

0 comments

0 upvotes

Interview preparation journey

Preparation

Duration: 2

Topics: Data Structures and Algorithms, Object-Oriented Programming System, Operating system, Database Management System

Tip

Try to do Data Structures and Algorithms based questions and firstly attempt it yourself before going to the solution, also try to do it as quickly as you can. Also prepare for theory subjects like Operating system, Database Management System, etc which I prepared through Coding Ninjas subjective notes and they are very accurate and up to mark.

Application process

Where: Campus

Eligibility: Above 6 CGPA

Resume tip

Keep your resume simple and complete. Mention some good-level projects, your previous experiences, and coding achievements if any.

Interview rounds

01

Round

Easy

Video Call

Duration45 minutes

Interview date27 Aug 2022

Problems2

Balanced Parentheses

view more

Problem approach

Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.

Note :

Conditions for valid parentheses:

1. All open brackets must be closed by the closing brackets.

2. Open brackets must be closed in the correct order.

Find K Closest Elements

view more

Problem approach

You are given a sorted array 'A' of length 'N', two integers 'K' and 'X'. Your task is to print 'K' integers closest to 'X', if two integers are at the same distance return the smaller one.

The output should also be in sorted order

Note:

An integer 'a' is closer to 'X' than an integer 'b' if:

|a - X| < |b - X| or ( |a - X| == |b - X| and a < b )

02

Round

Easy

Video Call

Duration45 minutes

Interview date27 Aug 2022

Problems1

Find The Sum Of The Left Leaves

view more

Problem approach

Given a binary tree with ‘root’. Your task is to find the sum of all the left leaf nodes.

Properties of leaf:-

In a binary tree, a leaf is a node such that it does not have any children. Node ‘1’ is always the root of the binary tree. Left leaves are those nodes that are the left child of their parent and a leaf node

Start a Discussion

Similar interview experiences

SDE - 1

3 rounds | 9 problems

Interviewed by MakeMyTrip

320 views

0 comments

0 upvotes

SDE - 1

4 rounds | 7 problems

Interviewed by MakeMyTrip

112 views

0 comments

0 upvotes

SDE - 1

2 rounds | 5 problems

Interviewed by MakeMyTrip

15 views

0 comments

0 upvotes

SDE - 1

2 rounds | 4 problems

Interviewed by MakeMyTrip

5 views

0 comments

0 upvotes

Companies with similar interview experiencs

SDE - 1

5 rounds | 12 problems

Interviewed by Amazon

56812 views

15 comments

0 upvotes

SDE - 1

4 rounds | 5 problems

Interviewed by Microsoft

25616 views

3 comments

0 upvotes

SDE - 1

3 rounds | 7 problems

Interviewed by Amazon

17973 views

4 comments

0 upvotes

Popular Interview Experiences: