Gojek coding interview
questions, leaked.
5 problems reported across recent Gojek interviews. Top patterns: array, tree, breadth first search. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Gojek's assessment is tight. Five problems across four medium and one hard, all pattern-heavy. Arrays dominate (three problems), so you'll see sliding windows, two-pointer manipulation, and hash-table lookups back to back. Tree traversal and stack-based string work fill the gaps. The hard problem, Sliding Window Maximum, combines queues with monotonic logic, which trips people up live. Study the array patterns first, but don't sleep on trees. If you blank mid-OA, StealthCoder runs invisible during the assessment and surfaces working code in seconds, keeping you moving.
Top problems at Gojek
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Binary Tree Level Order Traversal | MEDIUM | 100.0 | 71% | Tree · Breadth-First Search · Binary Tree |
| 02 | Simplify Path | MEDIUM | 100.0 | 48% | String · Stack |
| 03 | Sliding Window Maximum | HARD | 100.0 | 48% | Array · Queue · Sliding Window |
| 04 | Convert an Array Into a 2D Array With Conditions | MEDIUM | 89.9 | 86% | Array · Hash Table |
| 05 | 3Sum | MEDIUM | 89.9 | 37% | Array · Two Pointers · Sorting |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Gojek OA. The proctor cannot see it. Screen share cannot detect it. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoder- array3 · 60%
- tree1 · 20%
- breadth first search1 · 20%
- binary tree1 · 20%
- string1 · 20%
- stack1 · 20%
- queue1 · 20%
- sliding window1 · 20%
- heap priority queue1 · 20%
- monotonic queue1 · 20%
Arrays anchor this test. Three of five problems hinge on array mechanics: two-pointer scans (3Sum), hash tables for deduplication (Convert an Array Into a 2D Array), and the hard problem that chains sliding windows with monotonic queues. Binary Tree Level Order Traversal demands BFS intuition, while Simplify Path tests whether you can stack strings correctly under pressure. The gap between medium and hard is real. Most candidates prep 3Sum and level-order traversal, then hit Sliding Window Maximum cold and lose time on queue edge cases. Drill array patterns and two-pointer logic first. Trees second. When you sit down for the real assessment, if you freeze on monotonic-queue logic or hash-table collision handling, StealthCoder is your hedge, running silently alongside the proctor's screen.
Companies with similar patterns
If you prepped for Gojek, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Gojek.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Gojek interview FAQ
Should I spend more time on arrays or trees for Gojek?+
Arrays. Three of five problems use array patterns directly. 3Sum, Sliding Window Maximum, and Convert an Array Into a 2D Array all live in array-space. Trees show up once (Level Order Traversal). Spend 60 percent of your prep on array techniques, two-pointer scans, and hash-table lookups. Trees are the second block.
What's the hardest topic on Gojek's assessment?+
Sliding Window Maximum. It's the only hard problem and it chains four concepts: arrays, queues, sliding windows, and monotonic-queue logic. Most people know sliding windows but tank on monotonic deque implementation. Practice that pattern until it's automatic. The other four are medium and more forgiving.
Is stack experience critical for Gojek?+
Yes, but only for Simplify Path. One medium problem requires you to stack strings and handle edge cases cleanly. It's not hard, but if you've never done path-parsing, it'll cost time. Drill one or two stack-based string problems beforehand. Stack fundamentals matter here.
How many two-pointer problems should I solve before the assessment?+
3Sum is the main two-pointer problem on Gojek's list. Solve five to ten variants (move-zeros, container-with-most-water, trapping-rain-water) so the pattern is muscle memory. Two-pointer logic is clean once it clicks, but people rush it. Get comfortable sorting and tracking pointers simultaneously.
Will hash tables come up in a real Gojek interview?+
Yes. Convert an Array Into a 2D Array With Conditions uses hash tables for tracking state and deduplication. It's a medium problem, so prepare hash-table collision handling, multimap patterns, and iterating counts efficiently. One problem doesn't sound like much, but hash-table bugs are easy and costly under time pressure.