How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Grab interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
G
Grab Coding Interview Questions
13 problems · 2 Easy, 11 Medium, 0 Hard · Ranked #119 of 458
Difficulty breakdown
2 Easy
15% · avg 23%
11 Medium
85% · avg 59%
0 Hard
0% · avg 18%
Top topics
array
46.2%
string
46.2%1.6x
dynamic-programming
23.1%
stack
23.1%2.7x
greedy
15.4%1.8x
matrix
15.4%1.7x
Interview profile
Based on 13 reported problems, Grab interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (85%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Grab puts unusual emphasis on stack (23.1% of problems, 2.7x the industry average), greedy (15.4% of problems, 1.8x the industry average), matrix (15.4% of problems, 1.7x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (46.2%), string (46.2%), dynamic-programming (23.1%), stack (23.1%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 13 problems
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Minimum Cost For Tickets You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an inte... | Medium | Very Likely | arraydynamic-programming | Solve |
Reconstruct a 2-Row Binary Matrix Given the following details of a matrix with n columns and 2 rows : | Medium | Very Likely | arraygreedymatrix | Solve |
Adding Two Negabinary Numbers Given two numbers arr1 and arr2 in base -2, return the result of adding them together. | Medium | Very Likely | arraymath | Solve |
Minimum Number of Food Buckets to Feed the Hamsters You are given a 0-indexed string hamsters where hamsters[i] is either: | Medium | Very Likely | stringdynamic-programminggreedy | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Very Likely | arrayhash-map | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Likely | hash-tablestringsliding-window | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Likely | two-pointersstringdynamic-programming | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. | Easy | Likely | stringstack | Solve |
Search a 2D Matrix You are given an m x n integer matrix matrix with the following two properties: | Medium | Likely | arraybinary-searchmatrix | Solve |
Number of Steps to Reduce a Number in Binary Representation to One Given the binary representation of an integer as a string s, return the number of steps to reduce it to 1 under the following rules: | Medium | Likely | stringbit-manipulationsimulation | Solve |
Daily Temperatures Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait aft... | Medium | Likely | arraystackmonotonic-stack | Solve |
Simplify Path You are given an absolute path for a Unix-style file system, which always begins with a slash '/'. Your task is to transform this absolute path into its simplif... | Medium | Likely | stringstack | Solve |
Minimum Cost For Tickets
SolveYou have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an inte...
MediumVery Likely
arraydynamic-programming
Reconstruct a 2-Row Binary Matrix
SolveGiven the following details of a matrix with n columns and 2 rows :
MediumVery Likely
arraygreedymatrix
Adding Two Negabinary Numbers
SolveGiven two numbers arr1 and arr2 in base -2, return the result of adding them together.
MediumVery Likely
arraymath
Minimum Number of Food Buckets to Feed the Hamsters
SolveYou are given a 0-indexed string hamsters where hamsters[i] is either:
MediumVery Likely
stringdynamic-programminggreedy
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
EasyVery Likely
arrayhash-map
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
MediumLikely
hash-tablestringsliding-window
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
MediumLikely
two-pointersstringdynamic-programming
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
MediumLikely
hash-tablelinked-listdesign
Valid Parentheses
SolveGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
EasyLikely
stringstack
Search a 2D Matrix
SolveYou are given an m x n integer matrix matrix with the following two properties:
MediumLikely
arraybinary-searchmatrix
Number of Steps to Reduce a Number in Binary Representation to One
SolveGiven the binary representation of an integer as a string s, return the number of steps to reduce it to 1 under the following rules:
MediumLikely
stringbit-manipulationsimulation
Daily Temperatures
SolveGiven an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait aft...
MediumLikely
arraystackmonotonic-stack
Simplify Path
SolveYou are given an absolute path for a Unix-style file system, which always begins with a slash '/'. Your task is to transform this absolute path into its simplif...
MediumLikely
stringstack
Preparing for your Grab coding interview
Grab interviews focus heavily on array, string, dynamic-programming problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Grab interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Frequently Asked Questions
What coding problems does Grab ask in interviews?add
Grab has been reported to ask 13 distinct coding problems. The most common topics are array, string, dynamic-programming. 2 are Easy difficulty, 11 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are Grab coding interviews?add
Based on 13 reported problems, Grab interviews are easier than average - only 0% Hard compared to 18% across all companies. 85% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a Grab coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, dynamic-programming. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Other companies to explore
Ready to ace your Grab interview?
Simulate a real Grab coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Grab interview with AIarrow_forward