Skip to content

Interview Solver

FeaturesPricingHelp
Sign In
FeaturesPricingHelpSign In
  1. Interview Questions
  2. /
  3. Akuna Capital

Akuna Capital LeetCode Interview Questions

Practice 17 coding problems currently tagged to Akuna Capital. Use the frequency and topic signals to build a focused software engineering interview practice plan.

Last updated: September 28, 2026

1 Easy
8 Medium
8 Hard

Top Topics at Akuna Capital

ArrayHash TableDynamic ProgrammingStringGraph Theory

Ace your Akuna Capital interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

Akuna Capital Interview Problems

ProblemDifficultyDiffFrequencyTopicsAction
Can Make Palindrome from Substring
100%
MediumM
100%
ArrayHash Table+3
Solve→
Map Sum Pairs
97%
MediumM
97%
Hash TableString+2
Solve→
Delete and Earn
97%
MediumM
97%
ArrayHash Table+1
Solve→
Cherry Pickup
97%
HardH
97%
ArrayDynamic Programming+1
Solve→
Network Delay Time
97%
MediumM
97%
Depth-First SearchBreadth-First Search+4
Solve→
Create Sorted Array through Instructions
97%
HardH
97%
ArrayBinary Search+5
Solve→
Minimum Initial Energy to Finish Tasks
97%
HardH
97%
ArrayGreedy+1
Solve→
Constrained Subsequence Sum
97%
HardH
97%
ArrayDynamic Programming+4
Solve→
Dice Roll Simulation
97%
HardH
97%
ArrayDynamic Programming
Solve→
Number of Different Subsequences GCDs
97%
HardH
97%
ArrayMath+4
Solve→
Number of Operations to Make Network Connected
97%
MediumM
97%
Depth-First SearchBreadth-First Search+2
Solve→
Minimum Number of Taps to Open to Water a Garden
97%
HardH
97%
ArrayDynamic Programming+1
Solve→
Reduce Array Size to The Half
97%
MediumM
97%
ArrayHash Table+3
Solve→
Increasing Decreasing String
97%
EasyE
97%
Hash TableString+1
Solve→
Maximum Star Sum of a Graph
85.2%
MediumM
85.2%
ArrayGreedy+3
Solve→
Critical Connections in a Network
62.1%
HardH
62.1%
Depth-First SearchGraph Theory+2
Solve→
Shortest and Lexicographically Smallest Beautiful String
62.1%
MediumM
62.1%
StringSliding Window
Solve→

Similar Companies

Explore company practice sets with a similar number of tagged coding questions.

Activecampaign
17 problems
Alaska Airlines
17 problems
AMD
17 problems
Arcellx
17 problems
Blackrock
17 problems
Circleci
17 problems

Frequently Asked Questions

What LeetCode problems are tagged to Akuna Capital?

Our current Akuna Capital practice dataset contains 17 tagged coding problems, including Can Make Palindrome from Substring, Map Sum Pairs, Delete and Earn. The difficulty breakdown is 1 Easy, 8 Medium, and 8 Hard problems.

How should I prepare for a Akuna Capital coding interview?

Focus on the most frequently asked problems first, especially those with high frequency scores. Akuna Capital interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.

What is the difficulty level of Akuna Capital coding interviews?

Based on our data, Akuna Capital interviews include 1 Easy (6%), 8 Medium (47%), and 8 Hard (47%) problems.

Ready to ace your Akuna Capital interview?

Join thousands of engineers who landed offers at top tech companies.

Get Started Free

No credit card required

All CompaniesEasy ProblemsMedium ProblemsHard ProblemsBrowse by Topic
Interview Solver
  • Home
  • About
  • Pricing
  • Sign in
  • Contact
  • Blog
  • Companion
  • Help Center
  • Developers
  • Use Cases
  • Software Engineer
  • Product Manager
  • Misc
  • Privacy Policy
  • Terms and Conditions
  • Refund & Cancellation
  • Discord Community
  • Affiliate Program
  • Compare
  • All Comparisons
  • vs Final Round AI
  • vs UltraCode
  • vs Interview Coder
  • vs LockedIn AI
  • vs AI Apply
  • Free Tools
  • ATS Resume Checker
  • STAR Method Builder
  • Salary Lookup
  • Big O Cheat Sheet
  • Total Comp Calculator
  • View All →
  • Interview Questions
  • Google Questions
  • Amazon Questions
  • Microsoft Questions
  • Meta Questions
  • Apple Questions
  • TikTok Questions
  • View All →
© 2026 Interview Solver, Inc. All rights reserved.