Akuna Capital Coding Interview Questions
We track 17 coding questions asked at Akuna Capital, tagged with the algorithms and concepts they test. The most common: Array, Hash Table, Dynamic Programming, Graph Theory, Greedy.
Browse all 17 Akuna Capital questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array17.6%
- Dynamic Programming9.8%
- Hash Table9.2%
- Greedy6.3%
- Graph Theory5.8%
- Depth-First Search4.6%
- String4.6%
- Heap (Priority Queue)4.5%
- Sorting4.3%
- Counting3.4%
- Other (22)29.9%
How many questions involve each concept
Share of all 17 tracked Akuna Capital questions that touch each concept. Questions usually involve several, so these overlap.
- Array64.7%
- Hash Table35.3%
- Dynamic Programming29.4%
- Graph Theory23.5%
- Greedy23.5%
- Heap (Priority Queue)23.5%
- Depth-First Search17.6%
- Sorting17.6%
- String17.6%
- Breadth-First Search11.8%
- Counting11.8%
- Design11.8%
Where Akuna Capital differs from the average company
Concept weight at Akuna Capital relative to the average across all companies we track. Green means Akuna Capital leans on it harder than most.
- Graph Theory5.8×
- Counting3.4×
- Heap (Priority Queue)3.0×
- Design2.2×
- String0.48×
Akuna Capital specialties
Concepts that show up at Akuna Capital but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 17 tracked Akuna Capital questions.
- Junior6% (1)
- Mid/Senior47% (8)
- Staff47% (8)
Every concept in Akuna Capital interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 11 | 64.7% | 17.6% |
| Hash Table | 6 | 35.3% | 9.2% |
| Dynamic Programming | 5 | 29.4% | 9.8% |
| Graph Theory | 4 | 23.5% | 5.8% |
| Greedy | 4 | 23.5% | 6.3% |
| Heap (Priority Queue) | 4 | 23.5% | 4.5% |
| Depth-First Search | 3 | 17.6% | 4.6% |
| Sorting | 3 | 17.6% | 4.3% |
| String | 3 | 17.6% | 4.6% |
| Breadth-First Search | 2 | 11.8% | 2.6% |
| Counting | 2 | 11.8% | 3.4% |
| Design | 2 | 11.8% | 2.9% |
| Biconnected Component | 1 | 5.9% | 2.0% |
| Binary Indexed Tree | 1 | 5.9% | 0.8% |
| Binary Search | 1 | 5.9% | 0.8% |
| Bit Manipulation | 1 | 5.9% | 1.2% |
| Divide and Conquer | 1 | 5.9% | 0.8% |
| Doubly-Linked List | 1 | 5.9% | 1.5% |
| Linked List | 1 | 5.9% | 1.5% |
| Math | 1 | 5.9% | 1.5% |
| Matrix | 1 | 5.9% | 2.0% |
| Merge Sort | 1 | 5.9% | 0.8% |
| Monotonic Queue | 1 | 5.9% | 1.0% |
| Number Theory | 1 | 5.9% | 1.5% |
| Ordered Set | 1 | 5.9% | 0.8% |
| Prefix Sum | 1 | 5.9% | 1.2% |
| Queue | 1 | 5.9% | 1.0% |
| Segment Tree | 1 | 5.9% | 0.8% |
| Shortest Path | 1 | 5.9% | 1.2% |
| Sliding Window | 1 | 5.9% | 1.0% |
| Trie | 1 | 5.9% | 1.5% |
| Union-Find | 1 | 5.9% | 1.5% |
Practice a Akuna Capital interview
Take a realistic AI-led mock interview with questions Akuna Capital actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required