MakeMyTrip Interview Experience | Set 6 (Online Coding) (original) (raw)

Last Updated : 16 Aug, 2024

Round-1: Online testThere were 2 sections – Aptitude and Coding Section A- 20 MCQ's on General Aptitude.

Section B- There were 3 coding questions. 1) Given an array and 2 numbers l,r find the number of elements in the array in between l and r; 2) Calculate a power b (b -> [1,1000000000] (required a logn approach). 3) Let 1 represent ‘A’, 2 represents ‘B’, etc. Given a digit sequence, count the number of possible decodings of the given digit sequence.eg. input - "121" output - 3.Round-2 : Technical Round (1 hour 10 minutes). The interviewer was very friendly and was trying to find out how much u can think. 1) Given a rotated array around a pivot element find a number x in the array.(write code in log n time). 2)Given 50 red and 50 blue balls, arrange them in 2 bags in such a way that the probability of taking out a red ball in 1st attempt is strictly > 1/2. 3) reverse a linked list.4) The concept behind why a sewage lid on a road is round-shaped.Trying to find out how much u can think. (because the lid wont go inside in any way as a circle is uniform 360 degree.Rest any shape can go inside along the diagonal vertically). 5) find the depth of a tree.6) A cake is on table.Another piece is cut from anywhere in the cake.Using a single cut divide the cake into 2 parts.(cut along the line joining the mid-points of the cake and the piece.) 7) write full working code for printing a matrix in spiral form.8) Measure 4 litres water using 2 containers of capacity 5 and 3 litres respectively.(infinite supply of water).**Round-2 Technical Round (50 minutes).**A good 10-minutes discussion on my project. Next I was made to write full code for every question. 1) Iterative preorder traversal. 2) Iterative inorder traversal. 3) Reverse a string wordwise. (Let the input string be “i like this program very much”. The function should change the string to “much very program this like i”). 4) Calculate a^b in logn and find the total number of multiplications.(check binary representation of b and count 1's for the number of multiplications.)Round-3: HR RoundSome general question on my background and the HR gave a presentation and she finally said SEE U IN MAKEMYTRIP. I thank geeksforgeeks for my success.

Related Practice Problems

Similar Reads

• DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read
• Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read
• Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read
• Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read
• Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read
• Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read
• Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read
• Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read
• Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example 12 min read
• Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an 8 min read