Introduction:
1、Make My Trip Interview Experience

2、MakeMyTrip Interview Experience | Set 6 (Online Coding)
Make My Trip Interview Experience ♂
There were 3 interviewers for the Technical, Managerial, and HR rounds. The interview began with the technical round. Technical Round:First Question: My Introduction I introduced myself in the following order: Education, Experience, Projects, and Skills, emphasizing my MERN project that I did from s
MakeMyTrip Interview Experience | Set 6 (Online Coding) ♂
Round-1: Online test
There were 2 sections – Aptitude and Coding
Section A- 20 MCQ’s on General Aptitude.
Section B- There were 3 coding questions.
1) Given an array and 2 numbers l,r find the number of elements in the array in between l and r;
2) Calculate a power b (b -> [1,1000000000] (required a logn approach).
3) Let 1 represent ‘A’, 2 represents ‘B’, etc. Given a digit sequence, count the number of possible decodings of the given digit sequence.
eg. input – “121” output – 3.
Round-2 : Technical Round (1 hour 10 minutes).
The interviewer was very friendly and was trying to find out how much u can think.
1) Given a rotated array around a pivot element find a number x in the array.(write code in log n time).
2)Given 50 red and 50 blue balls, arrange them in 2 bags in such a way that the probability of taking out a red ball in 1st attempt is strictly > 1/2.
3) reverse a linked list.
4) The concept behind why a sewage lid on a road is round-shaped.Trying to find out how much u can think. (because the lid wont go inside in any way as a circle is uniform 360 degree.Rest any shape can go inside along the diagonal vertically).
5) find the depth of a tree.
6) A cake is on table.Another piece is cut from anywhere in the cake.Using a single cut divide the cake into 2 parts.(cut along the line joining the mid-points of the cake and the piece.)
7) write full working code for printing a matrix in spiral form.
8) Measure 4 litres water using 2 containers of capacity 5 and 3 litres respectively.(infinite supply of water).
Round-2 Technical Round (50 minutes).
A good 10-minutes discussion on my project.
Next I was made to write full code for every question.
1) Iterative preorder traversal.
2) Iterative inorder traversal.
3) Reverse a string wordwise. (Let the input string be “i like this program very much”. The function should change the string to “much very program this like i”).
4) Calculate a^b in logn and find the total number of multiplications.(check binary representation of b and count 1’s for the number of multiplications.)
Round-3: HR Round
Some general question on my background and the HR gave a presentation and she finally said SEE U IN MAKEMYTRIP.
I thank geeksforgeeks for my success.
All Practice Problems for MakeMyTrip !
Height of Binary Tree
Spirally traversing a matrix
Power of Numbers
Two water Jug problem
Reverse a linked list
Total Decoding Messages
Reverse words in a given string
Related questions
To locate the Hacker News "Who is Hiring" thread for February 2019, follow these steps:
Use Hacker News Search:
Visit hn.algolia.com (a dedicated search engine for HN) and enter the query:
"Who is hiring" AND "February 2019"
Filter results by date (February 2019) to find the thread. The title will be:
"Ask HN: Who is hiring? (February 2019)".Direct Link (if available):
While HN threads don’t have permanent URLs, you can try this archived link:
February 2019 "Who is Hiring" Thread (note: ID-based, may not work if removed).
Key Details About the Thread:
- Posted on: February 1, 2019 (first weekday of the month).
- Structure: Job posts include company name, location, remote options, and job descriptions.
- Trends in 2019: Common roles included software engineering (especially for AI/ML, cloud, and web development), remote work growth, and startups in blockchain or fintech.
Tips for Navigating the Thread:
- Use Ctrl+F (or browser search) to filter keywords like "remote," "Python," or "SF/NYC."
- Check replies for discussions about specific roles or companies.
If you’re looking for current job postings, visit the latest "Who is Hiring" thread (updated monthly). Let me know if you need further help!

评论已关闭