Myntra SDE 1 Campus Interview: Grid Puzzles, Tree Distance, and a BookMyShow Design Round
Updated July 17, 2026
This account comes from a student's write-up covering a December 2021 on-campus placement season, during which several companies interviewed the same batch of candidates for SDE 1 roles. Myntra was one of the companies that visited, and this piece focuses specifically on what the candidate was asked across Myntra's rounds.
The process moved from two data-structures-focused technical rounds into a single managerial round built around the candidate's resume, a system-design prompt, and standard leadership and HR questions. The candidate also flagged their own read on Myntra's campus conversion rate as something worth weighing before prioritizing it over other companies in the same drive.
How the process went
Campus recruitment context
Myntra was one of several companies interviewing the candidate's batch during a December 2021 on-campus placement drive; the candidate was also going through parallel processes with other companies in the same window.
Round 1 (Technical)
Opened with a grid-based counting problem, then moved into a LeetCode-style graph question (Course Schedule II).
Round 2 (Technical)
Continued with an array-construction greedy problem (Largest Number) and a harder tree-distance counting problem.
Round 3 (Managerial)
No coding problems; instead a resume walkthrough, a system-design question, and leadership/HR questions.
Round 1 - Technical
Matrix logic and graph traversal
- Given an m x n grid of cells marked B (black) or W (white), write a program to count cells that are the only B in both their row and column.
- Course Schedule II (LeetCode) - determine a valid order to finish all courses given prerequisite pairs, or report that no valid order exists.
The candidate was given a worked example of the grid problem (a 3x3 grid with a single qualifying cell) before writing code.
Round 2 - Technical
Array construction and tree distance
- Largest Number (LeetCode) - arrange a list of non-negative integers so that they form the largest possible number.
- Count Subtrees With Max Distance Between Cities (LeetCode) - for each subtree size, count the subtrees whose maximum pairwise node distance equals that size.
Round 3 - Managerial
Resume deep dive, system design, and leadership/HR
- Walk through the projects and experience listed on your resume.
- Design a movie-ticket booking platform along the lines of BookMyShow.
- How would you handle two users trying to book the same last available ticket at the same time?
- Describe how you would handle a disagreement with your manager over a technical approach.
- What would you say are your strengths and weaknesses?
The candidate described this round as covering almost everything on their resume in depth.
Key takeaways
- Review grid/matrix traversal and classic graph problems such as course scheduling - Myntra's first technical round drew on both.
- Expect at least one tougher problem in the second technical round, such as a greedy array-construction question or a tree-distance counting problem.
- Prepare a system-design walkthrough for a consumer-facing app like a ticket-booking platform, including how to reason about a race condition on the last unit of inventory.
- The managerial round can be entirely non-coding - be ready to narrate your resume in depth and answer leadership and HR-style questions.
- If you're weighing which companies to prioritize in a multi-company campus drive, the candidate's own read was that Myntra converted only a small number of candidates that season, worth factoring into how much prep time you allocate.
Source
The questions and process facts come from the candidate's public write-up, linked below. The retelling above is our own summary.
Candidate's public write-up on LeetCode Discuss