Gojek Interview Questions — 5 DSA Problems

5 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Gojek LeetCode questions for software engineering interviews.

Binary Tree Level Order Traversal (MEDIUM) — Tree, Breadth-First Search, Binary Tree
Simplify Path (MEDIUM) — String, Stack
Sliding Window Maximum (HARD) — Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue
Convert an Array Into a 2D Array With Conditions (MEDIUM) — Array, Hash Table
3Sum (MEDIUM) — Array, Two Pointers, Sorting

Interview Prep/Companies/Gojek

G

Gojek

5 questions tracked5 with solutions

🔍

Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough

Showing 5 of 5 questions

1

MediumBinary Tree Level Order Traversal✓ Our Solution

100

TreeBreadth-First SearchBinary Tree

LeetCode ↗71% acc.

2

MediumSimplify Path✓ Our Solution

100

StringStack

LeetCode ↗48% acc.

3

HardSliding Window Maximum✓ Our Solution

100

ArrayQueueSliding WindowHeap (Priority Queue)+1

LeetCode ↗48% acc.

4

MediumConvert an Array Into a 2D Array With Conditions✓ Our Solution

90

ArrayHash Table

LeetCode ↗86% acc.

5

Medium3Sum✓ Our Solution

90

ArrayTwo PointersSorting

LeetCode ↗37% acc.