I applied online. The process took 2 weeks.

The interview process at Myntra started with an Online Assessment (OA) that primarily tested my data structures and algorithms skills. One of the core problems was based on graphs, involving traversal and cycle detection in a directed graph. I was expected to optimize the solution using DFS with proper visited and recursion stack handling.

This was essentially a graph cycle detection problem in a directed graph, modeled using adjacency lists. I had to use Kahn’s Algorithm (BFS-based topological sort) to detect if there's a cycle. If the topological sort didn't include all nodes, that meant a cycle existed and not all courses could be completed.