## MakeMyTrip Flights Team Bangalore

Round-1: Written test 2 out of 3 to be attempted -find star(1 surrounded by all 0’s), galaxy(group of 1’s) and black hole(0 surrounded by all… Read More »

Round-1: Written test 2 out of 3 to be attempted -find star(1 surrounded by all 0’s), galaxy(group of 1’s) and black hole(0 surrounded by all… Read More »

Round 1: Current company project in depth. We have used Kafka for some functionalities. Discussion on Kafka. Immutable classes. Discussion on hashmap. Why default size of… Read More »

Q.1. What is Regression ? What is Classification ? Ans. Regression : Target variable continous. Classification : Target variable is discrete Q.2. What are the… Read More »

I applied for SSE position (Gurgaon Location) There were three rounds.. First round: Data Structures And Problem solving https://www.geeksforgeeks.org/level-order-traversal-in-spiral-form/ https://www.geeksforgeeks.org/rotate-a-matrix-by-90-degree-in-clockwise-direction-without-using-any-extra-space/ https://www.geeksforgeeks.org/design-a-data-structure-that-supports-insert-delete-search-and-getrandom-in-constant-time/ Second Round: Problem solving/Project… Read More »

MAKEMYTRIP On-Campus for FTE Makemytrip visited our campus for Placements. There were total 5 rounds (1 coding + 2 technical + 1 design + 1… Read More »

Interview was for Bangalore location. Candidates were called to the office. Questions ere straightforward but not sure of their expectations. There were lot of candidates,… Read More »

Round 1: Telephonic Interview with Principal Engineer MakeMyTrip: Q1. Difference between Spark dataframe and rdd and which one is better ? Q2. Given a two… Read More »

Round 1: How to make class immutable Shift linked list by k elements Iterative merge sort Round 2: 1) Given rules of below kind of… Read More »

Design a data structure which can do following operations add() in O(n) getMinimum() in O(1) deleteMinimum() in O(1) Source : MakeMyTrip Interview. Recommended: Please try… Read More »

Round 1.a 1. https://www.geeksforgeeks.org/find-distance-between-two-nodes-of-a-binary-tree/ 2. Sort Array in single traversal, Without using any sorting algorithm https://www.geeksforgeeks.org/sort-an-array-of-0s-1s-and-2s/ Round 1.b (On paper, write any 2) 1. https://www.geeksforgeeks.org/knapsack-problem/… Read More »

It took place at their main office in Gurgaon. Almost 42 students went for the interview. Round 1(Written): It was written round consisting of 20… Read More »

Given a linked list of 0s, 1s and 2s, sort it. Examples: Input : 2->1->2->1->1->2->0->1->0 Output : 0->0->1->1->1->1->2->2->2 Input : 2->1->0 Output : 0->1->2 Recommended:… Read More »

The diameter of a tree is the number of nodes on the longest path between two leaves in the tree. The diagram below shows two… Read More »

Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space). Examples: Input : head1: 5->7->9 head2: 4->6->8… Read More »

The diameter of a tree (sometimes called the width) is the number of nodes on the longest path between two leaves in the tree. The… Read More »