Question 1

Minimum Cost For Tickets — Grab Interview Question

Accepted Answer

"Minimum Cost For Tickets" is a medium difficulty problem asked at Grab interviews. It covers the following topics: Array, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/minimum-cost-for-tickets

Question 2

Adding Two Negabinary Numbers — Grab Interview Question

Accepted Answer

"Adding Two Negabinary Numbers" is a medium difficulty problem asked at Grab interviews. It covers the following topics: Array, Math. You can practice it on LeetCode: https://leetcode.com/problems/adding-two-negabinary-numbers

Question 3

Minimum Number of Food Buckets to Feed the Hamsters — Grab Interview Question

Accepted Answer

"Minimum Number of Food Buckets to Feed the Hamsters" is a medium difficulty problem asked at Grab interviews. It covers the following topics: String, Dynamic Programming, Greedy. You can practice it on LeetCode: https://leetcode.com/problems/minimum-number-of-food-buckets-to-feed-the-hamsters

Question 4

Reconstruct a 2-Row Binary Matrix — Grab Interview Question

Accepted Answer

"Reconstruct a 2-Row Binary Matrix" is a medium difficulty problem asked at Grab interviews. It covers the following topics: Array, Greedy, Matrix. You can practice it on LeetCode: https://leetcode.com/problems/reconstruct-a-2-row-binary-matrix

Question 5

Two Sum — Grab Interview Question

Accepted Answer

"Two Sum" is a easy difficulty problem asked at Grab interviews. It covers the following topics: Array, Hash Table. You can practice it on LeetCode: https://leetcode.com/problems/two-sum

Question 6

Longest Substring Without Repeating Characters — Grab Interview Question

Accepted Answer

"Longest Substring Without Repeating Characters" is a medium difficulty problem asked at Grab interviews. It covers the following topics: Hash Table, String, Sliding Window. You can practice it on LeetCode: https://leetcode.com/problems/longest-substring-without-repeating-characters

#	Question Title	Difficulty	Frequency	Topics
1	Minimum Cost For Tickets	MEDIUM	100.0	ArrayDynamic Programming
2	Adding Two Negabinary Numbers	MEDIUM	100.0	ArrayMath
3	Minimum Number of Food Buckets to Feed the Hamsters	MEDIUM	100.0	StringDynamic ProgrammingGreedy
4	Reconstruct a 2-Row Binary Matrix	MEDIUM	100.0	ArrayGreedyMatrix
5	Two Sum	EASY	78.1	ArrayHash Table
6	Longest Substring Without Repeating Characters	MEDIUM	71.3	Hash TableStringSliding Window
7	Longest Palindromic Substring	MEDIUM	71.3	Two PointersStringDynamic Programming
8	LRU Cache	MEDIUM	71.3	Hash TableLinked ListDesign+1
9	Search a 2D Matrix	MEDIUM	61.6	ArrayBinary SearchMatrix
10	Valid Parentheses	EASY	61.6	StringStack

Explore 450+ Companies

Companies

Grab

Want to see more?

Grab Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Grab

Want to see more?

Grab Interview Questions

Ai Assistant Kas