myntra logo
Myntra· 6-Month SDE Internship

Myntra Ramp Up Interview Experience | 6-month SDE Internship | Selected

Posted
15 May 2026
131 reads

Summary

I went through the Myntra Ramp Up process for a 6‑month SDE internship, cleared the online assessment and two technical rounds, and was selected for the internship.

How it went

Recently went through the interview process for the 6-Month SDE Internship at Myntra through Myntra Ramp Up.

Process

  • OA (SmartHire on Unstop)
  • Technical Round 1
  • Technical Round 2

OA

Format

  • 15 MCQs
  • 2 Coding Questions

Difficulty: Easy-Medium to Medium

MCQ Topics

  • OOPs
  • DBMS
  • C++/Python fundamentals
  • Distributed Systems
  • GenAI/LLM basics

Coding Question 1

Largest Rectangle in Histogram variant.

Given:

  • building heights
  • integer M
  • remove exactly one building

Need maximum rectangle area ≤ M.

Concepts:

  • Monotonic Stack
  • Histogram Area

Technical Round 1

Question 1

Minimum swaps required to bring all elements <= K together.

Concepts:

  • Sliding Window
  • Counting bad elements

Question 2

Find the smallest number consisting only of 0 and 1 divisible by n.

Concepts:

  • BFS
  • Modular Arithmetic

Technical Round 2

Question 1

Minimum route reversals required so all warehouses can reach warehouse 0.

Concepts:

  • Graph Traversal
  • DFS/BFS
  • Edge Direction Tracking

Question 2

Server Cluster Load Balancer problem.

Given:

  • RAM usage
  • start time
  • end time

Determine whether RAM usage exceeds total capacity.

Concepts:

  • Difference Array
  • Prefix Sum
  • Sweep Line

There was also a short discussion on my resume and projects.


Overall Experience

  • Interviewers were friendly and discussion-oriented
  • Focus was mainly on:
    • problem-solving
    • optimization
    • communication
    • clarity of thought

Result

Selected for the 6-Month SDE Internship at Myntra.

Questions asked (5)

  1. 01

    Largest Rectangle in Histogram with One Removal

    Data Structures & Algorithms

    Given an array of building heights and an integer M, you may remove exactly one building. Find the maximum rectangle area that can be formed such that the area does not exceed M. The problem is a variant of the classic Largest Rectangle in Histogram and can be solved using a monotonic stack approach.

  2. 02

    Minimum Swaps to Group Elements ≤ K

    Data Structures & Algorithms

    Given an array of integers and a threshold K, determine the minimum number of swaps required to bring all elements less than or equal to K together in a contiguous subarray.

  3. 03

    Smallest Binary Multiple of n

    Data Structures & Algorithms

    Find the smallest positive integer that consists only of the digits 0 and 1 and is divisible by a given integer n. The solution typically uses BFS over the remainder space to build the number digit by digit.

  4. 04

    Minimum Edge Reversals to Reach Warehouse 0

    Data Structures & Algorithms

    In a directed graph representing warehouses and routes, compute the minimum number of edge reversals required so that every warehouse can reach warehouse 0.

  5. 05

    Server Cluster Load Balancer RAM Capacity Check

    Data Structures & Algorithms

    Given a list of server usage intervals with start time, end time, and RAM usage, determine whether at any point the total RAM usage exceeds the cluster's capacity. This can be solved using a difference array, prefix sum, or sweep line technique.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Myntra recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

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