Problem database last updated: June 20, 2025
21 problems · 3 Easy, 15 Medium, 3 Hard · Ranked #89 of 458
3 Easy
14% · avg 23%
15 Medium
71% · avg 59%
3 Hard
14% · avg 18%
Based on 21 reported problems, Myntra interviews are in line with industry averages - 14% Hard vs 18% overall. The majority (71%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Myntra puts unusual emphasis on tree (19% of problems, 3.4x the industry average), monotonic-stack (9.5% of problems, 3.3x the industry average), binary-tree (14.3% of problems, 2.9x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (71.4%), hash-table (23.8%), dynamic-programming (23.8%), sorting (23.8%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Maximum Earnings From Taxi There are n points on a road you are driving your taxi on. The n points on the road are labeled from 1 to n in the direction you are going, and you want to driv... | Medium | Very Likely | arrayhash-tablebinary-search | Solve |
Asteroid Collision We are given an array asteroids of integers representing asteroids in a row. The indices of the asteroid in the array represent their relative position in space... | Medium | Very Likely | arraystacksimulation | Solve |
3Sum Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. | Medium | Likely | arraytwo-pointerssorting | Solve |
Deepest Leaves Sum Given the root of a binary tree, return the sum of values of its deepest leaves. | Medium | Likely | treedepth-first-searchbreadth-first-search | Solve |
Repeated Substring Pattern Given a string s, check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. | Easy | Likely | stringstring-matching | Solve |
Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. | Hard | Likely | arraytwo-pointersdynamic-programming | Solve |
First Missing Positive Given an unsorted integer array nums. Return the smallest positive integer that is not present in nums. | Hard | Likely | arrayhash-table | Solve |
Largest Rectangle in Histogram Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the his... | Hard | Likely | arraystackmonotonic-stack | Solve |
Largest Number Given a list of non-negative integers nums, arrange them such that they form the largest number and return it. | Medium | Likely | arraystringgreedy | Solve |
Container With Most Water You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). | Medium | Likely | arraytwo-pointersgreedy | Solve |
Rotting Oranges You are given an m x n grid where each cell can have one of three values: | Medium | Likely | arraybreadth-first-searchmatrix | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
Minimum Moves to Equal Array Elements II Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal. | Medium | Likely | arraymathsorting | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Likely | arraydynamic-programming | Solve |
Group Anagrams Given an array of strings strs, group the anagrams together. You can return the answer in any order. | Medium | Likely | arrayhash-tablestring | Solve |
Maximal Square Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area. | Medium | Likely | arraydynamic-programmingmatrix | Solve |
Flatten Binary Tree to Linked List Given the root of a binary tree, flatten the tree into a "linked list": | Medium | Likely | linked-liststacktree | Solve |
Lowest Common Ancestor of a Binary Tree Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. | Medium | Likely | treedepth-first-searchbinary-tree | Solve |
Minimum Time to Collect All Apples in a Tree Given an undirected tree consisting of n vertices numbered from 0 to n-1, which has some apples in their vertices. You spend 1 second to walk over one edge of t... | Medium | Likely | hash-tabletreedepth-first-search | Solve |
Target Sum You are given an integer array nums and an integer target. | Medium | Likely | arraydynamic-programmingbacktracking | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Likely | arrayhash-map | Solve |
Maximum Earnings From Taxi
SolveThere are n points on a road you are driving your taxi on. The n points on the road are labeled from 1 to n in the direction you are going, and you want to driv...
Asteroid Collision
SolveWe are given an array asteroids of integers representing asteroids in a row. The indices of the asteroid in the array represent their relative position in space...
3Sum
SolveGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Deepest Leaves Sum
SolveGiven the root of a binary tree, return the sum of values of its deepest leaves.
Repeated Substring Pattern
SolveGiven a string s, check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.
Trapping Rain Water
SolveGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
First Missing Positive
SolveGiven an unsorted integer array nums. Return the smallest positive integer that is not present in nums.
Largest Rectangle in Histogram
SolveGiven an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the his...
Largest Number
SolveGiven a list of non-negative integers nums, arrange them such that they form the largest number and return it.
Container With Most Water
SolveYou are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
Rotting Oranges
SolveYou are given an m x n grid where each cell can have one of three values:
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Minimum Moves to Equal Array Elements II
SolveGiven an integer array nums of size n, return the minimum number of moves required to make all array elements equal.
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
Group Anagrams
SolveGiven an array of strings strs, group the anagrams together. You can return the answer in any order.
Maximal Square
SolveGiven an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.
Flatten Binary Tree to Linked List
SolveGiven the root of a binary tree, flatten the tree into a "linked list":
Lowest Common Ancestor of a Binary Tree
SolveGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
Minimum Time to Collect All Apples in a Tree
SolveGiven an undirected tree consisting of n vertices numbered from 0 to n-1, which has some apples in their vertices. You spend 1 second to walk over one edge of t...
Target Sum
SolveYou are given an integer array nums and an integer target.
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Myntra interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Myntra interviews focus heavily on array, hash-table, dynamic-programming problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Myntra interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Myntra has been reported to ask 21 distinct coding problems. The most common topics are array, hash-table, dynamic-programming. 3 are Easy difficulty, 15 are Medium, and 3 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 21 reported problems, Myntra interviews are in line with industry averages - 14% Hard vs 18% overall. 71% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, hash-table, dynamic-programming. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Myntra coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Myntra interview with AIarrow_forward
