MakeMyTrip Interview Questions with Answers
Last updated 2026-11-19
MakeMyTrip runs a travel marketplace: flight and hotel search, inventory that changes by the minute, and payments that must never be charged twice. That shapes the questions candidates report: data structures and algorithms first, then database and concurrency reasoning that maps onto bookings.
This page gives twelve practice questions with worked answers, mixing technical and HR. They are written in the style of the topics the rounds are commonly reported to cover, not as a record of any particular paper. For the algorithm side, see MakeMyTrip coding round questions; for the process itself, read how to crack the MakeMyTrip interview.
| Rounds (commonly reported) | Online assessment, technical interviews, hiring manager or HR |
|---|---|
| Topics | DSA, CS fundamentals, SQL, concurrency, system design for bookings |
| Roles reported | SDE-1, software engineer intern |
The rounds as commonly reported
Candidate write-ups, mostly from earlier years, describe an online assessment that mixes a couple of coding problems with MCQs, followed by technical interviews and a final hiring manager or HR conversation. Nothing here is published by the company, and the number of rounds changes by year, team and level.
- Online assessment: coding problems plus MCQs on CS fundamentals.
- Technical interviews: DSA on a shared editor, then CS fundamentals such as OS, DBMS and OOP, often tied back to something you built.
- Hiring manager or HR: motivation, teamwork, relocation and expectations.
What the travel domain adds
Expect your answers to be pushed toward correctness under concurrency. A hotel has finite rooms, a flight finite seats, and fares expire. If you can explain locking, idempotent payments and cache invalidation in those terms, you stand out from candidates who only recite definitions.
Hiring status
Our company facts file has no sourced hiring announcement or drive dates for MakeMyTrip, so none are stated here. The only documented material is the candidate-reported process above, drawn from the sources listed at the bottom of this page, and it is not company-published. MakeMyTrip has no page in our hiring section either, so check the company's own careers site at careers.makemytrip.com for open roles and eligibility.
MakeMyTrip Interview Questions with Answers: questions with worked answers
1 Tell me about yourself and why MakeMyTrip.
easyKeep it to about ninety seconds: current degree or role, one project with a number attached, then why this company. A good "why" is specific: you use travel booking apps, you are curious how a search returns live fares from many suppliers in under a second, and you want to work on systems where a wrong answer costs a customer money. Avoid generic lines about "big brand". Close with what you want to learn, for example scaling search or building reliable payment flows.
2 How does a HashMap work in Java, and what happens on a collision?
easyA HashMap hashes the key, spreads the bits and indexes into an array of buckets. Entries in one bucket form a linked list; when a bucket reaches 8 entries and the table has at least 64 slots, it is converted to a red-black tree so worst-case lookup is O(log n) instead of O(n). The table doubles when size exceeds capacity times the load factor (0.75 by default), which rehashes entries. Keys need consistent equals and hashCode, and mutable keys break lookups. HashMap is not thread-safe; use ConcurrentHashMap for shared access.
3 Two users book the last room of a hotel at the same moment. How do you prevent a double booking?
mediumMake the check and the decrement one atomic step. The simplest correct approach is a conditional update and a check of the affected row count: if it returns 0, someone else took the room. Alternatives are a row lock with SELECT ... FOR UPDATE inside a transaction, or optimistic locking with a version column and a retry. Do not read the count in the application and then write it back, because two requests can both read 1. For high contention, hold the room for a short time (a reservation with expiry) and confirm after payment.
sqlUPDATE room_inventory SET available = available - 1 WHERE room_id = 42 AND stay_date = DATE '2027-01-10' AND available > 0; -- application checks rows_affected = 1; otherwise report sold out4 A payment call times out and the user clicks Pay again. How do you avoid charging twice?
mediumUse an idempotency key generated per payment attempt (for example from the booking id and an attempt counter) and send it to the gateway and store it in your database under a unique constraint. A retry with the same key returns the stored result instead of creating a second charge. Model the booking as a state machine (created, payment pending, paid, confirmed, failed) so a late callback only moves it forward, never backward. For unknown outcomes, query the gateway for the status before retrying, and reconcile pending payments with a background job.
5 Write a query for the top three destinations by bookings in each month.
mediumAggregate bookings per month and destination, then rank within each month using a window function. RANK keeps ties; use ROW_NUMBER if you need exactly three rows. Filtering on the rank requires a subquery or CTE because window functions cannot appear in WHERE. See SQL window function questions for more patterns.
sqlWITH monthly AS ( SELECT DATE_TRUNC('month', booked_at) AS month, destination, COUNT(*) AS bookings FROM bookings GROUP BY 1, 2 ), ranked AS ( SELECT month, destination, bookings, RANK() OVER (PARTITION BY month ORDER BY bookings DESC) AS rnk FROM monthly ) SELECT month, destination, bookings FROM ranked WHERE rnk <= 3 ORDER BY month, rnk;6 Explain transaction isolation levels and pick one for a booking service.
mediumRead uncommitted allows dirty reads; read committed prevents them but allows non-repeatable reads; repeatable read fixes that (phantoms depend on the database); serializable behaves as if transactions ran one at a time. For a booking service, read committed plus explicit row-level locking or conditional updates on the inventory row is usually enough and keeps throughput high. Serializable is safer but aborts more transactions under contention, so you would need retry logic. State the anomaly you are guarding against, not just the level name.
7 How would you build city and airport autocomplete for the search box?
mediumStore names in a trie, or in a sorted array with binary search for the prefix range, and keep the top few suggestions by popularity at each node so a lookup is O(length of prefix) plus a constant. Normalise input (lowercase, strip accents), match airport codes and aliases ("Bombay" to Mumbai), and add a fuzzy fallback for typos using edit distance on a small candidate set. Serve it from memory behind a CDN-friendly endpoint, debounce keystrokes on the client, and refresh popularity from search logs offline rather than on every request.
8 Flight search results go stale quickly. How would you cache them?
hardCache by a key of route, date, passengers and cabin with a short TTL, typically seconds to a few minutes, because fares change and a stale price leads to a failed booking at checkout. Protect suppliers with request coalescing, so concurrent identical searches share one upstream call, and add jitter to TTLs to avoid a stampede. Always re-price (revalidate) the chosen itinerary at checkout instead of trusting the cached fare. Cache negative results briefly, and track hit rate and price-mismatch rate to tune the TTL.
9 Design a token-bucket rate limiter for a public search API.
hardEach client key has a bucket with a capacity and a refill rate. A request consumes one token; if none remain it is rejected with HTTP 429. Refill lazily: on each call, add tokens for the elapsed time rather than running a timer. In a single process a lock around the bucket is enough; across servers keep the counters in Redis and make the read-modify-write atomic with a Lua script. Token bucket allows short bursts up to the capacity while holding the long-run average rate.
pythonimport time, threading class TokenBucket: def __init__(self, capacity, refill_per_sec): self.capacity = capacity self.rate = refill_per_sec self.tokens = capacity self.last = time.monotonic() self.lock = threading.Lock() def allow(self): with self.lock: now = time.monotonic() self.tokens = min(self.capacity, self.tokens + (now - self.last) * self.rate) self.last = now if self.tokens >= 1: self.tokens -= 1 return True return False10 What are the four conditions for a deadlock, and how do you avoid one in a booking flow?
easyDeadlock needs mutual exclusion, hold and wait, no preemption and circular wait. Break any one. In practice, acquire locks in a fixed global order (for example always lock the lower room id first when a booking spans several rooms), keep transactions short, set lock timeouts and retry on failure. Databases detect cycles and abort one victim, so your code must handle that error by retrying the transaction.
11 Tell me about a time you disagreed with a teammate on a technical decision.
mediumUse the STAR shape but keep it short. Situation: two of you wanted different approaches, say polling versus a message queue. Task: ship a feature by a deadline. Action: you wrote down the trade-offs, ran a small benchmark, and agreed to decide on measured numbers. Result: you adopted one approach, and the teammate's concern became a monitoring task. The interviewer wants to hear that you argue with evidence, accept outcomes gracefully and keep the relationship intact.
12 How do you handle a project where the requirements keep changing?
mediumAnchor on the goal, not the spec: confirm the user problem, split the work into small releasable pieces, and put the parts most likely to change behind clear interfaces. Write down each change with its cost so stakeholders see the trade-off, and agree what leaves the scope when something enters. Give a concrete example from a college project or internship, including what you would do differently, because interviewers trust specifics over slogans.
Frequently asked questions
What topics should I prepare for a MakeMyTrip SDE interview?
Candidate reports mention arrays, strings, hashing, graphs, intervals and dynamic programming, plus OS, DBMS, OOP and basic system design. Prepare booking-flavoured design questions: inventory locking, idempotent payments and caching of search results.
Is there a MakeMyTrip online assessment?
Candidate-reported processes include an online assessment with coding problems and MCQs before the interviews, but the company has not published its format. Treat the structure as variable and confirm with the recruiter.
How many interview rounds does MakeMyTrip have?
Reports describe technical interviews followed by a hiring manager or HR round. The count varies by role and year, so ask your recruiter rather than relying on old write-ups.
Do I need system design for a fresher role?
Not a full distributed-systems design, but expect small design questions such as preventing double booking or designing an autocomplete. Clear reasoning about concurrency matters more than diagrams.
Where do I find current openings?
Use the company's own careers site. We do not hold sourced hiring dates for MakeMyTrip, so any date you see elsewhere should be verified there.
Sources
Related guides
More in Company Interview Questions
- Mastercard coding round questions with solutions
- Mastercard interview questions with answers (software engineer)
- Media.net Coding Round Questions With Solutions
- Media.net Interview Questions and Answers
- Meesho Coding Round Questions with Solutions
- Meesho Interview Questions and Answers
- Meta Coding Round Questions with Solutions in Python and Java
- Meta Interview Questions and Answers for SDE Roles
- Micron Coding Round Questions with Solutions
- Micron Interview Questions and Answers for India Software and Firmware Roles
- Microsoft Coding Round Questions with Solutions in Python and Java
- Microsoft Interview Questions and Answers for SDE Roles