Kakao coding interview
questions, leaked.
2 problems reported across recent Kakao interviews. Top patterns: array, breadth first search, matrix. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Kakao's online assessment is small but deceptive. Two problems. One medium, one hard. The medium problem looks like a brute-force enumeration puzzle but demands bit manipulation and backtracking to stay under time limits. The hard problem layers arrays, matrices, and BFS in a way that catches candidates who haven't practiced state-space search. You're being tested on pattern recognition and optimization, not breadth. StealthCoder's real value here is the invisible safety net if you blank on the backtracking structure mid-assessment.
Top problems at Kakao
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimum Moves to Reach Target with Rotations | HARD | 100.0 | 51% | Array · Breadth-First Search · Matrix |
| 02 | Maximum Points in an Archery Competition | MEDIUM | 100.0 | 50% | Array · Backtracking · Bit Manipulation |
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 Kakao OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop.
Get StealthCoder- array2 · 100%
- breadth first search1 · 50%
- matrix1 · 50%
- backtracking1 · 50%
- bit manipulation1 · 50%
- enumeration1 · 50%
Arrays dominate both problems, appearing in every submission. But the real test is hidden: one problem requires you to model the problem space as a bitmask and enumerate solutions efficiently, while the other forces you to think in 2D and navigate it with BFS. Candidates who drill basic array operations and skip bit manipulation tend to timeout on the medium problem. The hard problem punishes shallow BFS knowledge. Your prep should front-load backtracking and bit-enumeration patterns first, then lock in matrix-BFS traversal. If you hit the hard problem live and the state transitions aren't clicking, StealthCoder surfaces a working BFS skeleton in seconds, invisible to the proctor.
Companies with similar patterns
If you prepped for Kakao, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Kakao.
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. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Kakao interview FAQ
How much should I practice backtracking and bit manipulation for Kakao?+
Both are critical. The medium problem relies on backtracking with bitmask state representation. Without bit-enumeration fluency, you'll write slow nested loops. Drill 8 to 12 problems on bit-mask enumeration and backtracking combinations before your assessment.
Is BFS enough preparation for the hard problem?+
BFS is half the battle. The hard problem layers BFS on top of a 2D matrix with rotation constraints. You need to understand state modeling: how to represent position and orientation, how to track visited states in 2D plus dimension. Study rotation-aware BFS problems specifically, not just standard grid BFS.
Should I study array techniques first for Kakao?+
Arrays are the scaffolding, not the core challenge. Both problems use arrays, but the medium problem's bottleneck is bit manipulation and the hard problem's is BFS. Study arrays, then immediately move to backtracking and BFS. Arrays alone won't get you through either problem.
What's the fastest way to prepare for a hard matrix-BFS problem?+
Solve three recent matrix-BFS problems with rotation or multi-state constraints. Focus on state representation: how many dimensions, what makes two states different, when to mark visited. Understand the pattern before optimizing code. You don't have time to learn BFS during the assessment.
How many problems should I solve total before the Kakao assessment?+
Target 15 to 20 focused problems: 6 on bit-mask enumeration and backtracking, 5 on matrix-BFS with constraints, 4 on general array manipulation. Quality over count. Two problems in the assessment demand precision, not pattern-matching volume.