← Back to Directory

Akuna Capital

Mid-sized

Screna has 12 Akuna Capital interview write-ups. The most reported round is the technical phone screen (10).

12 interview notes · updated Jun 2026

Akuna Capital·Software Engineer·Technical Phone Screen

May 2026
Akuna Capital quant engineer interview, got a graph-based sorting problem that looked like a plain array question until you actually read it carefully. The duplicate handling is where things get interesting and where I suspect most people slip up.
  • Given an array of integers that may contain duplicates, find the minimum number of swaps needed to sort it in non-decreasing order.

“My first instinct was to just think about inversions and I was completely off base.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

May 2026
Akuna Capital software engineer interview with a pretty meaty C++ design question. The whole thing revolved around building a market-making quoter class from scratch, and the state machine complexity was way more involved than I expected going in.
  • Design and implement an InstrumentQuoter class in C++ that manages quoting a single instrument on a BBO market supporting only order insertion and deletion. The class must enforce a minimum price offset from a theoretical price, align prices to exchange tick size, avoid crossing the exchange BBO, and ensure no overlapping in-flight orders per side using a per-side state machine.

“This was a lot to hold in your head at once.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

May 2026
Akuna Capital software engineer interview that was basically one coding design problem: build a connection manager with custom exceptions. Pretty focused session, felt more like a mini systems exercise than a typical coding screen.
  • Design and implement a CommsHandler class that manages one-to-one connections between users, along with a custom ConnectionException. The class needs connect(userA, userB), hangup(user), and clear_all() methods, with proper error handling for invalid states like duplicate connections or self-connections.

“The hash map approach came to me pretty fast, user pointing to their partner.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

May 2026
Quant Engineer interview at Akuna Capital with a probability and betting math problem. Pretty focused on whether you can translate a clean formula into working code without tripping on edge cases.
  • Given a probability p (strictly between 0 and 1), compute the stake you need to wager so that a win yields exactly $1000 net profit, using fair decimal odds of 1/p. Return the result rounded to two decimal places, and handle invalid inputs appropriately.

“The math itself isn't bad once you work out that net profit equals stake times (1/p minus 1), so stake ends up being 1000p divided by (1 minus p).”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

Apr 2026
Akuna Capital coding screen focused on market data processing, specifically building a moving average system with a signal generator. Pretty systems-heavy for what felt like a standard technical phone screen.
  • Design and implement a system that computes a moving average over a stream of incoming market prices, and emits a trading signal whenever the moving average crosses a fixed threshold. Assume the window size and threshold are both fixed.

“The moving average part was fine, sliding window, nothing crazy.”

View Post

Akuna Capital·Software Engineer·Onsite - Coding / Algorithms

Apr 2026
Akuna Capital coding round, one meaty design problem about rate limiting for a trading engine. The problem looked clean on the surface but the sliding window edge cases took more thinking than I expected.
  • Design and implement a class that trading-engine clients can use to check whether they can send order messages without breaching a configurable message rate limit. The class should support a continuous sliding window (not fixed buckets), arbitrary limit configurations like 100 msgs per second or 500 per minute, batch sends, and you need to write test cases covering the main scenarios.

“The API signature they gave was basically RateLimit(maxMsgCount, windowMs) and a checkRateLimit(suggestOrders, timestamp) that returns how many messages are actually allowed.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

Apr 2026
Akuna Capital software engineering interview with a design-focused question that started simple and then got a lot more interesting in the follow-up. The memory optimization angle was the real test.
  • Design an Enemy factory for a multiplayer game that returns an enemy instance of a given color. Include both the factory class and the Enemy class hierarchy.

“The base question felt pretty approachable.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

Apr 2026
Akuna Capital SWE interview with a string deduplication problem that looks easy until you realize the anagram detection piece is the whole point. Pretty clean problem overall, felt like a LC medium with a twist on the output format.
  • 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 to track what I'd already seen.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

Apr 2026
Akuna Capital Data Engineer interview with a coding problem around portfolio rebalancing in Java. Pretty focused on clean implementation details rather than raw algorithmic complexity.
  • 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-order-preserving map.

“The core logic isn't hard but I spent a minute second-guessing whether to iterate over the target keys or union both key sets.”

View Post

Akuna Capital·Software Engineer·Online Assessment (OA)

Apr 2026
Graph problem for a Data Engineer role at Akuna Capital. Pretty straightforward OA setup, one coding question, Java solution submitted. Nothing too wild but the problem had some nuance if you weren't thinking carefully about connected components.
  • Given a set of nodes and an undirected edge list, build an adjacency list and find all connected components using BFS. For each component, compute the difference between the maximum and minimum node IDs, then return the largest such difference across all components.

“The BFS part wasn't the hard bit, that's muscle memory at this point.”

View Post