SlaveCode
.
Academy
Roadmap
Problems
System Design
More
Toggle theme (Current: Custom)
Companies
Companies
Akuna Capital Problems
Master the most frequently asked interview questions for this company.
ID
Title
Difficulty
Topics
740
Delete and Earn
Medium
Array
Hash Table
1665
Minimum Initial Energy to Finish Tasks
Hard
Array
Greedy
1223
Dice Roll Simulation
Hard
Array
Dynamic Programming
1319
Number of Operations to Make Network Connected
Medium
Depth-First Search
Breadth-First Search
677
Map Sum Pairs
Medium
Hash Table
String
1370
Increasing Decreasing String
Easy
Hash Table
String
741
Cherry Pickup
Hard
Array
Dynamic Programming
743
Network Delay Time
Medium
Depth-First Search
Breadth-First Search
1649
Create Sorted Array through Instructions
Hard
Array
Binary Search
1177
Can Make Palindrome from Substring
Medium
Array
Hash Table
1425
Constrained Subsequence Sum
Hard
Array
Dynamic Programming
1338
Reduce Array Size to The Half
Medium
Array
Hash Table
1326
Minimum Number of Taps to Open to Water a Garden
Hard
Array
Dynamic Programming
1819
Number of Different Subsequences GCDs
Hard
Array
Math
38
Count and Say
Medium
String
2895
Minimum Processing Time
Medium
Array
Greedy
200
Number of Islands
Medium
Array
Depth-First Search
2497
Maximum Star Sum of a Graph
Medium
Array
Greedy
2204
Distance to a Cycle in Undirected Graph
Hard
Depth-First Search
Breadth-First Search
733
Flood Fill
Easy
Array
Depth-First Search
1636
Sort Array by Increasing Frequency
Easy
Array
Hash Table
1235
Maximum Profit in Job Scheduling
Hard
Array
Binary Search
1192
Critical Connections in a Network
Hard
Depth-First Search
Graph
