Interview SDE 2 Backend Round 1 Make My Trip Gurugram

makemytrip logo
makemytrip
· SDE 2 Backend· Gurugram
May 8, 2026 · 2 reads

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.

Interview Questions (2)

1.

Intersection of Two Linked Lists

Data Structures & Algorithms·Easy

Given 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.

2.

Course Schedule II

Data Structures & Algorithms·Medium

There 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.

📣 Found this helpful? Please share it with friends who are preparing for interviews!

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!