← Back to Directory

Akuna Capital interview notes, page 2 of 4

Mid-sized

Most of these Akuna Capital write-ups come from Software Engineers (29), then Data Scientists (7). The most reported rounds are the technical phone screen (30), the online assessment (3), the onsite coding round (1) and the multi-round onsite (1).

36 interview notes · updated Jul 2026

Akuna Capital·Software Engineer·Technical Phone Screen

May 2026
Akuna Capital quant engineer interview had at least one math/probability problem that looked clean on the surface but had a few moving parts worth thinking through carefully.
  • Given a probability p for some event, treat 1/p as the fair decimal odds. What stake should you wager so that a win yields exactly $1000 in net profit? Handle edge cases where p is out of range.

“The math itself isn't bad once you write it out.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

May 2026
Interviewed for a software engineering role at Akuna Capital and got hit with a pretty involved algorithmic trading problem. The question had a lot of moving parts and felt more like a mini system design crossed with a classic DP problem than a straightforward coding question.
  • Given an unsorted list of (date, symbol, price) records for multiple stocks, design an algorithm to compute the maximum profit and a concrete trading plan. Constraints: hold at most one share at any time across all symbols, no same-day buy-and-sell, no short selling. Handle duplicate or missing dates. Return the max profit and the full sequence of trades with buy/sell dates, symbols, and prices. Prove correctness and analyze time and space complexity.

“This one had layers I did not anticipate.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

May 2026
Akuna Capital software engineer interview with a coding problem that looks simple on the surface but has a few layers worth thinking through. Pretty standard algo round vibe.
  • Given a list of strings, remove any string that is an anagram of a string appearing earlier in the list, then return the remaining strings in lexicographic order.

“My first instinct was to sort each string's characters and use that as a key in a set, which works fine.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

May 2026
Interviewed for a software engineering role at Akuna Capital and got a problem about transforming one integer into another with a limited set of operations. Pretty algorithmic, felt like a competitive programming warmup more than a standard interview question.
  • Given two integers A and B, find the minimum number of operations to transform A into B, where the only allowed operations are subtracting 1 from the current value or multiplying the current value by 2. Walk through your approach and time complexity for these cases: A=1,B=2; A=9,B=1; A=2,B=10; A=100,B=500.

“My first instinct was to go forward from A, which is a mess because multiplying by 2 can blow up fast and you end up with a huge search space.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

May 2026
Akuna Capital coding round, one problem the whole session. Algorithmic but not purely mechanical, they wanted the full explanation plus proof of correctness which I was not expecting.
  • You're given a palindromic string of lowercase letters. Change exactly one character so the result is not a palindrome and is lexicographically smallest among all valid options. Return an empty string if it's impossible. Walk through your algorithm, prove it's correct, and give time and space complexity. Code it up too.

“The base problem clicked pretty fast.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

May 2026
Coding screen for a software engineering role at Akuna Capital. The problem was an OOP design question around a two-user communication handler, which sounds straightforward until you actually start thinking through all the edge cases they want you to handle explicitly.
  • Implement a two-user communications handler. You need to write a CommsHandler class with connect, hangup, and clear_all methods, plus a custom CommunicationException. The handler should only allow one active pair at a time, raise exceptions when users try to connect with themselves or when the line is busy, and return specific formatted strings on success or disconnection.

“The class structure itself wasn't the hard part.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

May 2026
Akuna Capital data engineer interview with a coding problem around portfolio rebalancing. Pretty focused on Java and clean use of collections.
  • Given two portfolio objects each exposing a map of asset names to integer allocations, compute the per-asset difference (target minus current) and return the result in insertion-ordered fashion.

“The core trick here is not the math, it's remembering to use LinkedHashMap so you preserve the order from the target portfolio.”

View Post

Akuna Capital·Data Scientist·Online Assessment (OA)

May 2026
Three coding problems for a Data Scientist role at Akuna Capital. The questions leaned more algorithmic than I expected for a DS position, so if you're prepping for this, treat it like a SWE screen.
  • Given a string and an integer k, find the longest substring containing at most k distinct characters. Return the earliest start index and the length. Target O(n) time.
  • For each node in an undirected weighted graph, compute the sum of the top-k incident edge weights, counting only edges with positive weight. Return an array of these sums. Target O(m log k) time.
  • Given a binary array, count the number of pairs (i, j) with i < j where A[i]=1 and A[j]=0. This equals the minimum adjacent swaps to push all 1s to the right. Solve in O(n) time and O(1) space.

“Sliding window with a frequency map.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

May 2026
Akuna Capital software engineer interview with a pretty meaty algorithms question. The kind of problem where knowing the brute force isn't enough and they want to see if you can reason through the efficient solution too.
  • Given the array [5, 7, 9, 2, 3, 12, 8, 4], count the number of inversion pairs where an earlier element is greater than a later one. Walk through both a naive quadratic solution and an O(n log n) divide-and-conquer approach, and explain the complexity of each.

“The brute force part was fine, nested loops, check every pair, count when arr[i] > arr[j].”

View Post

Akuna Capital·Data Scientist·Technical Phone Screen

May 2026
Interviewed for a Data Scientist role at Akuna Capital and got hit with a sorting/swaps problem that looks deceptively simple until duplicates enter the picture. Algorithmic round, pretty focused on correctness and edge case handling.
  • Given an integer array that may contain duplicates, what is the minimum number of swaps needed to sort it in non-decreasing order? You can swap any two indices at any time.

“The duplicate part is what got me.”

View Post