Question 1

Delete and Earn — Akuna Capital Interview Question

Accepted Answer

"Delete and Earn" is a medium difficulty problem asked at Akuna Capital interviews. It covers the following topics: Array, Hash Table, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/delete-and-earn

Question 2

Minimum Initial Energy to Finish Tasks — Akuna Capital Interview Question

Accepted Answer

"Minimum Initial Energy to Finish Tasks" is a hard difficulty problem asked at Akuna Capital interviews. It covers the following topics: Array, Greedy, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks

Question 3

Dice Roll Simulation — Akuna Capital Interview Question

Accepted Answer

"Dice Roll Simulation" is a hard difficulty problem asked at Akuna Capital interviews. It covers the following topics: Array, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/dice-roll-simulation

Question 4

Number of Operations to Make Network Connected — Akuna Capital Interview Question

Accepted Answer

"Number of Operations to Make Network Connected" is a medium difficulty problem asked at Akuna Capital interviews. It covers the following topics: Depth-First Search, Breadth-First Search, Union Find, Graph. You can practice it on LeetCode: https://leetcode.com/problems/number-of-operations-to-make-network-connected

Question 5

Map Sum Pairs — Akuna Capital Interview Question

Accepted Answer

"Map Sum Pairs" is a medium difficulty problem asked at Akuna Capital interviews. It covers the following topics: Hash Table, String, Design, Trie. You can practice it on LeetCode: https://leetcode.com/problems/map-sum-pairs

Question 6

Increasing Decreasing String — Akuna Capital Interview Question

Accepted Answer

"Increasing Decreasing String" is a easy difficulty problem asked at Akuna Capital interviews. It covers the following topics: Hash Table, String, Counting. You can practice it on LeetCode: https://leetcode.com/problems/increasing-decreasing-string

#	Question Title	Difficulty	Frequency	Topics
1	Delete and Earn	MEDIUM	100.0	ArrayHash TableDynamic Programming
2	Minimum Initial Energy to Finish Tasks	HARD	100.0	ArrayGreedySorting
3	Dice Roll Simulation	HARD	97.6	ArrayDynamic Programming
4	Number of Operations to Make Network Connected	MEDIUM	97.6	Depth-First SearchBreadth-First SearchUnion Find+1
5	Map Sum Pairs	MEDIUM	97.6	Hash TableStringDesign+1
6	Increasing Decreasing String	EASY	97.6	Hash TableStringCounting
7	Cherry Pickup	HARD	97.6	ArrayDynamic ProgrammingMatrix
8	Network Delay Time	MEDIUM	97.6	Depth-First SearchBreadth-First SearchGraph+2
9	Create Sorted Array through Instructions	HARD	97.6	ArrayBinary SearchDivide and Conquer+4
10	Can Make Palindrome from Substring	MEDIUM	97.6	ArrayHash TableString+2

Explore 450+ Companies

Companies

Akuna Capital

Want to see more?

Akuna Capital Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Akuna Capital

Want to see more?

Akuna Capital Interview Questions

Ai Assistant Kas