Akuna Capital logo AC
Verified Company Vault

Akuna Capital DSA Interview Questions

17 curated coding interview questions directly asked in Akuna Capital technical rounds, sorted by frequency with recency and difficulty diagnostics.

17 Total Questions
1 (6%) Easy Problems
8 (47%) Medium Problems
8 (47%) Hard Problems
🔥 Most Tested Topics:
Arrays (7)Core DSA (4)Graphs (4)Strings (2)Trees (1)
📂 Sourced Datasets:
All questionsOlder than 6 months
Showing 17 of 17 displayed
IDProblemDifficultyTopicPatternAcceptanceFrequencyRecency
677Map Sum PairsMediumArraysSorting / Prefix / Scan57.2%100.0%all
740Delete and EarnMediumCore DSAImplementation / Reasoning57.2%100.0%all
741Cherry PickupHardCore DSAImplementation / Reasoning39.5%100.0%all
743Network Delay TimeMediumGraphsBFS / DFS / Topological Sort60.4%100.0%all
1649Create Sorted Array through InstructionsHardArraysSorting / Prefix / Scan41.8%100.0%all
1665Minimum Initial Energy to Finish TasksHardArraysSorting / Prefix / Scan76.4%100.0%all
1177Can Make Palindrome from SubstringMediumStrings; TreesHashing / Sliding Window; DFS / BFS41.7%100.0%all
1425Constrained Subsequence SumHardArraysSorting / Prefix / Scan56.4%100.0%all
1223Dice Roll SimulationHardCore DSAImplementation / Reasoning50.9%100.0%all
1819Number of Different Subsequences GCDsHardCore DSAImplementation / Reasoning45.3%100.0%all
1319Number of Operations to Make Network ConnectedMediumGraphsBFS / DFS / Topological Sort66.5%100.0%all
1326Minimum Number of Taps to Open to Water a GardenHardArraysSorting / Prefix / Scan51.0%100.0%all
1338Reduce Array Size to The HalfMediumArraysSorting / Prefix / Scan69.4%100.0%all
1370Increasing Decreasing StringEasyStringsHashing / Sliding Window77.3%100.0%all
2497Maximum Star Sum of a GraphMediumArrays; GraphsSorting / Prefix / Scan; BFS / DFS / Topological Sort42.4%87.5%all
1192Critical Connections in a NetworkHardGraphsBFS / DFS / Topological Sort59.7%62.5%all
146LRU CacheMediumDesignData Structure Design47.4%62.5%all