QUESTIONS BY COMPANY

Akuna Capital LeetCode Questions 2026

Browse LeetCode problems frequently asked by Akuna Capital. Filter by difficulty and timeframe to focus your interview prep.

Last updated: 20 May 2026

Timeframe

Difficulty

Problem	Difficulty	Frequency	Topics
Map Sum Pairs	MEDIUM	100%	Hash TableStringDesignTrie
Delete and Earn	MEDIUM	100%	ArrayHash TableDynamic Programming
Cherry Pickup	HARD	100%	ArrayDynamic ProgrammingMatrix
Network Delay Time	MEDIUM	100%	Depth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)Shortest Path
Create Sorted Array through Instructions	HARD	100%	ArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered Set
Minimum Initial Energy to Finish Tasks	HARD	100%	ArrayGreedySorting
Can Make Palindrome from Substring	MEDIUM	100%	ArrayHash TableStringBit ManipulationPrefix Sum
Constrained Subsequence Sum	HARD	100%	ArrayDynamic ProgrammingQueueSliding WindowHeap (Priority Queue)Monotonic Queue
Dice Roll Simulation	HARD	100%	ArrayDynamic Programming
Number of Different Subsequences GCDs	HARD	100%	ArrayMathCountingNumber Theory
Number of Operations to Make Network Connected	MEDIUM	100%	Depth-First SearchBreadth-First SearchUnion-FindGraph Theory
Minimum Number of Taps to Open to Water a Garden	HARD	100%	ArrayDynamic ProgrammingGreedy
Reduce Array Size to The Half	MEDIUM	100%	ArrayHash TableGreedySortingHeap (Priority Queue)
Increasing Decreasing String	EASY	100%	Hash TableStringCounting
Maximum Star Sum of a Graph	MEDIUM	87.5%	ArrayGreedyGraph TheorySortingHeap (Priority Queue)
Critical Connections in a Network	HARD	62.5%	Depth-First SearchGraph TheoryBiconnected Component
LRU Cache	MEDIUM	62.5%	Hash TableLinked ListDesignDoubly-Linked List

Need Help Solving These Problems?

CodingInterviewAI can instantly identify algorithms and generate optimal solutions for any LeetCode problem. Get step-by-step explanations and ace your next technical interview.

See How It Works