Akuna Capital coding interview
questions, leaked.
23 problems reported across recent Akuna Capital interviews. Top patterns: array, depth first search, sorting. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Akuna Capital's coding assessment hits hard on arrays. Of their 23 problems, 16 lean on array manipulation, and the difficulty split is brutal: 10 hard, 10 medium, 3 easy. You're looking at problems like Minimum Initial Energy to Finish Tasks and Cherry Pickup that demand both greedy reasoning and dynamic programming chops. The good news: the patterns are predictable. The reality: you'll see depth-first search, sorting, hash tables, and DP chain together on live problems. If you blank mid-assessment, StealthCoder runs invisibly during screen share and surfaces a working solution in seconds.
Top problems at Akuna Capital
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimum Initial Energy to Finish Tasks | HARD | 100.0 | 59% | Array · Greedy · Sorting |
| 02 | Delete and Earn | MEDIUM | 100.0 | 57% | Array · Hash Table · Dynamic Programming |
| 03 | Network Delay Time | MEDIUM | 97.6 | 57% | Depth-First Search · Breadth-First Search · Graph |
| 04 | Dice Roll Simulation | HARD | 97.6 | 50% | Array · Dynamic Programming |
| 05 | Number of Different Subsequences GCDs | HARD | 97.6 | 42% | Array · Math · Counting |
| 06 | Reduce Array Size to The Half | MEDIUM | 97.6 | 69% | Array · Hash Table · Greedy |
| 07 | Create Sorted Array through Instructions | HARD | 97.6 | 40% | Array · Binary Search · Divide and Conquer |
| 08 | Minimum Number of Taps to Open to Water a Garden | HARD | 97.6 | 51% | Array · Dynamic Programming · Greedy |
| 09 | Cherry Pickup | HARD | 97.6 | 38% | Array · Dynamic Programming · Matrix |
| 10 | Constrained Subsequence Sum | HARD | 97.6 | 56% | Array · Dynamic Programming · Queue |
| 11 | Map Sum Pairs | MEDIUM | 97.6 | 57% | Hash Table · String · Design |
| 12 | Number of Operations to Make Network Connected | MEDIUM | 97.6 | 65% | Depth-First Search · Breadth-First Search · Union Find |
| 13 | Can Make Palindrome from Substring | MEDIUM | 97.6 | 40% | Array · Hash Table · String |
| 14 | Increasing Decreasing String | EASY | 97.6 | 77% | Hash Table · String · Counting |
| 15 | Count and Say | MEDIUM | 88.8 | 61% | String |
| 16 | Maximum Star Sum of a Graph | MEDIUM | 67.7 | 41% | Array · Greedy · Graph |
| 17 | Minimum Processing Time | MEDIUM | 67.7 | 69% | Array · Greedy · Sorting |
| 18 | Number of Islands | MEDIUM | 67.7 | 62% | Array · Depth-First Search · Breadth-First Search |
| 19 | Critical Connections in a Network | HARD | 57.7 | 58% | Depth-First Search · Graph · Biconnected Component |
| 20 | Sort Array by Increasing Frequency | EASY | 57.7 | 80% | Array · Hash Table · Sorting |
| 21 | Distance to a Cycle in Undirected Graph | HARD | 57.7 | 73% | Depth-First Search · Breadth-First Search · Union Find |
| 22 | Flood Fill | EASY | 57.7 | 66% | Array · Depth-First Search · Breadth-First Search |
| 23 | Maximum Profit in Job Scheduling | HARD | 57.7 | 54% | Array · Binary Search · Dynamic Programming |
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 Akuna Capital OA. The proctor cannot see it. Screen share cannot detect it. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoder- array16 · 70%
- depth first search6 · 26%
- sorting6 · 26%
- hash table6 · 26%
- dynamic programming6 · 26%
- graph5 · 22%
- greedy5 · 22%
- breadth first search5 · 22%
- string4 · 17%
- heap priority queue4 · 17%
Arrays dominate here more than at most firms. Sixteen of 23 problems touch array work, often paired with sorting, greedy, or DP. Depth-first search and hash tables tie at six problems each, followed closely by dynamic programming and sorting. This isn't a search-heavy shop; it's optimization-heavy. Greedy strategies show up constantly (Minimum Initial Energy, Reduce Array Size to The Half, Minimum Number of Taps). Start by drilling array sorting and greedy combinations, then lock down DP patterns on array subsequences and optimal substructure. Graph work is light (five problems), so don't sacrifice array fluency for graph prep. The hard problems cluster around DP with arrays and constraint optimization. When you hit the live assessment, StealthCoder is your hedge if a greedy choice or DP state transition doesn't click immediately.
Companies with similar patterns
If you prepped for Akuna Capital, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Akuna Capital.
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 for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Akuna Capital interview FAQ
Should I focus more on arrays or dynamic programming for Akuna?+
Arrays are non-negotiable. 16 of 23 problems touch arrays directly. But DP isn't separate: six problems combine array work with DP. Drill array sorting and greedy logic first, then DP on array subsequences. You can't skip either, but array fluency is the foundation.
How hard are Akuna's problems compared to other quantitative firms?+
43% of their problems are hard. Problems like Cherry Pickup and Constrained Subsequence Sum demand multi-step DP or greedy reasoning. Expect medium difficulty to require solid pattern recognition. If you've drilled LeetCode mediums, start practicing hard problems immediately.
Is graph knowledge critical for Akuna, or can I skip it?+
Graph problems are light: only five of 23. Union Find shows up in three, BFS and DFS in five each. Don't ignore it, but prioritize arrays and DP first. Graph knowledge is a bonus, not a gating skill here.
What's the fastest way to prepare if I have one week?+
Day one through three: nail array sorting and greedy (Minimum Initial Energy, Reduce Array Size). Days four through five: DP on arrays (Delete and Earn, Dice Roll Simulation). Days six through seven: graph problems and pattern mixing. Solve two hard problems a day minimum.
Will hash tables and strings slow me down during the assessment?+
Hash tables appear in six problems, strings in four. They're usually paired with arrays or greedy logic, not standalone. You don't need deep string algorithm knowledge. Hashtable fluency matters more, but it's secondary to array and DP work.