Meesho coding interview
questions, leaked.
26 problems reported across recent Meesho interviews. Top patterns: array, dynamic programming, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Meesho's coding interview is heavy on arrays and dynamic programming. You're facing 26 problems across the dataset, but 10 are hard and 15 medium, so the bar is high. Arrays dominate with 17 problems, then DP with 9. You'll see XOR triplets, Next Permutation, subarray bounds, and island problems repeatedly. The good news: patterns compress. The hard news: you won't have time to drill all of them before the OA. If you blank mid-interview, StealthCoder runs invisibly and surfaces a working solution in seconds.
Top problems at Meesho
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Number of Unique XOR Triplets I | MEDIUM | 0.0 | 25% | Array · Math · Bit Manipulation |
| 02 | Number of Unique XOR Triplets II | MEDIUM | 0.0 | 29% | Array · Math · Bit Manipulation |
| 03 | Next Permutation | MEDIUM | 0.0 | 43% | Array · Two Pointers |
| 04 | Number of Ways to Form a Target String Given a Dictionary | HARD | 0.0 | 57% | Array · String · Dynamic Programming |
| 05 | Count Subarrays With Fixed Bounds | HARD | 0.0 | 69% | Array · Queue · Sliding Window |
| 06 | Minimum Edge Reversals So Every Node Is Reachable | HARD | 0.0 | 55% | Dynamic Programming · Depth-First Search · Breadth-First Search |
| 07 | Number of Strings Which Can Be Rearranged to Contain Substring | MEDIUM | 0.0 | 55% | Math · Dynamic Programming · Combinatorics |
| 08 | Making A Large Island | HARD | 0.0 | 55% | Array · Depth-First Search · Breadth-First Search |
| 09 | Delete and Earn | MEDIUM | 0.0 | 57% | Array · Hash Table · Dynamic Programming |
| 10 | Painting the Walls | HARD | 0.0 | 49% | Array · Dynamic Programming |
| 11 | Minimum Number of Taps to Open to Water a Garden | HARD | 0.0 | 51% | Array · Dynamic Programming · Greedy |
| 12 | Two Sum | EASY | 0.0 | 56% | Array · Hash Table |
| 13 | Subsequence With the Minimum Score | HARD | 0.0 | 33% | Two Pointers · String · Binary Search |
| 14 | Design Twitter | MEDIUM | 0.0 | 43% | Hash Table · Linked List · Design |
| 15 | Consecutive Numbers | MEDIUM | 0.0 | 46% | Database |
| 16 | Beautiful Arrangement | MEDIUM | 0.0 | 65% | Array · Dynamic Programming · Backtracking |
| 17 | Minimum Time to Complete Trips | MEDIUM | 0.0 | 39% | Array · Binary Search |
| 18 | Car Pooling | MEDIUM | 0.0 | 56% | Array · Sorting · Heap (Priority Queue) |
| 19 | Jump Game | MEDIUM | 0.0 | 39% | Array · Dynamic Programming · Greedy |
| 20 | Search Suggestions System | MEDIUM | 0.0 | 65% | Array · String · Binary Search |
| 21 | Find the Longest Equal Subarray | MEDIUM | 0.0 | 36% | Array · Hash Table · Binary Search |
| 22 | Longest Non-decreasing Subarray From Two Arrays | MEDIUM | 0.0 | 30% | Array · Dynamic Programming |
| 23 | Count Complete Substrings | HARD | 0.0 | 29% | Hash Table · String · Sliding Window |
| 24 | Number of Possible Sets of Closing Branches | HARD | 0.0 | 48% | Bit Manipulation · Graph · Heap (Priority Queue) |
| 25 | Minimum Degree of a Connected Trio in a Graph | HARD | 0.0 | 43% | Graph |
| 26 | Second Highest Salary | MEDIUM | 0.0 | 44% | Database |
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 Meesho OA. The proctor cannot see it. Screen share cannot detect it. Built by a senior engineer who knows the OA is theater. This is the script.
Get StealthCoder- array17 · 65%
- dynamic programming9 · 35%
- hash table5 · 19%
- bit manipulation4 · 15%
- string4 · 15%
- binary search4 · 15%
- heap priority queue4 · 15%
- math3 · 12%
- sliding window3 · 12%
- graph3 · 12%
Array problems are your foundation. 17 out of 26 total means every other problem touches arrays, and Meesho pairs them with DP and bit manipulation constantly. Next Permutation and XOR Triplets I and II show up in the top problems, which means they test core array manipulation and enumeration. Hard problems cluster around constraint-based arrays (Count Subarrays With Fixed Bounds, Making A Large Island) and DP (Painting the Walls, Minimum Number of Taps). Hash tables appear in 5 problems but never alone; they're tools within bigger patterns. Bit manipulation and sliding window each appear in 4 problems, so they're secondary. Drill arrays and DP first. Hash tables and binary search later. On the live OA, if you hit a hard DP problem and your recursion isn't flowing, StealthCoder is your hedge.
Companies with similar patterns
If you prepped for Meesho, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Meesho.
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. Built by a senior engineer who knows the OA is theater. This is the script. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Meesho interview FAQ
How many array problems should I solve before the Meesho interview?+
At least 12 to 15. Arrays touch 17 of 26 problems in their dataset, and they're the core of XOR Triplets, Next Permutation, and all the constraint-based subarrays. Start there. You won't have time for all 17, but hitting the top problems is non-negotiable.
Is dynamic programming required for Meesho?+
Yes. Nine problems rely on DP, and they're almost all hard: Painting the Walls, Minimum Number of Taps, Number of Ways to Form a Target String. DP pairs with arrays constantly here. Practice constraint-based DP and string DP. Hash-table or greedy DP shows up too.
Should I study bit manipulation before the interview?+
It matters but less than arrays and DP. Bit manipulation appears in 4 problems and dominates the XOR Triplets pair at the top. If you're comfortable with XOR operations and can enumerate subsets, you're safe. Save deep study time for arrays and DP first.
What's the difficulty split at Meesho?+
One easy, 15 medium, 10 hard. That's brutal. Two Sum is the only easy problem in their dataset. Expect your actual interview to mirror this. Most of your study time should go toward medium and hard patterns, not easy reps.
How should I prioritize the top problems?+
Start with XOR Triplets I and II, Next Permutation, and Two Sum to build array confidence. Then move to harder DP problems like Painting the Walls and Minimum Number of Taps. Making A Large Island tests DFS and union find together. Hit these before more obscure hash-table or graph problems.