DSA Doctor
Verified Company Vault
Grab DSA Interview Questions
13 curated coding interview questions directly asked in Grab technical rounds, sorted by frequency with recency and difficulty diagnostics.
13
Total Questions
2 (15%)
Easy Problems
11 (85%)
Medium Problems
0 (0%)
Hard Problems
🔥 Most Tested Topics:
Arrays (6)Core DSA (3)Stack / Queue (1)Dynamic Programming (1)Design (1)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 721 | Accounts Merge | Medium | Arrays | Sorting / Prefix / Scan | 61.3% | 100.0% | 3m |
| 983 | Minimum Cost For Tickets | Medium | Arrays | Sorting / Prefix / Scan | 67.4% | 100.0% | all |
| 1073 | Adding Two Negabinary Numbers | Medium | Core DSA | Implementation / Reasoning | 37.9% | 100.0% | all |
| 2086 | Minimum Number of Food Buckets to Feed the Hamsters | Medium | Arrays | Sorting / Prefix / Scan | 48.4% | 100.0% | all |
| 1253 | Reconstruct a 2-Row Binary Matrix | Medium | Arrays | Sorting / Prefix / Scan | 49.0% | 100.0% | all |
| 71 | Simplify Path | Medium | Core DSA | Implementation / Reasoning | 50.6% | 75.0% | all |
| 739 | Daily Temperatures | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.7% | 75.0% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 75.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 62.5% | all |
| 1404 | Number of Steps to Reduce a Number in Binary Representation to One | Medium | Core DSA | Implementation / Reasoning | 63.7% | 62.5% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 62.5% | all |