Skip to content

Akuna Capital interview questions

The most frequent LeetCode problems tagged to Akuna Capital. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.

Based on 0 distinct problems tagged to Akuna Capital in the last 6 months (0 in the last 30 days, 0 in the last 3 months, 17 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.

Most frequent problems

Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.

# Problem Difficulty Last seen Topics
1 Can Make Palindrome from Substring Medium Older Array, Hash Table, String, Bit Manipulation
2 Cherry Pickup Hard Older Array, Dynamic Programming, Matrix
3 Constrained Subsequence Sum Hard Older Array, Dynamic Programming, Queue, Sliding Window
4 Create Sorted Array through Instructions Hard Older Array, Binary Search, Divide and Conquer, Binary Indexed Tree
5 Delete and Earn Medium Older Array, Hash Table, Dynamic Programming
6 Dice Roll Simulation Hard Older Array, Dynamic Programming
7 Increasing Decreasing String Easy Older Hash Table, String, Counting
8 Map Sum Pairs Medium Older Hash Table, String, Design, Trie
9 Minimum Initial Energy to Finish Tasks Hard Older Array, Greedy, Sorting
10 Minimum Number of Taps to Open to Water a Garden Hard Older Array, Dynamic Programming, Greedy
11 Network Delay Time Medium Older Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue)
12 Number of Different Subsequences GCDs Hard Older Array, Math, Counting, Number Theory
13 Number of Operations to Make Network Connected Medium Older Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
14 Reduce Array Size to The Half Medium Older Array, Hash Table, Greedy, Sorting
15 Maximum Star Sum of a Graph Medium Older Array, Greedy, Graph Theory, Sorting
16 Critical Connections in a Network Hard Older Depth-First Search, Graph Theory, Biconnected Component, Bridge (Graph)
17 Shortest and Lexicographically Smallest Beautiful String Medium Older String, Sliding Window

Sources

Next: More companies