How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Gojek interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
G
Gojek Coding Interview Questions
5 problems · 0 Easy, 4 Medium, 1 Hard · Ranked #244 of 458
Difficulty breakdown
0 Easy
0% · avg 23%
4 Medium
80% · avg 59%
1 Hard
20% · avg 18%
Top topics
array
60%
string
20%
stack
20%2.3x
tree
20%3.6x
breadth-first-search
20%2.4x
binary-tree
20%4.1x
Interview profile
Based on 5 reported problems, Gojek interviews are in line with industry averages - 20% Hard vs 18% overall. The majority (80%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
The most common topics are array (60%), string (20%), stack (20%), tree (20%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 5 problems
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Simplify Path You are given an absolute path for a Unix-style file system, which always begins with a slash '/'. Your task is to transform this absolute path into its simplif... | Medium | Very Likely | stringstack | Solve |
Binary Tree Level Order Traversal Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). | Medium | Very Likely | treebreadth-first-searchbinary-tree | Solve |
Sliding Window Maximum You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see... | Hard | Very Likely | arrayqueuesliding-window | Solve |
3Sum Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. | Medium | Very Likely | arraytwo-pointerssorting | Solve |
Convert an Array Into a 2D Array With Conditions You are given an integer array nums. You need to create a 2D array from nums satisfying the following conditions: | Medium | Very Likely | arrayhash-table | Solve |
Simplify Path
SolveYou are given an absolute path for a Unix-style file system, which always begins with a slash '/'. Your task is to transform this absolute path into its simplif...
MediumVery Likely
stringstack
Binary Tree Level Order Traversal
SolveGiven the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).
MediumVery Likely
treebreadth-first-searchbinary-tree
Sliding Window Maximum
SolveYou are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...
HardVery Likely
arrayqueuesliding-window
3Sum
SolveGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
MediumVery Likely
arraytwo-pointerssorting
Convert an Array Into a 2D Array With Conditions
SolveYou are given an integer array nums. You need to create a 2D array from nums satisfying the following conditions:
MediumVery Likely
arrayhash-table
Preparing for your Gojek coding interview
Gojek interviews focus heavily on array, string, stack problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Gojek interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Frequently Asked Questions
What coding problems does Gojek ask in interviews?add
Gojek has been reported to ask 5 distinct coding problems. The most common topics are array, string, stack. 0 are Easy difficulty, 4 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are Gojek coding interviews?add
Based on 5 reported problems, Gojek interviews are in line with industry averages - 20% Hard vs 18% overall. 80% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a Gojek coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, stack. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Other companies to explore
Ready to ace your Gojek interview?
Simulate a real Gojek coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Gojek interview with AIarrow_forward