Akuna Capital LeetCode Questions
16 questions all-time · 1 easy · 7 medium · 8 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Delete and Earn Array, Hash Table, Dynamic Programming | Medium | 100 | 0.6% |
| 2 | Can Make Palindrome from Substring Array, Hash Table, String, Bit Manipulation, Prefix Sum | Medium | 100 | 0.4% |
| 3 | Map Sum Pairs Hash Table, String, Design, Trie | Medium | 98 | 0.6% |
| 4 | Cherry Pickup Array, Dynamic Programming, Matrix | Hard | 98 | 0.4% |
| 5 | Network Delay Time Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 98 | 0.6% |
| 6 | Create Sorted Array through Instructions Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set | Hard | 98 | 0.4% |
| 7 | Minimum Initial Energy to Finish Tasks Array, Greedy, Sorting | Hard | 98 | 0.8% |
| 8 | Constrained Subsequence Sum Array, Dynamic Programming, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 98 | 0.6% |
| 9 | Dice Roll Simulation Array, Dynamic Programming | Hard | 98 | 0.5% |
| 10 | Number of Different Subsequences GCDs Array, Math, Counting, Number Theory | Hard | 98 | 0.5% |
| 11 | Number of Operations to Make Network Connected Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 98 | 0.7% |
| 12 | Minimum Number of Taps to Open to Water a Garden Array, Dynamic Programming, Greedy | Hard | 98 | 0.5% |
| 13 | Reduce Array Size to The Half Array, Hash Table, Greedy, Sorting, Heap (Priority Queue) | Medium | 98 | 0.7% |
| 14 | Increasing Decreasing String Hash Table, String, Counting | Easy | 98 | 0.8% |
| 15 | Maximum Star Sum of a Graph Array, Greedy, Graph Theory, Sorting, Heap (Priority Queue) | Medium | 85 | 0.4% |
| 16 | Critical Connections in a Network Depth-First Search, Graph Theory, Biconnected Component | Hard | 58 | 0.6% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.