Summary
I had an interview for an SSE role at Make my trip. The process included a DSA round where I solved a problem similar to Combination Sum using backtracking, and a System Design round focused on designing a Hotel Reservation Backend and managing its inventory. Ultimately, I was rejected.
Full Experience
Experience: 5+ years in Product based company.
Round-1 DSA
question is similar to this,
https://leetcode.com/problems/combination-sum/description/
Solved it with backtracking interviewer was okay with that.
Round-2 HLD
Design Hotel Reservation Bakend
I wasn't prepared for that question fully.
I have explained how i will store hotels and room data. I suggested to store data in elastic search because of faster search operations with different kinds of filters.
then interviwer asked me how will you manage inventory of rooms on each date. Here I suggested to use elastic search again with keys are like Date + location.
I think this is a mistake. because handling cunsurrency while booking will be complicated here. also i didn't mentioned different room types.
Interviwer is fully focused on managing inventory
this is discused in the book System design Interview an insiders guide volune-2 by alex xu. please read it.
Verdict - Rejected
Interview Questions (2)
Question similar to LeetCode's Combination Sum problem.
Design a Hotel Reservation Backend. The interviewer was fully focused on managing inventory of rooms on each date.
Summary
I had a DSA round at Make My Trip where I was presented with two specific LeetCode problems.
Full Experience
Summary
I recently interviewed for an SDE-2 position at Make My Trip. The first round was purely focused on Data Structures and Algorithms, where I was given two LeetCode problems. Unfortunately, I was unable to qualify for the next round.
Full Experience
I had an interview for an SDE-2 role at Make My Trip. The first round was entirely dedicated to Data Structures and Algorithms. I was presented with two LeetCode questions to solve. Despite my efforts, I wasn't able to clear this round and proceed further in the interview process.
Interview Questions (2)
Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Return the indices of the two numbers, index1 and index2, added by one as an integer array [index1, index2] of length 2. The tests are generated such that there is exactly one solution. You may not use the same element twice. Your solution must use only constant extra space.