Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
MakeMyTrip interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

MakeMyTrip
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 1 Month
Topics: DSA, OOPS, Python, Tree, Java, Pointers, DP
Tip
Tip

Tip 1 : OOPs concepts are must.
Tip 2 : Choose any language and master it.
Tip 3 : Explain everything while coding in interview, and tell your approach.

Application process
Where: Referral
Eligibility: NA
Resume Tip
Resume tip

Tip 1 : At least 2 projects.
Tip 2 : Highlight your achievements.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 Minutes
Interview date17 Jan 2022
Coding problem2

2 problems from leetcode were asked,
1. Best Time to Buy and Sell Stock
2. Remove K Digits

1. Best Time to Buy and Sell Stock

Moderate
20m average time
80% success
0/80
Asked in companies
SprinklrIntuitOptum

You are given an array/list 'prices' where the elements of the array represent ...

View more
Problem approach

Remember one rule :- You can only buy one time & sell one time

So, if buy at 7 & sell at any time in the future, we'll face loss. Because buying price is way higher then selling price available we have

Now, I have seen a dip & I buy at 1 & sell at 5 my overall profit will be 5 - 1 = 4

But what if, I had buy at 1 & sell at 6 my profit will be 6 - 1 = 5. W...

View more
Try solving now

2. Remove K Digits

Moderate
25m average time
75% success
0/80
Asked in companies
FacebookMicrosoftMakeMyTrip

You are given a non-negative integer ‘num’ in the form of a string and provided with an integer ‘k’.


You need to find the smalles...

View more
Problem approach

1. Deleting k digits means keeping n - k digits, where n is the total number of digits.

2. Use a stack that you keep sorted ascendingly. You remove elements from it as long as you can still make it to n - k digits,
and your current element is smaller than the top of the stack:

push(2) => 2
push(4) because 2 < 4 => 24
push(6) because 4 < 6 => 246
pop() be...

View more
Try solving now
02
Round
Easy
Video Call
Duration60 Minutes
Interview date18 Jan 2022
Coding problem1

Online Coding round.

1. Sub Matrices With Sum Zero

Moderate
15m average time
85% success
0/80
Asked in companies
GoogleMakeMyTripAmazon

You’re given a square matrix 'MAT' of order N. Your task is to find the number of non-empty sub-matrices such that the sum of all the elements inside the submatrix is zero.

NOTE:

View more
Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

What is the return type of a method that doesn't return any value?

Start a Discussion
Similar interview experiences
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by MakeMyTrip
569 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by MakeMyTrip
325 views
0 comments
0 upvotes
company logo
SDE - 1
1 rounds | 2 problems
Interviewed by MakeMyTrip
278 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by MakeMyTrip
316 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
102216 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
48037 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
30112 views
6 comments
0 upvotes