Akuna Capital Interview Questions — 23 DSA Problems

22 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Akuna Capital LeetCode questions for software engineering interviews.

• Delete and Earn (MEDIUM) — Array, Hash Table, Dynamic Programming
• Minimum Initial Energy to Finish Tasks (HARD) — Array, Greedy, Sorting
• Dice Roll Simulation (HARD) — Array, Dynamic Programming
• Number of Operations to Make Network Connected (MEDIUM) — Depth-First Search, Breadth-First Search, Union Find, Graph
• Map Sum Pairs (MEDIUM) — Hash Table, String, Design, Trie
• Increasing Decreasing String (EASY) — Hash Table, String, Counting
• Cherry Pickup (HARD) — Array, Dynamic Programming, Matrix
• Network Delay Time (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Heap (Priority Queue), Shortest Path
• Create Sorted Array through Instructions (HARD) — Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
• Can Make Palindrome from Substring (MEDIUM) — Array, Hash Table, String, Bit Manipulation, Prefix Sum
• Constrained Subsequence Sum (HARD) — Array, Dynamic Programming, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue
• Reduce Array Size to The Half (MEDIUM) — Array, Hash Table, Greedy, Sorting, Heap (Priority Queue)
• Minimum Number of Taps to Open to Water a Garden (HARD) — Array, Dynamic Programming, Greedy
• Number of Different Subsequences GCDs (HARD) — Array, Math, Counting, Number Theory
• Count and Say (MEDIUM) — String
• Minimum Processing Time (MEDIUM) — Array, Greedy, Sorting
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Maximum Star Sum of a Graph (MEDIUM) — Array, Greedy, Graph, Sorting, Heap (Priority Queue)
• Distance to a Cycle in Undirected Graph (HARD) — Depth-First Search, Breadth-First Search, Union Find, Graph
• Flood Fill (EASY) — Array, Depth-First Search, Breadth-First Search, Matrix
• Sort Array by Increasing Frequency (EASY) — Array, Hash Table, Sorting
• Maximum Profit in Job Scheduling (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Critical Connections in a Network (HARD) — Depth-First Search, Graph, Biconnected Component