Interview SDE 2 Backend Round 1 Make My Trip Gurugram
- Location
- Gurugram
- Posted
- 8 May 2026
Summary
I interviewed for the SDE 2 Backend position at MakeMyTrip. The first round consisted of two coding problems related to linked lists and graph traversal.
How it went
Questions asked (2)
- 01
Intersection of Two Linked Lists
Data Structures & Algorithms · Easy
Open the problemGiven the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return null.
- 02
Course Schedule II
Data Structures & Algorithms · Medium
Open the problemThere are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai. Return the ordering of courses you should take to finish all courses. If there are many valid answers, return any of them. If it is impossible to finish all courses, return an empty array.