MakeMyTrip Sdet Interview Questions and Answers

Machine coding round

Q1. Explain your project
Ans. 
Developed a web application for managing inventory and sales for a retail store
• Used React.js for front-end development

• Implemented Node.js for back-end functionality

• Utilized MongoDB for database management
Answered by AI
Add your answer
Q2. Tell me about yourself
Ans. 
I am a passionate software developer with experience in Java, Python, and web development.
• Experienced in Java, Python, and web development technologies

• Strong problem-solving skills

• Team player with excellent communication skills
Answered by AI
Add your answer

Implement an iterator to flatten 2D vector

Q1. Find shortest path to get all keys
Ans. 
Use Dijkstra's algorithm to find the shortest path to get all keys
• Implement Dijkstra's algorithm to find the shortest path in a graph

• Consider the keys as nodes in the graph and the paths between keys as edges

• Keep track of the keys collected and update the shortest path accordingly
Answered by AI
Add your answer

Second number from array

Q1. Data Structures and Theoretical Java and SQL concepts like - views, indexes, DML
Add your answer

Programs on Sorting and Search Algorithms and Core Java

Q1. Basics of android and java
Add your answer

Ds related questions

Q1. All Android (Java and kotlin)
Add your answer

Q1. Past projects,android,kotlin
Add your answer

Q1. About Salary discussion
Add your answer

Q1. What are the types of data.
Ans. 
Types of data include numerical, categorical, ordinal, and binary.
• Numerical data includes continuous and discrete values, such as height and age.

• Categorical data includes non-numeric values, such as colors and types of fruit.

• Ordinal data includes values with a specific order, such as rankings and ratings.

• Binary data includes only two possible values, such as true/false and yes/no.
Answered by AI
Add your answer

Q1. Core : DBMS , oops in depth coding: basic DSA questions based on Arrays, String.
Add your answer

Q1. He asked me graph questions ( medium level ) based on a node to root, and min cost to target. note: if you really want to crack the yata.com interview practice graph question and they ask a leetcode questi...read more
Add your answer