MakeMyTrip Interview Experience 2019

• Last Updated : 28 Sep, 2021

I applied to MakeMyTrip (MMT) through referrals from one of my friend who worked there. I had one and eight months experience prior to this interview.

Round 1: Machine Coding Round

Design a banking system which allows a user to 1. Create an account 2. Withdraw or deposit funds 3. Check account balance 4. Deactivate account. Expose REST APIs in relation to these functions. No need of using a database, perform all calculations in-memory. Time limit was 1.5 hours. In the interview / review related to this round I was asked about how will you handle concurrency issues while doing multiple transactions involving withdrawal / deposit or transferring of funds from one account to another (I was not able to answer this).

Round 2: Problem Solving – Data Structures / Algorithm Round

Question 1 : Suppose there are some speakers who will speak in an event, each of these speakers is represented by one of the characters from A-Z. The event spans N number of days and only one speaker speaks each day. You know the sequence in which the speakers are going to speak, that is, you know their schedule. You are planning to attend this event for M continuous days. What is the maximum number of distinct speakers that you can listen to in these M days.

Question 2 : Given two sorted arrays containing integers ( you can assume all of them are positive ) find the median in lowest time complexity. ( This is a well known problem, you can perhaps find it in here)

Question 3 : There are some events, each represented by a character or a number. An event may have some dependency events, which means an event can take place only if  their dependencies are completed. The dependency lists of these events are not carefully designed. There may be a circular dependency, like A is dependent on B, B is dependent on D and D is dependent on A. For a given event, list down all its dependencies and find out if there is a circular dependency.

Question 4 : Given a linked list having nodes each containing an integer value, you only have a reference to a node, say X. Delete node X from the list. ( This too is a well known problem)