Akuna Capital Coding & Algorithms Interview Questions

If you're preparing for Akuna Capital Coding & Algorithms interview questions, expect a focused, time‑pressured evaluation that blends standard algorithmic problems with trading‑firm pragmatism. Akuna typically evaluates correctness, algorithmic efficiency, and readable implementation under time constraints, and interviewers pay close attention to edge‑case handling, testability, and how you communicate tradeoffs. For quant roles you may also see math or probability mixed into coding tasks; for software engineering roles there are occasional language‑specific or systems questions such as memory, STL, or class design. What to expect and how to prep: many candidates report an online assessment (HackerRank or similar) with two to four coding problems and some multiple‑choice or short analytical questions, followed by technical phone or onsite rounds that probe deeper into data structures, algorithms, and system concerns. Good interview preparation includes timed practice on array and string problems, solid command of your chosen language (Python or C++ are common), careful complexity analysis, and mock interviews that force you to explain your reasoning and test edge cases.

20 Questions 1 Company05.24.2026
Showing 20 results
Role
Akuna Capital logo
Akuna Capital
Hard
Software Engineer

Minimum Movement Cost to Segregate Binary Digits

Minimum Movement Cost to Segregate Binary Digits Given a binary string, repeatedly move a 1 to the right across adjacent 0 characters until all zeros ...

Coding & Algorithms
0
0
2 people solved
May 24, 2026
Akuna Capital logo
Akuna Capital
Hard
Software Engineer

Maximize Distinct Values with Cross-Array Swaps

Maximize Distinct Values with Cross-Array Swaps Given arrays a and b of equal length and an integer k, perform at most k swaps. Each swap chooses one ...

Coding & Algorithms
0
0
1 people solved
May 24, 2026
Akuna Capital logo
Akuna Capital
Medium
Data Scientist

Compute delivery order via BFS

Compute delivery order via BFS A city road network is an unweighted, undirected graph G(V, E) with a depot node s and D delivery requests located at n...

Coding & Algorithms
5
0
62 people solved
Aug 10, 2025
Akuna Capital logo
Akuna Capital
Hard
Data Scientist

Find minimum swaps to sort array with duplicates

Problem Given an integer array nums of length n that may contain duplicate values, you may perform swaps where you choose any two indices i and j and ...

Coding & Algorithms
7
0
143 people solved
Dec 27, 2025
Akuna Capital logo
Akuna Capital
Medium
Data Scientist

Design streaming stats with sliding window

Design streaming stats with sliding window Design a data structure that ingests an integer stream and supports online queries for maximum, mean, and m...

Coding & Algorithms
5
0
47 people solved
Aug 1, 2025
Akuna Capital logo
Akuna Capital
Medium
Software Engineer

Trace code and find frequent character

Trace code and find frequent character 1) Trace a simple algorithm: Given a short loop-and-conditional pseudo-code operating over an integer array, tr...

Coding & Algorithms
3
0
51 people solved
Aug 1, 2025
Akuna Capital logo
Akuna Capital
Medium
Data Scientist

Solve sliding window, graph top-k, and greedy tasks

You have three coding tasks. Task 1 — Sliding window on strings: Given a string s and an integer k, find one longest substring of s that contains at m...

Coding & Algorithms
3
0
44 people solved
Aug 12, 2025
Akuna Capital logo
Akuna Capital
Medium
Software Engineer

Compute max profit across dated stock quotes

You are given an unsorted list of price records for multiple stocks, each record as (date, symbol, price). Dates may be repeated across different symb...

Coding & Algorithms
17
0
133 people solved
Sep 6, 2025
Akuna Capital logo
Akuna Capital
Medium
Software Engineer

Heapify an array into a max-heap

Given the array [6, 15, 2, 4, 3, 8, 19], apply heapify to build a max-heap using the standard in-place bottom-up method with a 0-indexed array represe...

Coding & Algorithms
7
0
73 people solved
Sep 6, 2025
Akuna Capital logo
Akuna Capital
Medium
Software Engineer

Break a palindrome to smallest non-palindrome

Given a palindromic string s of lowercase English letters, change exactly one character to obtain a new string that is not a palindrome and is lexicog...

Coding & Algorithms
1
0
30 people solved
Sep 6, 2025
Akuna Capital logo
Akuna Capital
Medium
Software Engineer

Implement a ring buffer

Implement a fixed-capacity circular buffer (ring buffer) supporting push, pop, peek, isEmpty, isFull, and size in O( 1) time using an array. Define an...

Coding & Algorithms
11
0
96 people solved
Sep 6, 2025
Akuna Capital logo
Akuna Capital
Medium
Software Engineer

Solve three C++ algorithmic tasks

Solve three C++ algorithmic tasks Solve the following three C++ algorithmic tasks. For each, implement an efficient function and state time and space ...

Coding & Algorithms
4
0
56 people solved
Aug 10, 2025
Akuna Capital logo
Akuna Capital
Medium
Data Engineer Locked

Compute Graph Spread and Portfolio Trades

This question evaluates graph traversal and data-manipulation competencies, combining connected-component analysis on undirected graphs with map-based...

Coding & Algorithms
0
0
6 people solved
May 11, 2026
Akuna Capital logo
Akuna Capital
Medium
Software Engineer

Compute min operations to transform integers

Given integers A and B, transform A into B using the minimum number of operations. Allowed operations: ( 1) subtract 1 from the current value; ( 2) mu...

Coding & Algorithms
3
0
50 people solved
Sep 6, 2025
Akuna Capital logo
Akuna Capital
Medium
Software Engineer

Count inversions in an array efficiently

Given the array [5, 7, 9, 2, 3, 12, 8, 4], compute the number of inversion pairs (i, j) where i < j and arr[i] > arr[j]. Describe both a naive O(n^ 2)...

Coding & Algorithms
7
0
69 people solved
Sep 6, 2025
Akuna Capital logo
Akuna Capital
Medium
Software Engineer

Design two-user communications handler with exceptions

Implement a two-user communications handler. Create: (A) CommsHandler(CommsHandlerABC) with methods connect(self, user1: Caller, user2: Caller) -> str...

Coding & Algorithms
2
0
25 people solved
Aug 12, 2025
Akuna Capital logo
Akuna Capital
Medium
Data Scientist

Count subarrays equal to target

Count subarrays equal to target Given an integer array nums and an integer k, count the number of contiguous subarrays whose sum equals k. Solve it in...

Coding & Algorithms
2
0
36 people solved
Aug 10, 2025
Akuna Capital logo
Akuna Capital
Medium
Data Scientist

Maximize profitable pairs

Maximize profitable pairs You are given an array profits of n integers representing net profit per item and an integer threshold T. You may form disjo...

Coding & Algorithms
5
0
41 people solved
Aug 10, 2025
Akuna Capital logo
Akuna Capital
Medium
Software Engineer

Solve swaps, graph paths, and movie DP

Solve swaps, graph paths, and movie DP Design and implement solutions for three tasks derived from a HackerRank-style assessment. 1) Minimum swaps to ...

Coding & Algorithms
2
0
46 people solved
Aug 8, 2025
Akuna Capital logo
Akuna Capital
Medium
Data Scientist

Compute statistics in data stream

Question Design a data structure that supports computing the current max, mean, and mode for an unbounded integer data stream. Estimate the memory usa...

Coding & Algorithms
2
0
46 people solved
Aug 4, 2025

Frequently Asked Questions

How difficult are Akuna Capital Coding & Algorithms interviews?
Akuna Capital's Coding & Algorithms interviews are commonly rated medium-to-hard. Public reports and candidate experiences indicate online assessments often contain multiple LeetCode-style problems under strict time limits, while later rounds press for clean implementations, edge-case handling, and performance thinking. Interviewers evaluate algorithmic reasoning, correctness, and trade-offs between time and space. Difficulty can vary by team: quant tracks may include more combinatorics and math-heavy algorithm questions, while software tracks emphasize language specifics and system-aware algorithms. Expect interviewers to favor correctness first, then clarity and scalability.
What does the interview process look like and where does Coding & Algorithms appear?
Coding & Algorithms typically appears at multiple stages of Akuna Capital's hiring funnel. Many candidates start with a timed online assessment (HackerRank or similar) containing two to four algorithmic problems. Successful applicants move to technical phone screens that combine live coding and math or systems questions, followed by deeper technical interviews or virtual onsite rounds with pair programming and problem-solving under discussion. Quant roles may add a math or statistics assessment. Language preference is often Python or C++, and interviewers expect candidates to explain complexity, trade-offs, and test cases aloud.
How should I structure my preparation timeline for Akuna Capital Coding & Algorithms interviews?
Build a focused six to eight week plan to prepare effectively. Use the first one to two weeks to solidify fundamentals like arrays, strings, hashing, and algorithmic complexity. Spend the middle three weeks solving timed medium-to-hard problems across graphs, dynamic programming, recursion, and greedy approaches while reviewing core patterns. Reserve the final one to two weeks for full-length practice assessments, mock interviews with peers, and polishing language-specific idioms and debugging speed. In the last days, create a short checklist of edge cases and common pitfalls to run through before each interview.
What key subtopics should I master for Coding & Algorithms at Akuna Capital?
Concentrate on a tight set of high-yield subtopics: arrays and string manipulation, two-pointer and sliding-window techniques, hash maps and frequency counting, stacks and queues, sorting and selection algorithms, recursion and backtracking, dynamic programming patterns, and basic graph algorithms like BFS and DFS. Equally important are complexity analysis, space/time trade-offs, and language-specific tools such as C++ STL containers or Python collections. Practical skills—designing representative test cases, handling nulls and boundary conditions, and writing modular, readable code—are frequently assessed alongside raw algorithmic ability.
What standout tips and common pitfalls should I know for Coding & Algorithms interviews?
Start by implementing a correct, simple solution and then iterate toward optimizations; interviewers value a working approach more than an unfinished clever idea. Always state assumptions, walk through sample inputs, and test edge cases explicitly. Avoid overengineering, skipping complexity discussion, and neglecting boundary conditions or integer limits. Practice communicating trade-offs concisely and using your preferred language idioms. For online assessments, simulate the timed environment and refrain from pasting external solutions without verification. Rushing through tests without validating outputs is a frequent reason candidates fail to progress.

Explore more Akuna Capital Coding & Algorithms interview questions

Real questions from candidate reports, grouped by role, topic and company.

Coding & Algorithms questions at other companies
Browse all