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

Clear (1)

MakeMyTrip React Js Frontend Developer Interview Questions and Answers

Updated 16 Jul 2024

MakeMyTrip React Js Frontend Developer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Product of array except self
  • Ans. 

    Calculate the product of all elements in an array except for the current element.

    • Iterate through the array and calculate the product of all elements except the current element.

    • Use two loops to calculate the product of elements before and after the current element.

    • Handle edge cases like 0s in the array to avoid division by zero errors.

  • Answered by AI
  • Q2. Closure, setTimeout

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

17 Questions

  • Q1. Find if a string is substring of other string
  • Ans. 

    The function checks if a string is a substring of another string.

    • Use the built-in string methods like 'indexOf' or 'includes' to check for substring.

    • If the language supports regular expressions, you can also use them to find substrings.

    • Consider the case sensitivity of the strings when comparing.

  • Answered by AI
  • Q2. Write a code to multiply two matrices of dimension M*N and N*K
  • Ans. 

    Code to multiply two matrices of dimension M*N and N*K.

    • Create a result matrix of dimension M*K.

    • Iterate through each row of the first matrix.

    • For each row, iterate through each column of the second matrix.

    • For each element in the row of the first matrix, multiply it with the corresponding element in the column of the second matrix.

    • Sum up the products and store the result in the corresponding position of the result matrix.

    • ...

  • Answered by AI
  • Q3. Write a Sql to perform Matrix Multiplication.Two tables has three columns row,col and value
  • Ans. 

    SQL query to perform matrix multiplication using two tables with row, col, and value columns.

    • Use JOIN operation to combine the two tables based on matching row and col values.

    • Use GROUP BY clause to group the result by row and col values.

    • Use SUM function to calculate the dot product of corresponding row and col values.

    • Use INSERT INTO statement to insert the result into a new table.

  • Answered by AI
  • Q4. What is prototype in javascript?
  • Ans. 

    Prototype in JavaScript is an object that is associated with every function and object by default.

    • Prototype is used to add properties and methods to an object.

    • It allows objects to inherit properties and methods from other objects.

    • Modifying the prototype of a function affects all instances of that function.

    • Prototypes can be used to create new objects based on existing objects.

    • The prototype chain allows for property and

  • Answered by AI
  • Q5. How do we write classes in javascript?
  • Ans. 

    Classes in JavaScript are written using the class keyword.

    • Use the class keyword followed by the class name to define a class.

    • Use the constructor method to initialize class properties.

    • Add methods to the class using the class prototype.

    • Use the new keyword to create an instance of the class.

  • Answered by AI
  • Q6. There is a ladder of N steps.We can either take 1 step or 2 steps.In how many different ways one can climb the ladder?
  • Ans. 

    The number of different ways to climb a ladder of N steps by taking 1 or 2 steps at a time.

    • This is a classic problem that can be solved using dynamic programming.

    • The number of ways to climb N steps is equal to the sum of the number of ways to climb N-1 steps and N-2 steps.

    • The base cases are when N is 0 or 1, where there is only 1 way to climb the ladder.

    • For example, for N=4, there are 5 different ways: [1, 1, 1, 1], [1

  • Answered by AI
  • Q7. Print a square matrix in spiral order
  • Ans. 

    Print a square matrix in spiral order

    • Start by defining the boundaries of the matrix

    • Iterate through the matrix in a spiral pattern, printing each element

    • Adjust the boundaries after each iteration to move inward

    • Repeat until all elements are printed

  • Answered by AI
  • Q8. Given a table with 3 columns StudentName,Subject and Marks.Write a sql to retrieve second highest Marks Obtained for each student
  • Ans. 

    Retrieve the second highest marks obtained by each student from a table with student name, subject, and marks.

    • Use the RANK() function to assign a rank to each row based on the marks in descending order.

    • Filter the result to only include rows with rank 2 for each student.

    • Group the result by student name to get the second highest marks for each student.

  • Answered by AI
  • Q9. Given a Website with header,footer,side ads(Google ads,Internal ads).How will you extract only useful data from the page
  • Q10. Difference between .live() and .delegate() in jquery
  • Ans. 

    The .live() method attaches an event handler to the current and future elements, while .delegate() attaches an event handler to a parent element.

    • The .live() method is deprecated in newer versions of jQuery.

    • The .delegate() method is preferred over .live() for performance reasons.

    • Both methods are used to handle events for dynamically added elements.

    • Example: $(document).live('click', 'button', function() { ... });

    • Example:...

  • Answered by AI
  • Q11. What is chaining in jquery?
  • Ans. 

    Chaining in jQuery allows multiple methods to be called on a single element in a single line of code.

    • Chaining simplifies code and improves readability.

    • Each method in the chain operates on the result of the previous method.

    • The chain ends with a method that does not return a jQuery object.

    • Example: $('div').addClass('highlight').fadeOut();

  • Answered by AI
  • Q12. What is callback function?
  • Ans. 

    A callback function is a function that is passed as an argument to another function and is executed later.

    • Callback functions are commonly used in event-driven programming.

    • They allow asynchronous execution of code.

    • Callback functions can be used to handle responses from APIs or user interactions.

    • They can be anonymous functions or named functions.

    • Example: setTimeout(function() { console.log('Hello!'); }, 1000);

  • Answered by AI
  • Q13. What is .bind() function in jquery?
  • Ans. 

    The .bind() function in jQuery is used to attach an event handler function to one or more elements.

    • It allows you to specify the event type and the function to be executed when the event occurs.

    • The .bind() function can be used to bind multiple events to the same element.

    • It can also be used to pass additional data to the event handler function.

    • The .bind() function is deprecated in jQuery version 3.0 and above. It is reco

  • Answered by AI
  • Q14. Find the angle between hour handle and minute handle in a clock
  • Ans. 

    The angle between the hour and minute hands of a clock can be calculated using a formula.

    • The hour hand moves 30 degrees per hour and 0.5 degrees per minute.

    • The minute hand moves 6 degrees per minute.

    • Calculate the angle between the two hands using the formula: |30H - 11M/2|, where H is the hour and M is the minute.

  • Answered by AI
  • Q15. Is it possible to create slideshow without using javascript
  • Ans. 

    Yes, it is possible to create a slideshow without using JavaScript.

    • Use CSS animations and transitions to create the slideshow.

    • Use HTML and CSS to structure and style the slideshow.

    • Utilize keyframe animations to create the slide transitions.

    • Use radio buttons or checkboxes to control the slideshow navigation.

    • Apply the :target pseudo-class to create a simple slideshow without JavaScript.

  • Answered by AI
  • Q16. Questions about my current project and academic project
  • Q17. Given two points A and B with distance between them lets say D.there are N men who want to go from point A to point B.All men walk with same speed.They also have one scooter with them which has speed grea...
  • Ans. 

    The men can take turns riding the scooter, allowing them to reach point B faster.

    • The men can form a queue and take turns riding the scooter.

    • The person riding the scooter can drop it off at a certain point and the next person can pick it up.

    • The scooter can be passed along the line of men until everyone reaches point B.

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Javascript
College Name: na

Skills evaluated in this interview

Interview Preparation Tips

Skill Tips: To crack Yatra interview Java, Data Structures and Algorithms concepts should be clear.
Skills: Java, Data structures, Algorithm
College Name: na

Interview Preparation Tips

Round: Technical Interview
Experience: The interviewers were professional in their approach and ensured that I was comfortable through the whole process.

General Tips: Interview process was fairly fast but a bit heavy. There were 4 technical interviews and 1 HR. It turns out to be not too difficult as some questions are duplicated in all the interviews.
Skills: Algorithm, data structure
College Name: na

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 75 minutes
Round difficulty - Easy

This was the online round held at university. All students who met the eligibility criteria were called for the online test on hackerrank.

  • Q1. 

    Anagram Difference Problem Statement

    Given two strings, 'STR1' and 'STR2', of equal lengths, determine the minimum number of manipulations required to make the two strings anagrams of each other.

    Input:

    ...
  • Ans. 

    The problem involves finding the minimum number of manipulations required to make two strings anagrams of each other.

    • Create frequency maps for both strings

    • Find the absolute difference in frequencies of each character

    • Sum up the absolute differences to get the total manipulations needed

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

This round was technical round and the interview started with formal introduction and general questions.
After that We had a discussion on LRU Cache.
Followed by coding and set of data structure questions.

  • Q1. 

    Gas Tank Problem Statement

    You have a car with a gas tank of infinite capacity. There are 'N' gas stations located along a circular route, numbered from 0 to N-1. You begin your journey with an empty tank...

  • Ans. 

    Find the starting gas station index to complete a circular route with gas and cost arrays.

    • Iterate through gas stations, keeping track of total gas and total cost from each station

    • If total gas is greater than or equal to total cost, update the starting station index

    • Return the starting station index if a valid one is found, else return -1

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.

  • Q1. 

    Boundary Traversal of Binary Tree

    Given a binary tree of integers, your task is to print the boundary nodes of this binary tree in an anti-clockwise direction starting from the root node.

    Input:

    The fir...
  • Ans. 

    Print the boundary nodes of a binary tree in an anti-clockwise direction starting from the root node.

    • Traverse the left boundary nodes from the root to the leftmost leaf node.

    • Traverse the leaf nodes from left to right.

    • Traverse the right boundary nodes from the rightmost leaf node to the root.

  • Answered by AI
  • Q2. 

    Maximum Sum of Two Non-Overlapping Subarrays

    Given an integer array ARR and a positive integer K, your objective is to find two non-overlapping subarrays (contiguous) of length K each, such that their sum...

  • Ans. 

    Find two non-overlapping subarrays of length K with maximum sum in an integer array.

    • Iterate through the array to find all possible subarrays of length K.

    • Calculate the sum of each pair of non-overlapping subarrays of length K.

    • Keep track of the maximum sum obtained from the pairs of subarrays.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was the Final Interview and it started with formal introduction and general HR questions. Then We discussed about the projects and the things written in my resume. The interviewer was very frank and this round was very interactive. He asked me about my college, my future plans, teachers, various subjects, why Expedia and questions like that.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in DelhiEligibility criteriaAbove 7.5 CGPA, Candidates from computer related branch only.Expedia Group interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Designs, Operating Systems, DBMSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be solid with the basics of Ds & Algorithms. Good to have end to end projects which are hosted on cloud.
Tip 2 : Its always good to be presentable and have good communications skills
Tip 3 : Be honest, clear in approach and always walkthrough your thought process to the interviewer

Application resume tips for other job seekers

Tip 1: Mention your projects and experience at the top. Be clear on what was done, a brief on how it was done, language /tech stack involved. If possible try to host and make it accessible. You never know if you can present it with just one click.
Tip 2: Choose a balance between, white spaces and text, it should be well indented, no grammatical errors.
Tip 3: It takes less than 2 min to scan a resume. Don't mention things which are irrelevant.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Easy

The test was divided into two parts : Section A had questions from Quantitative, C language, Logical and English. The second part had two coding questions.

  • Q1. 

    Deletion in Circular Linked List Problem Statement

    Given a Circular Singly Linked List of integers, and a specific value 'VAL', your task is to delete the first occurrence of this value in the linked list...

  • Ans. 

    Delete the first occurrence of a specific value in a Circular Linked List.

    • Traverse the circular linked list to find the value to be deleted.

    • Update the pointers to skip the node containing the value.

    • Handle edge cases like deleting the only node in the list.

    • Return the modified circular linked list.

  • Answered by AI
  • Q2. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraints.

    • Use a combination of a doubly linked list and a hashmap to efficiently implement the LRU cache.

    • Keep track of the least recently used item and update it accordingly when new items are added.

    • Ensure that the cache does not exceed its capacity by evicting the least recently used item when necessary.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAExpedia Group interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 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 interviewRejected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Easy

Hello everyone! Expedia came to our campus for full time hiring of final year students. They had shortlisted candidates for the interviews by taking an online test comprised of four sections (Quantitative, C, Logical and English). Every section had a timer attached to it, so you need to think and answer quickly. Although, the questions were easy but cutoff was quite high. This round was followed by a coding round, comprised of two questions.

  • Q1. 

    Problem: Deletion in Circular Linked List

    You are provided with a Circular Linked List of integers and a specific integer, referred to as 'key'.

    Your task is to implement a function that locates the spec...

  • Ans. 

    Implement a function to delete a specific key from a Circular Linked List of integers.

    • Traverse the Circular Linked List to find the key to be deleted.

    • Adjust the pointers to remove the node containing the key.

    • Handle the case where the Circular Linked List becomes empty after deletion.

    • Return -1 if the Circular Linked List is empty after deletion.

  • Answered by AI
  • Q2. 

    Page Faults Identification Problem Statement

    In computing, a page fault occurs when a process accesses a memory page that is not currently mapped by the memory management unit. To handle new pages being b...

  • Ans. 

    The problem involves determining the number of page faults using the Least Recently Used (LRU) replacement algorithm.

    • Page faults occur when a process accesses a memory page not currently mapped by the memory management unit.

    • Page replacement algorithm like LRU is used to decide which existing page should be replaced.

    • The goal is to calculate the number of page faults based on the given input sequences and memory capacity...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The man who was taking my first round was my alumni. He started-off by asking my introduction and then gave me 2 programming questions to code. He then navigated on to my Codechef profile and asked a question that I did in the June 14 Long Contest. I explained him and he was satisfied. 
Tips : You don’t have to answer the stuffs quickly, rather you need to develop some test cases and have some discussion regarding the structure of the problem, and then answer.

  • Q1. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.

    • Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

    • If the two pointers meet at any point, it indicates the presence of a cycle in the linked list.

    • Use Floyd's Cycle Detection Algorithm for efficient detection of cycles in a linked list.

  • Answered by AI
  • Q2. 

    Closest Sum Problem Statement

    Given an array of integers ARR of size N and an integer target, find three integers in ARR such that their sum is closest to the target. If there are two closest sums, return...

  • Ans. 

    Find three integers in an array whose sum is closest to a given target, return the smallest sum if there are two closest sums.

    • Iterate through all possible triplets in the array to find the sum closest to the target.

    • Keep track of the closest sum found so far and update it if a closer sum is found.

    • Return the closest sum at the end of the iteration.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAExpedia Group interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 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 was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Coding question of medium level difficulty, from DP. 
18 MCQs were core CSE related concepts e.g: OS, OOPs, DBMS, Networking
Time was 90 minutes.

  • Q1. 

    Minimum Cost to Destination

    You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...

  • Ans. 

    Find the minimum cost to reach a destination in a matrix with blocked cells.

    • Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.

    • Keep track of the cost incurred at each cell and update it as you move through the matrix.

    • Return the minimum cost to reach the destination or -1 if it is unreachable.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

It was an one-to-one interview. It checks your problem solving ability and a few OOPs, OS, DBMS etc concepts. Coding questions were related to array, queue and DP.

  • Q1. 

    Triangle Formation Using Array Elements

    Given an integer array/list ARR of length 'N', determine if it is possible to form at least one non-degenerate triangle using the values of the array as the sides o...

  • Ans. 

    Determine if it is possible to form a non-degenerate triangle using array elements as sides.

    • Check if the sum of any two sides is greater than the third side for all combinations of sides.

    • If the above condition is met for any combination, return true; otherwise, return false.

  • Answered by AI
  • Q2. 

    Maximum Sum of Non-Adjacent Elements

    You are given an array/list of integers. The task is to return the maximum sum of a subsequence such that no two elements in the subsequence are adjacent in the given ...

  • Ans. 

    Find the maximum sum of non-adjacent elements in an array.

    • Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.

    • At each index, the maximum sum can be either the sum excluding the current element or the sum including the current element but excluding the previous element.

    • Iterate through the array and update the maximum sum accordingly.

    • Example: F...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Easy

It was also a problem solving round. However after coding questions, they also asked CSE conceptual questions.

  • Q1. 

    Sum Tree Conversion

    Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...

  • Ans. 

    Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return preorder traversal.

    • Traverse the tree in a bottom-up manner, starting from the leaf nodes.

    • For each node, update its value to the sum of its children's values.

    • Set leaf nodes to 0.

    • Return the preorder traversal of the modified tree.

  • Answered by AI
  • Q2. What are the core concepts of indexing in Database Management Systems (DBMS)?
  • Ans. 

    Core concepts of indexing in DBMS include types of indexes, benefits of indexing, and factors affecting index performance.

    • Types of indexes: B-tree, Hash, Bitmap, etc.

    • Benefits of indexing: Faster data retrieval, improved query performance, reduced disk I/O.

    • Factors affecting index performance: Selectivity, clustering factor, index fragmentation.

    • Examples: Creating an index on a column in a table to speed up search queries

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute of Technology Delhi (New Campus). Eligibility criteria7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, OS, DBMS, Algorithms, Networking, Coding, OOPTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Strengthen your coding, algorithms. This is one most important thing for OYO. Practice Graph, tree, DP, greedy, recursion, data structures questions.
Tip 2 : OS, DBMS concepts will give you an edge over others. Like serialisation, index, deadlock, semaphore
Tip 3 : Only mention those projects in your resume which you are very clear about. They don't ask for detailed explanation, just an overall idea about your projects will increase your chances

Application resume tips for other job seekers

Tip 1 : Mention college projects wisely. No need to mention fancy projects. Any project that you can describe to the interviewer will be a best solution
Tip 2 : Neat & clean resume with your skills, technical stacks that you mastered. That's all. They don't require you to be very active in extra-curricular activities, and these things will not give you any advantage.
Tip 3 : Keep it of single page

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 minutes
Round difficulty - Easy

This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.

1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes

This Round was Conducted on Hackerrank (Webcam Enabled).

  • Q1. Given a problem statement and a code, how would you find and correct the bugs in the code?
  • Ans. 

    To find and correct bugs in code, analyze problem statement, review code, use debugging tools, run test cases, and make necessary changes.

    • Understand the problem statement and expected output

    • Review the code for syntax errors, logical errors, and potential bugs

    • Use debugging tools like breakpoints, print statements, and IDE features

    • Run test cases to identify the bugs and verify the corrections

    • Make necessary changes to the

  • Answered by AI
  • Q2. 

    Count Nodes within K-Distance Problem Statement

    Given a connected, undirected, and acyclic graph where some nodes are marked and a positive integer 'K'. Your task is to return the count of nodes such that...

  • Ans. 

    Count the number of nodes within K-distance from marked nodes in a connected, undirected, acyclic graph.

    • Create a graph using the given vertices and edges.

    • Perform a BFS traversal starting from each marked node to find nodes within K-distance.

    • Count the nodes within K-distance from all marked nodes and return the total count.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

  • Q1. 

    Problem Statement: Largest Subarray with Equal Number of 0s and 1s

    Given an array containing only 0s and 1s, determine the length of the longest contiguous subarray that has an equal number of 0s and 1s.

    ...
  • Ans. 

    Find the length of the longest subarray with equal number of 0s and 1s in a given array of 0s and 1s.

    • Iterate through the array and maintain a running count of the difference between the number of 0s and 1s encountered so far.

    • Store the count values in a hashmap with the index as the key.

    • If the same count is encountered again, calculate the length of the subarray between the two occurrences.

    • Return the maximum length foun

  • Answered by AI
  • Q2. Can you explain how the file system is stored on a disk and how it works?
  • Ans. 

    File system is stored on disk using data blocks and metadata, organized in a hierarchical structure.

    • File system is stored on disk using data blocks and metadata

    • Data blocks contain actual file data, while metadata stores information about files and directories

    • File system is organized in a hierarchical structure with directories containing files and subdirectories

    • File system uses a file allocation table (FAT) or an index

  • Answered by AI
  • Q3. Can you distinguish between RISC and CISC architectures?
  • Ans. 

    RISC focuses on simplicity and efficiency, while CISC emphasizes complex instructions and flexibility.

    • RISC uses a small set of simple instructions, while CISC uses a large set of complex instructions.

    • RISC architectures have a uniform instruction format, while CISC architectures have variable-length instructions.

    • RISC architectures rely on optimizing compilers for performance, while CISC architectures have hardware optim...

  • Answered by AI
Round 3 - HR 

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in NoidaEligibility criteriaAbove 8 CGPAExpedia Group interview preparation:Topics to prepare for the interview - Dynamic Programming, OOPS, Computer Networks, Computer System Architecture, Operating System, Data Structures, PointersTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Make sure that you are thorough with CS concepts beforehand.
Tip 2 : Even when you are explaining the approach to a question, try to parallelly think about how you would code it.
Tip 3 : Read the previous interview experiences. It would give a fair idea of the kind of questions one should expect.
Tip 4 : For a company like Adobe, practicing medium difficulty level coding questions would be the way to go.
Tip 5 : Practice atleast 200 questions from coding platforms like CodeZen, LeetCode, Interviewbit as they contain common interview questions.

Application resume tips for other job seekers

Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jul 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 180 Minutes
Round difficulty - Medium

coding questions on DSA and MCQs on java 
timing : late night 
no camera

  • Q1. 

    Knight Probability in Chessboard

    Calculate the probability that a knight remains on an N x N chessboard after making K moves. Initially, the knight is placed at a given position on the board. It can move ...

  • Ans. 

    Calculate the probability that a knight remains on an N x N chessboard after making K moves.

    • Use dynamic programming to calculate the probability of the knight staying on the board after each move.

    • Consider all possible moves the knight can make from its current position.

    • Keep track of the probabilities at each position on the board after each move.

    • Normalize the probabilities at the end to get the final result.

    • Example: Fo...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

It was a DSA round.

  • Q1. 

    Binary Tree to Doubly Linked List

    Transform a given Binary Tree into a Doubly Linked List.

    Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.

    Input:

    The fi...
  • Ans. 

    Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.

    • Perform Inorder Traversal of the Binary Tree to get the nodes in order.

    • Create a Doubly Linked List by connecting the nodes in the order obtained from Inorder Traversal.

    • Return the head of the Doubly Linked List as the output.

  • Answered by AI
  • Q2. 

    Find Duplicates in an Array

    Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.

    Return the duplicate elements in any orde...

  • Ans. 

    Find duplicates in an array of integers within a specified range.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Return elements with count greater than 1 as duplicates.

    • Time complexity can be optimized to O(N) using a set to store duplicates.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

DSA Questions were asked.

  • Q1. 

    Remove Character from String Problem Statement

    Given a string str and a character 'X', develop a function to eliminate all instances of 'X' from str and return the resulting string.

    Input:

    The first lin...
  • Ans. 

    Develop a function to remove all instances of a given character from a string.

    • Iterate through the string character by character and skip the character to be removed.

    • Build a new string by appending characters that are not equal to the given character.

    • Return the final modified string.

    • Handle edge cases like empty string or character not found in the string.

  • Answered by AI
  • Q2. 

    String Rearrangement Problem Statement

    You are given a string of lowercase characters. The objective is to rearrange (reorder) the string so that no two adjacent characters are identical.

    Return the rear...

  • Ans. 

    The objective is to rearrange a string so that no two adjacent characters are identical. Return the rearranged string or 'NO SOLUTION'.

    • Iterate through the string and count the frequency of each character.

    • Create two lists, one for characters with odd frequency and one for characters with even frequency.

    • If the count of characters with odd frequency is greater than 1, return 'NO SOLUTION'.

    • Alternate between characters with...

  • Answered by AI
Round 4 - HR 

Round duration - 50 Minutes
Round difficulty - Easy

It was a behavioural round.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteria7 CGPAExpedia Group interview preparation:Topics to prepare for the interview - Data structures and algorithms, oops, os, dbms, web, development(ruby and reactjs) , basic quant, every topic of DSA in depthTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Tip 1 : strong grasp on DSA and problem solving 
Tip 2 : follow leetcode (try to do as many medium questions as possible) 
Tip 3 : should focus on development also and internships

Application resume tips for other job seekers

Tip 1 : good projects and coding profiles like leetcode 
Tip 2 : some good internships also help

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

MakeMyTrip Interview FAQs

How many rounds are there in MakeMyTrip React Js Frontend Developer interview?
MakeMyTrip interview process usually has 1 rounds. The most common rounds in the MakeMyTrip interview process are Technical.
What are the top questions asked in MakeMyTrip React Js Frontend Developer interview?

Some of the top questions asked at the MakeMyTrip React Js Frontend Developer interview -

  1. Product of array except s...read more
  2. Closure, setTime...read more

Recently Viewed

INTERVIEWS

Salesforce

No Interviews

INTERVIEWS

MakeMyTrip

No Interviews

DESIGNATION

INTERVIEWS

Delhi Professional Courses Academy

No Interviews

INTERVIEWS

MakeMyTrip

No Interviews

INTERVIEWS

Salesforce

No Interviews

INTERVIEWS

MakeMyTrip

No Interviews

INTERVIEWS

MakeMyTrip

No Interviews

JOBS

Hubert Enviro Care Systems

No Jobs

INTERVIEWS

Salesforce

No Interviews

Tell us how to improve this page.

MakeMyTrip React Js Frontend Developer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

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

₹0 L/yr - ₹0 L/yr

Assistant Manager
268 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Holiday Expert
225 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Business Development Manager
220 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Executive
210 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare MakeMyTrip with

Cleartrip

3.4
Compare

Yatra

3.4
Compare

Goibibo

4.3
Compare

Oyo Rooms

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