Grab Interview Questions — 13 DSA Problems
13 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Grab LeetCode questions for software engineering interviews.
- Minimum Cost For Tickets (MEDIUM) — Array, Dynamic Programming
- Adding Two Negabinary Numbers (MEDIUM) — Array, Math
- Minimum Number of Food Buckets to Feed the Hamsters (MEDIUM) — String, Dynamic Programming, Greedy
- Reconstruct a 2-Row Binary Matrix (MEDIUM) — Array, Greedy, Matrix
- Two Sum (EASY) — Array, Hash Table
- Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
- Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
- LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
- Search a 2D Matrix (MEDIUM) — Array, Binary Search, Matrix
- Valid Parentheses (EASY) — String, Stack
- Simplify Path (MEDIUM) — String, Stack
- Daily Temperatures (MEDIUM) — Array, Stack, Monotonic Stack
- Number of Steps to Reduce a Number in Binary Representation to One (MEDIUM) — String, Bit Manipulation, Simulation
G
Grab
13 questions tracked13 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 13 of 13 questions
3MediumMinimum Number of Food Buckets to Feed the Hamsters✓ Our Solution StringDynamic ProgrammingGreedy
6Hash TableStringSliding Window
7Two PointersStringDynamic Programming
8Hash TableLinked ListDesignDoubly-Linked List
12ArrayStackMonotonic Stack
13MediumNumber of Steps to Reduce a Number in Binary Representation to One✓ Our Solution StringBit ManipulationSimulation