AC

Akuna Capital

23 questions tracked22 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 23 of 23 questions

1
MediumDelete and Earnβœ“ Our Solution
100
ArrayHash TableDynamic Programming
2
HardMinimum Initial Energy to Finish Tasksβœ“ Our Solution
100
ArrayGreedySorting
3
HardDice Roll Simulationβœ“ Our Solution
98
ArrayDynamic Programming
4
MediumNumber of Operations to Make Network Connectedβœ“ Our Solution
98
Depth-First SearchBreadth-First SearchUnion FindGraph
5
MediumMap Sum Pairsβœ“ Our Solution
98
Hash TableStringDesignTrie
6
EasyIncreasing Decreasing Stringβœ“ Our Solution
98
Hash TableStringCounting
7
HardCherry Pickupβœ“ Our Solution
98
ArrayDynamic ProgrammingMatrix
8
MediumNetwork Delay Timeβœ“ Our Solution
98
Depth-First SearchBreadth-First SearchGraphHeap (Priority Queue)+1
9
HardCreate Sorted Array through Instructionsβœ“ Our Solution
98
ArrayBinary SearchDivide and ConquerBinary Indexed Tree+3
10
MediumCan Make Palindrome from Substringβœ“ Our Solution
98
ArrayHash TableStringBit Manipulation+1
11
HardConstrained Subsequence Sumβœ“ Our Solution
98
ArrayDynamic ProgrammingQueueSliding Window+2
12
MediumReduce Array Size to The Halfβœ“ Our Solution
98
ArrayHash TableGreedySorting+1
13
HardMinimum Number of Taps to Open to Water a Gardenβœ“ Our Solution
98
ArrayDynamic ProgrammingGreedy
14
HardNumber of Different Subsequences GCDsβœ“ Our Solution
98
ArrayMathCountingNumber Theory
15
MediumCount and Sayβœ“ Our Solution
89
String
16
MediumMinimum Processing Timeβœ“ Our Solution
68
ArrayGreedySorting
17
MediumNumber of Islandsβœ“ Our Solution
68
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
18
MediumMaximum Star Sum of a Graphβœ“ Our Solution
68
ArrayGreedyGraphSorting+1
19
HardDistance to a Cycle in Undirected Graph
58
Depth-First SearchBreadth-First SearchUnion FindGraph
20
EasyFlood Fillβœ“ Our Solution
58
ArrayDepth-First SearchBreadth-First SearchMatrix
21
EasySort Array by Increasing Frequencyβœ“ Our Solution
58
ArrayHash TableSorting
22
HardMaximum Profit in Job Schedulingβœ“ Our Solution
58
ArrayBinary SearchDynamic ProgrammingSorting
23
HardCritical Connections in a Networkβœ“ Our Solution
58
Depth-First SearchGraphBiconnected Component