Grab coding interview
questions, leaked.
13 problems reported across recent Grab interviews. Top patterns: string, array, stack. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Grab's coding interview is almost entirely medium difficulty. You're looking at 11 medium problems across 13 total reports, which means there's no warm-up round. The distribution is brutal in a different way: strings and arrays dominate, each appearing in 6 problems. Hash tables, stacks, and dynamic programming all show up regularly. You'll face problems like Longest Substring Without Repeating Characters, LRU Cache, and Daily Temperatures back to back. If you hit a wall mid-assessment on a hash-table or DP problem, StealthCoder runs invisibly during screen share and surfaces a working solution in seconds while the proctor sees nothing.
Top problems at Grab
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimum Cost For Tickets | MEDIUM | 100.0 | 67% | Array · Dynamic Programming |
| 02 | Reconstruct a 2-Row Binary Matrix | MEDIUM | 100.0 | 48% | Array · Greedy · Matrix |
| 03 | Adding Two Negabinary Numbers | MEDIUM | 100.0 | 37% | Array · Math |
| 04 | Minimum Number of Food Buckets to Feed the Hamsters | MEDIUM | 100.0 | 47% | String · Dynamic Programming · Greedy |
| 05 | Two Sum | EASY | 78.1 | 56% | Array · Hash Table |
| 06 | Longest Substring Without Repeating Characters | MEDIUM | 71.3 | 37% | Hash Table · String · Sliding Window |
| 07 | LRU Cache | MEDIUM | 71.3 | 45% | Hash Table · Linked List · Design |
| 08 | Longest Palindromic Substring | MEDIUM | 71.3 | 36% | Two Pointers · String · Dynamic Programming |
| 09 | Number of Steps to Reduce a Number in Binary Representation to One | MEDIUM | 61.6 | 61% | String · Bit Manipulation · Simulation |
| 10 | Daily Temperatures | MEDIUM | 61.6 | 67% | Array · Stack · Monotonic Stack |
| 11 | Search a 2D Matrix | MEDIUM | 61.6 | 52% | Array · Binary Search · Matrix |
| 12 | Valid Parentheses | EASY | 61.6 | 42% | String · Stack |
| 13 | Simplify Path | MEDIUM | 61.6 | 48% | String · Stack |
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 Grab OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- string6 · 46%
- array6 · 46%
- stack3 · 23%
- hash table3 · 23%
- dynamic programming3 · 23%
- matrix2 · 15%
- greedy2 · 15%
- bit manipulation1 · 8%
- simulation1 · 8%
- monotonic stack1 · 8%
The string and array frequency is your first signal. Six problems each means you can't skip either one. But here's the real pattern: Grab stacks problems with data structures. Hash tables, stacks, and linked lists all appear in the same assessment. Daily Temperatures, LRU Cache, and Valid Parentheses test whether you can actually code under pressure, not just recognize the pattern. DP shows up three times, which matters because problems like Minimum Cost For Tickets and Longest Palindromic Substring require both setup time and mental clarity. The two easy problems (Two Sum, Valid Parentheses) are confidence checks; don't waste time grinding them. Instead, block out drilling time on the medium stack and hash-table problems. If you blank on an LRU Cache variant or a monotonic-stack edge case during the live assessment, StealthCoder is your hedge.
Companies with similar patterns
If you prepped for Grab, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Grab.
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 by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Grab interview FAQ
How many string problems should I drill before Grab's assessment?+
Six of the thirteen problems involve strings. Prioritize Longest Substring Without Repeating Characters and Longest Palindromic Substring first. They test sliding window and DP respectively. Then cover Simplify Path and the binary representation problem. You can't afford to skip string drills.
Is dynamic programming required to pass Grab's interview?+
DP appears in three problems: Minimum Cost For Tickets, Minimum Number of Food Buckets, and Longest Palindromic Substring. It's not optional. If you haven't solved DP problems under time pressure, start there now. The medium difficulty means the DP is straightforward but execution matters.
What data structure gives the most edge at Grab?+
Hash tables and stacks combined cover six problems. LRU Cache tests both hash tables and linked lists. Daily Temperatures and Simplify Path test stacks hard. If you can code a hash-table lookup from scratch and a monotonic stack in one go, you're ahead of most candidates.
Should I worry about hard problems for Grab?+
No. Zero hard problems reported across the data. Every problem is easy or medium. Focus your energy on executing medium problems cleanly rather than chasing complexity. Speed and correctness on mediums beats anything else.
How long should I spend on array problems?+
Arrays appear in six problems, often paired with other topics. Two Sum and Daily Temperatures are must-knows. Search a 2D Matrix and the binary matrix reconstruction are solid drills. Budget four to five hours on array variations. Then move to strings and hash tables.