Myntra interview process (2026)

Round-by-round breakdown of the Myntra software engineering interview across 4 levels and 17 rounds: interview mode, sample questions, and worked solutions.

Myntra salary & ratings · All interview processes

Software Engineering Intern (SDE Intern, 6-month) — Myntra RampUp / Campus

Difficulty: Medium · Timeline: 6-month · Recommended prep: 4-8 weeks · Cooldown: No formally published cooldown; off-campus applicants typica

  1. Round 0: Online Assessment (Coding Colosseum / Mettl)

    Assessment · ~1 hour · difficulty 2/5 · elimination round

    Mode of interview: Online assessment

    Sample question: Search in Rotated Sorted Array — Given a sorted array of distinct integers that has been rotated at an unknown pivot, and a target value, return the index of target in O(log n) time, or -1 if it is not present.

  2. Round 1: Technical Interview 1 (DSA / Problem-Solving)

    Onsite · ~45-60 minutes · difficulty 2/5 · elimination round

    Mode of interview: Onsite or virtual onsite interview

    Sample question: 3Sum — Given an integer array, return all unique triplets [a, b, c] such that a + b + c = 0. The solution set must not contain duplicate triplets.

  3. Round 2: Technical Interview 2 (Technical + Managerial)

    Onsite · ~45-60 minutes · difficulty 2/5 · elimination round

    Mode of interview: Onsite or virtual onsite interview

SDE-1 (Software Development Engineer, entry-level)

Difficulty: Medium · Timeline: 2-4 weeks · Recommended prep: 6-10 weeks · Cooldown: ~6 months

  1. Round 0: Online Coding Assessment

    Assessment · ~60 minutes · difficulty 2/5 · elimination round

    Mode of interview: Online assessment · HackerRank

    Sample question: Search in Rotated Sorted Array — Given a sorted array that has been rotated at an unknown pivot and a target value, return the index of the target in O(log n) time, or -1 if it is not present. Elements are distinct.

  2. Round 1: DSA Live Coding Round

    Phone · ~60 minutes · difficulty 3/5 · elimination round

    Mode of interview: Remote phone or video interview

    Sample question: Next Greater Element II — Given a circular integer array, for each element output the next greater element when scanning circularly to the right; output -1 if none exists.

  3. Round 2: Hiring Manager Round (Technical + Behavioral)

    Behavioral · ~60 minutes · difficulty 3/5

    Mode of interview: Live behavioral interview

  4. Round 3: HR Round

    Behavioral · ~15 minutes · difficulty 1/5

    Mode of interview: Live behavioral interview

SDE-2 (mid-level, ~3+ yrs)

Difficulty: Hard · Timeline: 3-5 weeks · Recommended prep: 8-12 weeks · Cooldown: ~6 months

  1. Round 0: Online Assessment

    Assessment · 60-90 minutes · difficulty 3/5 · elimination round

    Mode of interview: Online assessment · HackerRank

    Sample question: Merge k Sorted Lists — Given k sorted sequences, merge them into one sorted sequence in O(N log k). Read k, then for each list its length followed by its (ascending) elements; print the merged ascending sequence.

  2. Round 1: DSA Live Coding Round 1

    Phone · ~60 minutes · difficulty 3/5 · elimination round

    Mode of interview: Remote phone or video interview

    Sample question: Find Median from Data Stream — Design a structure over a stream of integers: after each insertion, report the median of all numbers seen so far in O(log n) per insert and O(1) per query. Read n then n integers; print the running median after each insertion.

  3. Round 2: DSA Live Coding Round 2

    Onsite · ~60 minutes · difficulty 4/5

    Mode of interview: Onsite or virtual onsite interview

    Sample question: Wiggle Sort II (Wave Array) — Reorder an array so it forms a wave: nums[0] <= nums[1] >= nums[2] <= nums[3] ... (alternation). Read n then n integers; print any valid wave ordering.

  4. Round 3: Machine Coding / Low-Level Design (LLD)

    System_design · ~90 minutes · difficulty 4/5

    Mode of interview: Live system design interview

    Sample question: Design a Parking Lot (LLD / Machine Coding) — Design a parking lot at both class level and DB level: model spots (by size), tickets, vehicles, and floors; support park(vehicle) -> assign nearest free slot, findSlotForVehicleNo, findAllSlotsForColor, findAllFreeSlots, and unpark with fee calculation. Apply SOLID principles; discuss the entity relationships, scaling, and how consistency is maintained across multiple entries/exits (CAP).

  5. Round 4: System Design (HLD) + Behavioral / Hiring Manager

    System_design · 60-90 minutes · difficulty 4/5

    Mode of interview: Live system design interview

    Sample question: Design a Scalable Notification System — Design a service that delivers push/SMS/email notifications at scale: user preferences, notification types/templates, fan-out, rate limiting, retries, deduplication, and a microservice decomposition. Discuss queueing and delivery guarantees.

SDE-3 / Senior Software Engineer (SSE)

Difficulty: Hard · Timeline: 3-5 weeks · Recommended prep: 10-14 weeks · Cooldown: No official cooldown published.

  1. Round 0: HackerRank Online Assessment

    Assessment · 90 minutes · difficulty 3/5 · elimination round

    Mode of interview: Online assessment · HackerRank

    Sample question: Reverse Nodes in k-Group — Given a linked list, reverse the nodes k at a time; nodes left over at the end (fewer than k) stay in original order. Read n, then n values, then k; print the resulting sequence.

  2. Round 1: DSA Round 1 (Onsite, whiteboard)

    Onsite · ~45-60 minutes · difficulty 3/5

    Mode of interview: Onsite or virtual onsite interview

    Sample question: First Missing Positive — Given an unsorted integer array, return the smallest missing positive integer in O(n) time and O(1) extra space. Read n then n integers; print the answer.

  3. Round 2: DSA + Tech Stack Deep Dive

    Onsite · ~60-75 minutes · difficulty 4/5

    Mode of interview: Onsite or virtual onsite interview

    Sample question: Longest Increasing Path in a Matrix — Given an m x n integer matrix, return the length of the longest strictly increasing path; you may move up/down/left/right (no diagonals, no wraparound). Read rows, cols, then the matrix; print the length.

  4. Round 3: System Design (HLD + LLD)

    System_design · 60-90 minutes · difficulty 4/5

    Mode of interview: Live system design interview

    Sample question: Design Twitter (News Feed + Top-K Tweets) — Design a Twitter-like service: post tweets, follow users, generate each user's home timeline/newsfeed, and retrieve the Top-K tweets globally by likes or recency. Discuss fan-out on write vs read, feed storage, caching, and the class/API model (Tweet, Feed, User) with follow-up trade-off justification.

  5. Round 4: Hiring Manager Round

    Behavioral · ~45-60 minutes · difficulty 3/5

    Mode of interview: Live behavioral interview

Other companies' interview processes

Worked sample solutions (code, design diagrams, and STAR answers) for every round are available in the FAANGPlus app: open interview processes.