Grab Coding Interview Questions
25 Grab coding interview problems with full optimal solutions — 13 easy, 9 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Grab interviewer values, and a FAQ section.
Showing 3 problems of 25
- #23hardfoundational
23. Median of Two Sorted Arrays
Find the median of two sorted arrays in O(log) time — Grab uses this as a binary-search-on-answer signal.
- #24hardfoundational
24. Trapping Rain Water
Compute how much water an elevation map traps — Grab uses this as a two-pointer optimization signal.
- #25hardfoundational
25. Merge k Sorted Lists
Merge k sorted linked lists into one — Grab uses this to test heap + divide-conquer fluency.