New update is available. Click here to update.

MakeMyTrip Interview Experience for Fresher Fullstack Developer, Aug 2020

Posted: 6 Mar 2022

Selected

Interview Rounds

Application Process

Round 1

Round 2

Round 3

Interview Process

Online Coding Interview

Moderate

Duration:

60 Minutes

Interview-Date:

20 Aug 2020

Problems:

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.

Reach the destination

Given a source point (sx, sy) and a destination point (dx, dy), the task is to check if it is possible to reach the destination point using the following valid moves:

Try Problem

Delete Node In BST

You have been given a Binary Search Tree of integers with ‘N’ nodes. You are also given data of a node of this tree. Your task is to delete the given node from the BST.

Try Problem

Preparation

Duration:

3 months

Topics:

Data Structures, OOPS, OS, DBMS, Computer Networking

Preparation Tip

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 Process

Where:

Campus

Eligibility:

7 CGPA

Resume Tip

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

0 upvotes

Have an interview experience that you want to contribute?

PreviousNext

Start a Discussion

MakeMyTrip Mock Interviews

For college students & professionals looking to get into MakeMyTrip

Similar Experiences

Categories:

Coding courses for beginners |

Web Development Courses |

Data Science & Machine Learning Courses |

Competitive Programming Course |

Android App Development Courses |

Courses for interview preparation

Popular Courses:

C++ Foundation with Data Structures |

Java Foundation with Data Structures |

Python Foundation with Data Structures |

Competitive Programming |

Full Stack Web Development

Career Tracks:

Ninja Competitive Programmer Track |

Ninja Android Developer Career Track |

Ninja Web Developer Career Track - NodeJS & ReactJs |

Ninja Web Developer Career Track - NodeJS |

Ninja Data Scientist Career Track |

Ninja Machine Learning Engineer Career Track

MakeMyTrip Interview Experience for Fresher Fullstack Developer, Aug 2020

Interview Process

Online Coding Interview

Given a source point (sx, sy) and a destination point (dx, dy), the task is to check if it is possible to reach the destination point using the following valid moves:

You have been given a Binary Search Tree of integers with ‘N’ nodes. You are also given data of a node of this tree. Your task is to delete the given node from the BST.

Preparation

Application Process

Similar Experiences

Interested in Coding Ninjas Flagship Courses?