Myntra coding interview
questions, leaked.
22 problems reported across recent Myntra interviews. Top patterns: array, sorting, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Myntra's assessment is array-heavy. Sixteen of twenty-two problems touch arrays, and sixteen are medium difficulty, meaning you'll face sustained pattern recognition under time pressure. The distribution is brutal: sorting, hash tables, and dynamic programming cluster around the same problems, so a single gap compounds. You're looking at two to three hours of focused drilling before the OA, then StealthCoder runs invisible during the live session as a safety net if you blank on a monotonic stack or two-pointer variant mid-problem.
Top problems at Myntra
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Maximum Earnings From Taxi | MEDIUM | 100.0 | 45% | Array · Hash Table · Binary Search |
| 02 | Asteroid Collision | MEDIUM | 76.1 | 46% | Array · Stack · Simulation |
| 03 | Deepest Leaves Sum | MEDIUM | 69.3 | 86% | Tree · Depth-First Search · Breadth-First Search |
| 04 | Container With Most Water | MEDIUM | 69.3 | 58% | Array · Two Pointers · Greedy |
| 05 | Rotting Oranges | MEDIUM | 69.3 | 57% | Array · Breadth-First Search · Matrix |
| 06 | Trapping Rain Water | HARD | 69.3 | 65% | Array · Two Pointers · Dynamic Programming |
| 07 | Largest Rectangle in Histogram | HARD | 69.3 | 47% | Array · Stack · Monotonic Stack |
| 08 | LRU Cache | MEDIUM | 69.3 | 45% | Hash Table · Linked List · Design |
| 09 | Largest Number | MEDIUM | 69.3 | 41% | Array · String · Greedy |
| 10 | Repeated Substring Pattern | EASY | 69.3 | 47% | String · String Matching |
| 11 | 3Sum | MEDIUM | 69.3 | 37% | Array · Two Pointers · Sorting |
| 12 | First Missing Positive | HARD | 69.3 | 41% | Array · Hash Table |
| 13 | Minimum Moves to Equal Array Elements II | MEDIUM | 59.7 | 61% | Array · Math · Sorting |
| 14 | Flatten Binary Tree to Linked List | MEDIUM | 59.7 | 69% | Linked List · Stack · Tree |
| 15 | Lowest Common Ancestor of a Binary Tree | MEDIUM | 59.7 | 67% | Tree · Depth-First Search · Binary Tree |
| 16 | Wiggle Sort | MEDIUM | 59.7 | 68% | Array · Greedy · Sorting |
| 17 | Maximal Square | MEDIUM | 59.7 | 49% | Array · Dynamic Programming · Matrix |
| 18 | Best Time to Buy and Sell Stock | EASY | 59.7 | 55% | Array · Dynamic Programming |
| 19 | Minimum Time to Collect All Apples in a Tree | MEDIUM | 59.7 | 63% | Hash Table · Tree · Depth-First Search |
| 20 | Group Anagrams | MEDIUM | 59.7 | 71% | Array · Hash Table · String |
| 21 | Two Sum | EASY | 59.7 | 56% | Array · Hash Table |
| 22 | Target Sum | MEDIUM | 59.7 | 51% | Array · Dynamic Programming · Backtracking |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Myntra OA. The proctor cannot see it. Screen share cannot detect it. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoder- array16 · 73%
- sorting6 · 27%
- hash table6 · 27%
- dynamic programming5 · 23%
- tree4 · 18%
- depth first search4 · 18%
- stack4 · 18%
- breadth first search3 · 14%
- binary tree3 · 14%
- two pointers3 · 14%
Arrays dominate this interview. Sorting appears in six problems, hash tables in six, and dynamic programming in five, but they're rarely standalone. Trapping Rain Water, Largest Rectangle in Histogram, and Maximum Earnings from Taxi are trap doors: they look like array problems but demand monotonic stacks or DP reasoning. Two-pointer work (Container with Most Water, 3Sum) is non-negotiable. Trees and DFS are secondary but cluster enough that you can't skip them. Greedy and string problems are noise. Drill array manipulation, sorting logic, and stack-based solutions first. If you hit a monotonic stack variant live and freeze, StealthCoder surfaces the pattern in seconds while the proctor sees nothing.
Companies with similar patterns
If you prepped for Myntra, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Myntra.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Myntra interview FAQ
How many array problems should I solve before the Myntra OA?+
At least eight to ten. Sixteen of twenty-two problems involve arrays, and most medium-difficulty ones chain multiple patterns together. Focus on Container with Most Water, 3Sum, and Trapping Rain Water. These three cover two-pointers, sorting, and stack logic. Don't skip them.
Is dynamic programming required for Myntra?+
Yes, but only specific variants. Five problems touch DP, and they cluster around optimization: Maximum Earnings from Taxi and Trapping Rain Water. Drill bottom-up DP and memoization for these two. Generic DP study won't help. You need pattern recognition on optimization problems.
What's harder: trees or sorting at Myntra?+
Sorting. Four tree problems appear, mostly DFS work. Sorting shows up in six problems, often combined with arrays or greedy reasoning. Master sorting comparators and two-pointer merges before tackling tree traversals. Sorting is the gating skill here.
Should I study hash tables before the OA?+
Yes, but only for specific use cases. Six problems use hash tables, but most pair them with arrays or sorting. LRU Cache is a design problem, not a hash-table drill. Study hash tables as a tool for deduplication and frequency counting, then move to harder patterns.
How do I prepare for medium-difficulty problems when most of Myntra is medium?+
Sixteen of twenty-two are medium. Practice chaining multiple topics: array plus sorting, array plus DP, array plus stack. Don't solve isolated problems. Solve Trapping Rain Water back-to-back with Largest Rectangle in Histogram. Pattern overlap is the real test.