Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by MakeMyTrip Team. If you also belong to the team, you can get access from here

MakeMyTrip Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

MakeMyTrip Full Stack Developer Interview Questions, Process, and Tips

Updated 21 Mar 2022

Top MakeMyTrip Full Stack Developer Interview Questions and Answers

  • Q1. Tower of Hanoi Problem Statement You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest d ...read more
  • Q2. Minimum Operations Problem Statement You are given an array 'ARR' of size 'N' consisting of positive integers. Your task is to determine the minimum number of operations ...read more
  • Q3. Maximum Distance Problem Statement Given an integer array 'A' of size N, your task is to find the maximum value of j - i, with the restriction that A[i] Input: The input ...read more
View all 18 questions

MakeMyTrip Full Stack Developer Interview Experiences

3 interviews found

I appeared for an interview in Sep 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

The test was in the morning at around 11.
It was on online assessment.
HackerEarth was perfect like everytime.\
MCQ were based on HTML ,CSS , JS, OOPS, SQL, Aptitude, OS.

  • Q1. 

    Reach the Destination Problem Statement

    You are given a source point (sx, sy) and a destination point (dx, dy). Determine if it is possible to reach the destination point using only the following valid mo...

  • Ans. 

    The problem involves determining if it is possible to reach a destination point from a source point using specified moves.

    • Iterate through each test case and check if destination is reachable from source using specified moves

    • Implement a recursive function to explore all possible paths from source to destination

    • Keep track of visited points to avoid infinite loops

    • Return true if destination is reachable, false otherwise

  • Answered by AI
  • Q2. 

    Delete Node in Binary Search Tree Problem Statement

    You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.

    A BST is a ...

  • Ans. 

    Implement a function to delete a node from a Binary Search Tree and return the inorder traversal of the modified BST.

    • Understand the properties of a Binary Search Tree (BST) - left subtree contains nodes with data less than the node, right subtree contains nodes with data greater than the node.

    • Implement a function to delete the given node from the BST while maintaining the BST properties.

    • Perform inorder traversal of the...

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

The interviewer was very friendly. He gave me problems one by one and asked me to write code for all of them in Code Pair round. Explain Scope and Scope Chain in javascript. What is a Stored Procedure in SQL?

  • Q1. 

    Shortest Path in a Binary Matrix Problem Statement

    Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...

  • Ans. 

    Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.

    • Use Breadth First Search (BFS) algorithm to find the shortest path.

    • Keep track of visited cells to avoid revisiting them.

    • Calculate the path length by counting the number of 1s in the path.

    • Handle edge cases such as invalid inputs and unreachable destination.

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Given an array of integers and a target sum, find all pairs of elements that add up to the target sum.

    • Use a hashmap to store the difference between the target sum and each element as keys and their indices as values.

    • Iterate through the array and check if the current element's complement exists in the hashmap.

    • Return the pairs of elements that add up to the target sum in sorted order.

  • Answered by AI
  • Q3. 

    Validate Binary Search Tree (BST)

    You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).

    BST Definition:

    A Binary Search Tr...

  • Ans. 

    Validate if a given binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Ensure that both the left and right subtrees are also binary search trees.

    • Traverse the tree in an inorder manner and check if the elements are in sorted order.

    • Recurs...

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

The round was with CTO level person. He was very friendly. What is the difference between SQL and MySQL? What are Constraints in SQL?

  • Q1. 

    Longest Duplicate Substring Problem Statement

    You are provided with a string 'S'. The task is to determine the length of the longest duplicate substring within this string. Note that duplicate substrings ...

  • Ans. 

    Find the length of the longest duplicate substring in a given string.

    • Iterate through all possible substrings of the input string.

    • Use a rolling hash function to efficiently compare substrings.

    • Store the lengths of duplicate substrings and return the maximum length.

  • Answered by AI
  • Q2. 

    Maximum Sum of Products for Array Rotations

    You are given an array ARR consisting of N elements. Your task is to determine the maximum value of the summation of i * ARR[i] among all possible rotations of ...

  • Ans. 

    Find the maximum sum of products for array rotations.

    • Iterate through all possible rotations of the array and calculate the sum of products for each rotation.

    • Keep track of the maximum sum of products found so far.

    • Return the maximum sum of products obtained.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Fullstack Developer in BangaloreEligibility criteria7 CGPAMakeMyTrip interview preparation:Topics to prepare for the interview - Data Structures, OOPS, OS, DBMS, Computer NetworkingTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : DSA should be very very good.
Tip 2 : Computer Science Fundamentals are very important
Tip 3 : Think out loud in an interview

Application resume tips for other job seekers

Tip 1 : At least 2 very well prepared projects
Tip 2 : Internship experiences always help

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Sep 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

2 Coding Questions and 20 MCQ's to be solved in 90 minutes. It was from 6 pm. The camera and screen-recorders were on. The mcq was on web, oops, dbms.

  • Q1. 

    Number of Islands II Problem Statement

    You have a 2D grid of dimensions 'N' rows by 'M' columns, initially filled with water. You are given 'Q' queries, where each query contains two integers 'X' and 'Y'....

  • Ans. 

    The task is to determine the number of islands present on a 2D grid after each query of converting water to land.

    • Create a function that takes the grid dimensions, number of queries, and query coordinates as input.

    • For each query, convert the water at the given coordinates to land and then count the number of islands on the grid.

    • Use depth-first search (DFS) or breadth-first search (BFS) to identify connected land cells f...

  • Answered by AI
  • Q2. 

    Make Array Elements Equal Problem Statement

    Given an integer array, your objective is to change all elements to the same value, minimizing the cost. The cost of changing an element from x to y is defined ...

  • Ans. 

    Find the minimum cost to make all elements of an array equal by changing them to the same value.

    • Calculate the median of the array and find the sum of absolute differences between each element and the median.

    • Sort the array and find the median element, then calculate the sum of absolute differences between each element and the median.

    • If the array has an even number of elements, consider the average of the two middle elem

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 70 minutes
Round difficulty - Medium

The interview started with the interviewer asking me about my projects and why and what I have used in them. Be very clear with all the technologies you have used in your project as the interviewer will ask you in-depth about it.
Explain Components, Modules and Services in Angular. What is a Recursive Stored Procedure?

  • Q1. 

    Sub Sort Problem Statement

    You are given an integer array ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a...

  • Ans. 

    Determine the length of the shortest contiguous subarray that needs to be sorted to make the entire array sorted in ascending order.

    • Iterate from left to right to find the first element out of order.

    • Iterate from right to left to find the last element out of order.

    • Calculate the length of the subarray between the two out of order elements.

  • Answered by AI
  • Q2. 

    Minimum Operations Problem Statement

    You are given an array 'ARR' of size 'N' consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in t...

  • Ans. 

    Minimum number of operations to make all elements in an array equal by performing addition, subtraction, multiplication, or division.

    • Iterate through the array to find the maximum and minimum elements.

    • Calculate the difference between the maximum and minimum elements.

    • The minimum number of operations needed is the difference between the maximum and minimum elements.

  • Answered by AI
  • Q3. 

    Tower of Hanoi Problem Statement

    You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest disk at the bottom). Your task is to...

  • Ans. 

    Tower of Hanoi problem involves moving 'N' disks from one rod to another following specific rules in less than 2^N moves.

    • Implement a recursive function to move disks from one rod to another while following the rules.

    • Use the concept of recursion and backtracking to solve the Tower of Hanoi problem efficiently.

    • Maintain a count of moves and track the movement of disks in a 2-D array/list.

    • Ensure that larger disks are not p...

  • Answered by AI
  • Q4. Can you explain the concepts of multithreading and semaphore in operating systems?
  • Ans. 

    Multithreading allows multiple threads to run concurrently, while semaphores are used to control access to shared resources in a synchronized manner.

    • Multithreading involves running multiple threads within a single process, allowing for parallel execution of tasks.

    • Semaphores are used to control access to shared resources by allowing only a certain number of threads to access the resource at a time.

    • Semaphores can be bina...

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

The interviewer was VP of Engineering at MakeMyTrip with more than 10 years of experience. He asked about the 4 Pillars of OOPS and we had an in-depth discussion with real-life applications for each of them.

  • Q1. 

    Square Root with Decimal Precision Problem Statement

    You are provided with two integers, 'N' and 'D'. Your objective is to determine the square root of the number 'N' with a precision up to 'D' decimal pl...

  • Ans. 

    Implement a function to find the square root of a number with a given precision.

    • Create a function that takes 'N' and 'D' as input parameters

    • Use a mathematical algorithm like Newton's method to approximate the square root

    • Iterate until the precision condition is met

    • Return the square root with the required precision

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Vellore Institute of Technology. Eligibility criteria8.5 CGPAMakeMyTrip interview preparation:Topics to prepare for the interview - DSA, OOPS, OS, DBMS, Computer Networks, Dynamic Programming, GraphsTime required to prepare for the interview - 12 monthsInterview preparation tips for other job seekers

Tip 1 : Never lose hope. Just keep working.
Tip 2 : Solve at least 5 problems each day of medium level or 3 questions of hard level with complete understanding.
Tip 3 : Keep at least 3-4 projects in your resume.

Application resume tips for other job seekers

Tip 1 : Keep it 1 page.
Tip 2 : Revise it very well before the interview.
Tip 3 : Know your projects in-depth. They might also ask you to show a demo as it is a virtual interview. So, keep them ready before the interview.

Final outcome of the interviewSelected

Skills evaluated in this interview

Full Stack Developer Interview Questions Asked at Other Companies

asked in DBS Bank
Q1. Query and Matrix Problem Statement You are given a binary matrix ... read more
asked in Accenture
Q2. Find Duplicates in an Array Given an array ARR of size 'N', where ... read more
asked in MakeMyTrip
Q3. Tower of Hanoi Problem Statement You have three rods numbered fro ... read more
Q4. Maximum Difference Problem Statement Given an array ARR of N elem ... read more
asked in Samsung
Q5. LCA of Binary Tree Problem Statement You are given a binary tree ... read more

I appeared for an interview in Aug 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

There were two sections mcq's and coding. We were allowed to switch between sections and there was no specific time for any section. Around 350 students gave the test.

  • Q1. 

    Count Inversions Problem Statement

    Given an integer array ARR of size N, your task is to find the total number of inversions that exist in the array.

    An inversion is defined for a pair of integers in the...

  • Ans. 

    Count the total number of inversions in an integer array.

    • Iterate through the array and for each pair of elements, check if the inversion condition is met.

    • Use a nested loop to compare each pair of elements efficiently.

    • Keep a count of the inversions found and return the total count at the end.

  • Answered by AI
  • Q2. 

    Maximum Consecutive Ones Problem Statement

    Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...

  • Ans. 

    Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.

    • Iterate through the array and keep track of the current window of 1's and zeroes.

    • Use a sliding window approach to find the maximum length of the sequence.

    • Update the window by flipping zeroes to ones within the limit of K flips.

    • Return the maximum length of the sequence obtained.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

About 45 students were shortlisted for this round. My interview was at 10:15am. I was asked to introduce myself. 

  • Q1. 

    Maximum Distance Problem Statement

    Given an integer array 'A' of size N, your task is to find the maximum value of j - i, with the restriction that A[i] <= A[j], where 'i' and 'j' are indices of the ar...

  • Ans. 

    Find the maximum distance between two elements in an array where the element at the first index is less than or equal to the element at the second index.

    • Iterate through the array and keep track of the minimum element encountered so far along with its index.

    • Calculate the maximum distance by subtracting the current index from the index of the minimum element.

    • Update the maximum distance if a greater distance is found whil...

  • Answered by AI
  • Q2. 

    Determine the Left View of a Binary Tree

    You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...

  • Ans. 

    The task is to determine the left view of a binary tree, which consists of nodes visible when viewed from the left side.

    • Traverse the binary tree level by level from left to right, keeping track of the first node encountered at each level.

    • Use a queue to perform level order traversal and keep track of the level number for each node.

    • Store the first node encountered at each level in a result array to get the left view of t

  • Answered by AI
Round 3 - Video Call 

Round duration - 40 Minutes
Round difficulty - Easy

About 17 students cleared the first round. My second round was at 4:30pm. The interviewer was very humble. 

Round 4 - Telephonic Call 

Round duration - 20 Minutes
Round difficulty - Easy

This was HR round, 7 students were shortlisted for this round. I received the call after 6:30pm. 

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Fullstack Developer in GurgaonEligibility criteriaAbove 8.5 CGPA, No active or any previous semester backlog, Allowed branches - CS and ENCMakeMyTrip interview preparation:Topics to prepare for the interview - OOPS, Data Structures, DBMS, OS, CN, Machine Learning(Based on resume)Time required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : For on campus placements, focus more on core subjects rather than very good projects/internships.
Tip 2 : You must cover all important Data Structures and their important/fundamental questions at least twice. For advanced Data Structures like DP, graph, trees, you should have good practice before hand.
Tip 3 : Solve aptitude questions occasionally.

Application resume tips for other job seekers

Tip 1 : Don't put too much skills/projects if you are not confident about it, u need not have very rich resume during on campus placements
Tip 2 : it should be readable and authentic

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Two coding questions were given in the first round to be solved in 60 minutes.

  • Q1. 

    Rearrange Array Elements Problem Statement

    Given an array A containing 'N' integers and an integer m, rearrange the elements of the array such that the differences between the array elements and m are sor...

  • Ans. 

    Rearrange array elements based on their differences from a given integer.

    • Calculate the differences between each element and the given integer.

    • Sort the elements based on their differences while maintaining the original order for elements with the same difference.

    • Implement a function to rearrange the array elements as per the given criteria.

  • Answered by AI
  • Q2. 

    Print Nodes at Distance K from a Given Node

    Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...

  • Ans. 

    The task is to find all nodes in a binary tree that are at a distance K from a given node.

    • Traverse the binary tree to find the given node

    • From the given node, perform a depth-first search to find all nodes at distance K

    • Use a list to store the values of the nodes at distance K

    • Return the list of values in any order

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.

  • Q1. 

    Triangle of Numbers Pattern

    Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.

    Example:

    Input:
    N = 4
    Output:
       1
    232
    34545
    4567654

    Explanation:

    The pat...

  • Ans. 

    Print a triangle pattern of numbers based on a given number 'N'.

    • Iterate through each row and print the numbers accordingly

    • Use spaces to center-align the numbers in each row

    • Increment the numbers in each row as per the pattern

  • Answered by AI
  • Q2. What is the difference between a web server and an application server?
  • Ans. 

    Web server serves static content over HTTP, while application server runs dynamic content and business logic.

    • Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.

    • Application server executes business logic, runs dynamic content, and interacts with databases.

    • Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.

    • Web server focuses on...

  • Answered by AI
  • Q3. How does the internet work?
  • Ans. 

    The internet is a global network of interconnected computers that communicate using standardized protocols.

    • The internet is made up of a vast number of interconnected networks of computers.

    • Data is transmitted over the internet using protocols such as TCP/IP.

    • Websites are hosted on servers connected to the internet, and users access them using web browsers.

    • Internet Service Providers (ISPs) provide access to the internet f...

  • Answered by AI
  • Q4. Write a SQL query to find the nth highest salary.
  • Ans. 

    SQL query to find the nth highest salary

    • Use the 'SELECT DISTINCT' statement to get unique salary values

    • Order the salaries in descending order using 'ORDER BY' clause

    • Use 'LIMIT' and 'OFFSET' to get the nth highest salary

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral problems.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Chitkara University. Eligibility criteriaAbove 7 CGPAInfo Edge India (Naukri.com) interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Resume Shortlist
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.

Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix

Tips: All question were from geeksforgeeks
So practice it well ..u will make through it

Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible

Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...

Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens

Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar

Interview Questionnaire 

9 Questions

  • Q1. Write a regex for email validation?
  • Ans. 

    Regex for email validation

    • Start with a string of characters followed by @ symbol

    • Followed by a string of characters and a period

    • End with a string of characters with a length of 2-6 characters

    • Allow for optional subdomains separated by periods

    • Disallow special characters except for . and _ in username

  • Answered by AI
  • Q2. Parse the XML? and store the output in JSON. Discussed different approaches?
  • Q3. Print prime numbers in a given range and optimize the solution?
  • Ans. 

    Print prime numbers in a given range and optimize the solution.

    • Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently

    • Start with a boolean array of size n+1, mark all as true

    • Loop through the array and mark all multiples of each prime as false

    • Print all the indexes that are still marked as true

  • Answered by AI
  • Q4. Puzzle – 25 horses – 5 lanes, find fastest 3 horses?
  • Q5. Web related questions on Sessions and cookies?
  • Q6. A lot of discussion on my resume, experience etc
  • Q7. Find angle between hour hand and minute hand in clock if time is given? Write a program or pseudo code?
  • Ans. 

    Find angle between hour and minute hand in a clock given the time.

    • Calculate the angle made by the hour hand with respect to 12 o'clock position

    • Calculate the angle made by the minute hand with respect to 12 o'clock position

    • Find the difference between the two angles and take the absolute value

    • If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle

  • Answered by AI
  • Q8. A hash function was written to convert a string into a hash. Write a un-hash function to revert it(from hash to string)?
  • Ans. 

    To un-hash a string, use a reverse algorithm to convert the hash back to the original string.

    • Create a reverse algorithm that takes the hash as input and outputs the original string

    • Use the same logic as the hash function but in reverse order

    • If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string

  • Answered by AI
  • Q9. He discussed about expectations and role. Asked me if I have any questions. He said to me “yaha aana hai to marwani padegi. tyar ho”? I smiled and asked what are the work timings? He said 9-9 and I was kin...

Interview Preparation Tips

General Tips: I applied through a recruiter. Then I got a call from Zomato HR. It was for LAMP developer profile. She asked me about my profile and also shared some expectations from the role. She asked me to come for F2F rounds to take the process further
Skills: Web development, JSON, Algorithm
College Name: na
Motivation: Overall process was not very tough. But they have start up culture. People work their for 11-12 hours a day. Sometimes on Saturday as well. So people who are geeks or have nothing in life to do except their job can go and join

Skills evaluated in this interview

Interview Questionnaire 

6 Questions

  • Q1. Given a Linked list , print yes if it is palindrome else print no
  • Q2. Print the level order traversal of the binary tree in the spiral form
  • Ans. 

    Print the level order traversal of binary tree in spiral form

    • Perform level order traversal of the binary tree

    • Alternate the direction of traversal for each level

    • Use a stack to reverse the order of nodes in each level

    • Print the nodes in the order of traversal

  • Answered by AI
  • Q3. Maximum of all subarrays of size k(Expected Time Complexity O(N). Input : arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6} k = 3 Output : 3 3 4 5 5 5 6
  • Ans. 

    Find the maximum element in each subarray of size k in a given array.

    • Iterate through the array from index 0 to n-k.

    • For each subarray of size k, find the maximum element.

    • Store the maximum elements in a separate array.

    • Return the array of maximum elements.

  • Answered by AI
  • Q4. Given Two sorted array of size size n each. Find the Kth largest element in these two array (Expected Time Complexity Log(n))
  • Ans. 

    To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.

    • Merge the two arrays into a single sorted array using a modified merge sort algorithm.

    • Return the Kth element from the merged array.

  • Answered by AI
  • Q5. Website having several web-pages. And also there are lot many user who are accessing the web-site. say user 1 has access pattern : x->y->z->a->b->c->d->e->f user 2 has access pattern : z->a->b->c->d user 3...
  • Q6. Given two array , one of size m+n and contains m element and other position are empty , 2nd array is of size n and contains n element. both array are sorted , now merge the second array to first one such t...
  • Ans. 

    Merge two sorted arrays into one sorted array with expected time complexity of (m+n).

    • Use a two-pointer approach to compare elements from both arrays and merge them into the first array.

    • Start comparing elements from the end of both arrays and place the larger element at the end of the first array.

    • Continue this process until all elements from the second array are merged into the first array.

  • Answered by AI

Interview Preparation Tips

Round: Test
Duration: 90 minutes

Skills: Algorithm , OS, DBMS, data structure
College Name: NIT BHOPAL

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: Coding questions were comparatively easy. There were three questions.1. Given a string map each character of which to the corresponding digit in a 10 digit mobile phone keypad.2. Don't remember, will add when it comes to my mind.3. Don't remember, will add when it comes to my mind.

Skills: Coding ability, Complete knowledge of working of internet.,
College Name: IIT Bombay

Interview Preparation Tips

Round: Test
Experience: Just 1 online test



Round - I (90 mins)



Online Test conducted @ HackerRank



a. M.C.Qs (Operating System + Aptitude + C Programming Language + Object Oriented Programming)



b. Programming (2 coding questions)The Online Exam started off after a brief Presentation on Amazon.





The MCQs were largely based on Operating System, Data structures and Algorithms, OOP concepts, C language and Aptitude.



Coding Questions



1. Determine whether a Linked List is a palindrome or not.



2. Given few sets of intervals print out the the entire intervals without overlapping , if they overlap then combine them into one.



Eg: Input : (5,7) (1 , 6) (2 ,4) (10 ,14) (8,9)



Output : (1,7) (8,9) (10,14)



Advice: Must solve at least 1 coding question to have a good chance for selection into the next round
Tips: CGPA holds importance because it is basic eligibility criteria for written test and then secondly it increases odds in your favor of your selection more than those with lower CGPA with same interview performance. Prepare a good resume



1. Prioritize your content



2. Put the most important information first (Academic Projects + Internship)



3. Proofread it twice



Advice : Do your best and leave the rest to god

Round: Test
Experience: Round II

2 Coding questions

1. Classic 2-sum problem

2. Given numbers a, b as the seeds for the Fibonacci sequence determine if a third number 'k' is a part of that sequence or not. (Tricky)
Total Questions: 2

Round: Other Interview
Experience: Round III
1. Tell me about yourself
2. Project + Internship Discussion
3. Compress a given string "aabbbccc" to "a2b3c3"
constraint: inplace compression, no extra space to be used
assumption : output size will not exceed input size

Round: Technical Interview
Experience: Round IV
1. Internship Project Discussion (30 mins)
2. Find the largest count of 0s in a row in a matrix of 0s and 1s sorted in an ascending order row-wise.
3. Replicate a tree with random pointers inplace

Round: Other Interview
Experience: Round V
1. Question related to graphs involving concepts of Depth and Height of a tree. (Took a lot of time in solving it ! but finally recognized the pattern)
2. Maximum size square sub-matrix with all 1s
3. Find the median of an infinite series of integers
4. Find the most popular Google searches. (solved it using Trie and Max-Heaps)
2 more questions but can't remember them.Finally after waiting for more than 9 hours the results were announced and I was selected
Tips: Be cool and always ask the interviewer questions at the end of the interview. Explain the interviewer your progress while solving the question so that you both are on the same page + its easier for him to understand. Behavioral and H.R.
Tips
1. Speak clearly and with confidence
2. Always prepare yourself beforehand for some common questions like:
a. Tell me about yourself.
b. Why should I hire you?
c. What are your strengths and weaknesses? (give examples)
d. What is your Dream Company?

General Tips: They judge you purely on the basis of your knowledge and performance during the face to face interviews. The extra curricular activities are not given much consideration as Amazon focuses its recruitment procedure purely on the basis of your Technical Knowledge. Prepare a good resume
1. Prioritize your content
2. Put the most important information first (Academic Projects + Internship)
3. Proofread it twice
College Name: NIT JAIPUR

Interview Questionnaire 

8 Questions

  • Q1. Given a n-ary tree. Devise an algo which determines the position at which the 3rd B is present from the given index in constant time complexity
  • Ans. 

    The algorithm finds the position of the 3rd occurrence of 'B' in an n-ary tree from a given index in constant time complexity.

    • Traverse the n-ary tree using a depth-first search (DFS) algorithm

    • Keep track of the count of 'B' occurrences

    • When the count reaches 3, return the current position

    • If the end of the tree is reached before the 3rd 'B', return -1

  • Answered by AI
  • Q2. Given a dictionary with limited words. Check if the string given to you is a composite of two words which are already present in the dictionary
  • Ans. 

    Check if a given string is a composite of two words from a limited dictionary.

    • Create a hash set of all the words in the dictionary.

    • Iterate through all possible pairs of substrings in the given string.

    • Check if both substrings are present in the hash set.

    • If yes, return true. Else, return false.

  • Answered by AI
  • Q3. Given a single linked list of certain nodes. Switch adjacent nodes. Eg. 1 2 3 4 will be 2 1 4 3
  • Ans. 

    Switch adjacent nodes in a single linked list.

    • Traverse the linked list and swap adjacent nodes.

    • Keep track of previous node to update its next pointer.

    • Handle edge cases for first two nodes and last node.

    • Example: 1->2->3->4 becomes 2->1->4->3.

  • Answered by AI
  • Q4. Given a binary search tree. Traverse only the left sub-tree
  • Ans. 

    Traverse only the left sub-tree of a binary search tree.

    • Start at the root node

    • If the left child exists, visit it and repeat the process

    • If the left child does not exist, return to the parent node

    • Continue until all nodes in the left sub-tree have been visited

  • Answered by AI
  • Q5. Implementation of AVL tree. I told solution in nlogn. He asked me optimize further
  • Q6. Write a program to test whether a string and all strings that can be made using the characters of that string are palindrome or not Input Output mmo True yakak True travel False
  • Q7. Next, I was asked to design an efficient data structure for two lifts in a building of n floors
  • Ans. 

    Design an efficient data structure for two lifts in a building of n floors.

    • Use a priority queue to keep track of the floors each lift is heading to

    • Implement a scheduling algorithm to determine which lift to assign to a new request

    • Consider adding a weight limit to each lift to prevent overloading

    • Use a hash table to keep track of the current location of each lift

  • Answered by AI
  • Q8. Given a Integer, find the maximum number that can be formed from the digits. Input : 8754365 output : 8765543
  • Ans. 

    To find the maximum number that can be formed from the digits of an integer.

    • Convert the integer to a string

    • Sort the characters in descending order

    • Join the sorted characters to form the maximum number

  • Answered by AI

Interview Preparation Tips

Skill Tips: They were looking for really cool coders. High expectation on accurate answers. looking for deep understanding of algorithms and data structures.
Skills: Algorithms, Data structures
College Name: PSIT

Skills evaluated in this interview

Tell us how to improve this page.

Interview Questions from Similar Companies

Oyo Rooms Interview Questions
3.3
 • 220 Interviews
BCD Travel Interview Questions
4.3
 • 111 Interviews
Expedia Group Interview Questions
3.8
 • 75 Interviews
Agoda Interview Questions
3.4
 • 65 Interviews
Thomas Cook Interview Questions
3.8
 • 44 Interviews
Yatra Interview Questions
3.4
 • 31 Interviews
Airbnb Interview Questions
3.7
 • 23 Interviews
Ixigo.com Interview Questions
3.6
 • 21 Interviews
Cleartrip Interview Questions
3.5
 • 18 Interviews
View all
Senior Software Engineer
325 salaries
unlock blur

₹12 L/yr - ₹33 L/yr

Assistant Manager
278 salaries
unlock blur

₹4.8 L/yr - ₹20 L/yr

Holiday Expert
226 salaries
unlock blur

₹1 L/yr - ₹8.1 L/yr

Senior Business Development Manager
223 salaries
unlock blur

₹5 L/yr - ₹12 L/yr

Software Engineer
220 salaries
unlock blur

₹8 L/yr - ₹25 L/yr

Explore more salaries
Compare MakeMyTrip with

Cleartrip

3.5
Compare

Amazon

4.1
Compare

Flipkart

3.9
Compare

Udaan

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview