DSA Doctor
Verified Company Vault
Meesho DSA Interview Questions
43 curated coding interview questions directly asked in Meesho technical rounds, sorted by frequency with recency and difficulty diagnostics.
43
Total Questions
4 (9%)
Easy Problems
21 (49%)
Medium Problems
18 (42%)
Hard Problems
🔥 Most Tested Topics:
Core DSA (16)Arrays (12)Trees (7)Strings (5)Design (2)
📂 Sourced Datasets:
Last 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 100.0% | 6m |
| 2930 | Number of Strings Which Can Be Rearranged to Contain Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 57.0% | 100.0% | all |
| 2959 | Number of Possible Sets of Closing Branches | Hard | Core DSA | Implementation / Reasoning | 51.0% | 100.0% | all |
| 2953 | Count Complete Substrings | Hard | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 30.4% | 100.0% | all |
| 3513 | Number of Unique XOR Triplets I | Medium | Core DSA | Implementation / Reasoning | 26.7% | 100.0% | all |
| 3514 | Number of Unique XOR Triplets II | Medium | Core DSA | Implementation / Reasoning | 32.6% | 100.0% | all |
| 197 | Rising Temperature | Easy | Core DSA | Implementation / Reasoning | 51.3% | 87.5% | all |
| 3709 | Design Exam Scores Tracker | Medium | Design | Data Structure Design | 44.2% | 87.5% | all |
| 3715 | Sum of Perfect Square Ancestors | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.7% | 87.5% | all |
| 1326 | Minimum Number of Taps to Open to Water a Garden | Hard | Arrays | Sorting / Prefix / Scan | 51.0% | 75.0% | all |
| 2742 | Painting the Walls | Hard | Core DSA | Implementation / Reasoning | 49.1% | 75.0% | all |
| 180 | Consecutive Numbers | Medium | Core DSA | Implementation / Reasoning | 48.4% | 75.0% | all |
| 2444 | Count Subarrays With Fixed Bounds | Hard | Arrays | Sorting / Prefix / Scan | 69.2% | 75.0% | all |
| 2187 | Minimum Time to Complete Trips | Medium | Arrays | Sorting / Prefix / Scan | 39.8% | 75.0% | all |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | Hard | Strings | Hashing / Sliding Window | 56.5% | 75.0% | all |
| 355 | Design Twitter | Medium | Design | Data Structure Design | 44.7% | 75.0% | all |
| 754 | Reach a Number | Medium | Core DSA | Implementation / Reasoning | 45.1% | 75.0% | all |
| 626 | Exchange Seats | Medium | Core DSA | Implementation / Reasoning | 74.2% | 75.0% | all |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 59.5% | 62.5% | all |
| 740 | Delete and Earn | Medium | Core DSA | Implementation / Reasoning | 57.2% | 62.5% | all |
| 2771 | Longest Non-decreasing Subarray From Two Arrays | Medium | Arrays | Sorting / Prefix / Scan | 31.2% | 62.5% | all |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 62.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |
| 1268 | Search Suggestions System | Medium | Binary Search | Binary Search | 65.2% | 62.5% | all |
| 176 | Second Highest Salary | Medium | Core DSA | Implementation / Reasoning | 47.0% | 62.5% | all |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 62.5% | all |
| 1944 | Number of Visible People in a Queue | Hard | Stack / Queue | Monotonic Stack / Simulation | 73.1% | 62.5% | all |
| 696 | Count Binary Substrings | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 70.4% | 62.5% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 62.5% | all |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 62.5% | all |
| 328 | Odd Even Linked List | Medium | Linked List | Two Pointers | 62.5% | 62.5% | all |
| 886 | Possible Bipartition | Medium | Dynamic Programming | State Transition | 52.6% | 62.5% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | all |
| 2603 | Collect Coins in a Tree | Hard | Trees; Dynamic Programming | DFS / BFS; State Transition | 40.1% | 62.5% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 62.5% | all |
| 805 | Split Array With Same Average | Hard | Arrays | Sorting / Prefix / Scan | 27.0% | 62.5% | all |
| 584 | Find Customer Referee | Easy | Core DSA | Implementation / Reasoning | 72.9% | 62.5% | all |
| 2751 | Robot Collisions | Hard | Core DSA | Implementation / Reasoning | 61.6% | 62.5% | all |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 62.5% | all |
| 587 | Erect the Fence | Hard | Core DSA | Implementation / Reasoning | 53.0% | 62.5% | all |
| 149 | Max Points on a Line | Hard | Core DSA | Implementation / Reasoning | 30.7% | 62.5% | all |
| 115 | Distinct Subsequences | Hard | Core DSA | Implementation / Reasoning | 51.9% | 62.5% | all |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 62.5% | all |