i
MakeMyTrip
Filter interviews by
Clear (1)
I applied via Referral and was interviewed before Nov 2023. There was 1 interview round.
Top trending discussions
I applied via Company Website and was interviewed in Jun 2024. There were 2 interview rounds.
Emails to the host and guests.
I have the necessary skills, experience, and passion for the role.
I have relevant experience in the industry
I possess the required skills and qualifications
I am passionate about the work and eager to contribute
I have a track record of success in similar roles
Seeking new challenges and growth opportunities in a different environment.
Desire for new challenges and learning experiences
Opportunity for career advancement
Seeking a better work-life balance
Interest in exploring different industries or sectors
I applied via Referral and was interviewed before Dec 2023. There was 1 interview round.
I applied via Referral and was interviewed before Dec 2023. There was 1 interview round.
I applied via Job Fair and was interviewed before Dec 2023. There was 1 interview round.
I applied via Walk-in and was interviewed before Dec 2023. There was 1 interview round.
I applied via Referral and was interviewed before Dec 2023. There were 2 interview rounds.
I applied via Job Portal and was interviewed in Jul 2024. There was 1 interview round.
There is a question based on Rest API and another question on Java
Machine coding round
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
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
I applied via Company Website and was interviewed in Sep 2023. There were 2 interview rounds.
Implement an iterator to flatten 2D vector
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
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Senior Software Engineer
322
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
268
salaries
| ₹0 L/yr - ₹0 L/yr |
Holiday Expert
225
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Business Development Manager
220
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
210
salaries
| ₹0 L/yr - ₹0 L/yr |
Cleartrip
Yatra
Goibibo
Oyo Rooms