Akuna Capital interview notes, page 4 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·Data Scientist·Technical Phone Screen

Jul 2026

Interviewed for a Data Scientist role at Akuna Capital and got a graph algorithm problem that felt more like a software engineering screen than anything data science related. The question was well-defined but required you to actually know your BFS and sorting complexity, not just wave your hands at it.

Given an unweighted undirected city road network modeled as a graph, with a depot node and a set of delivery requests each having a priority and unique ID, design an algorithm to produce a service order sorted by shortest-hop distance from the depot, breaking ties by higher priority first and then by smaller ID. The solution should run in O(V+E + D log D). Explain correctness, handle unreachable nodes, and write pseudocode.

“This one took me a second to parse because there's a lot of text dressing up what is basically BFS plus a sort.”

View Post

Akuna Capital·Software Engineer·Take-home Assignment

Jul 2026

Akuna Capital gave me a React coding exercise for a hotel reservation UI, which sounds straightforward until you realize how many edge cases they actually want you to handle. It was a take-home style problem with a lot of moving parts crammed into one component.

You're given an existing React hotel reservation form. Add two controlled dropdown menus for Check-in and Check-out month, enforce that Check-out can't be earlier than Check-in, disable past months relative to today, wire everything into the provided state management, validate on change and submit with inline errors, handle keyboard accessibility with ARIA labels, and write unit tests for all of it.

“This is basically seven requirements in a trenchcoat.”

View Post

Akuna Capital·Software Engineer·Onsite - Multi Round

Jul 2026

Went through the full Akuna Capital C++ SWE process: an OA, a debugging assessment, and four technical rounds. Made it all the way through but got cut before the final round, mostly because the in-interview debugging was brutal for someone who primarily writes Java.

Implement or simulate a real-world scenario in C++ (non-LeetCode style coding problem from the OA).
Identify and fix multiple bugs in a provided C++ codebase within a 45-minute window.
Discuss C++ memory management: how it works, common pitfalls, and how you handle it in practice.
Explain multithreading and concurrency concepts in C++ and how you'd approach thread safety in a real system.
Walk through low-level performance optimizations in C++: what you'd look for and how you'd approach them.

“The OA problems were not the grind-LeetCode-mediums type.”

View Post

Akuna Capital·Software Engineer·Technical Phone Screen

Jul 2026

Akuna Capital had me fix a broken C++ object pool under concurrency constraints. The scope was bigger than I expected for a single interview question, covering thread safety, RAII, shutdown semantics, and ABA prevention all at once.

You're given a buggy C++ object pool implementation with race conditions, double-free risks, and resource leaks under concurrent borrow/return. Refactor it into a correct, thread-safe object pool template with blocking borrow (optional timeout), safe return with duplicate rejection, RAII scoped handle, and clean shutdown. Assume C++17.

“This one took me a minute to even scope properly.”

View Post

Akuna Capital·Data Scientist·Technical Phone Screen

Jul 2026

Akuna Capital data scientist interview with a meaty system design question about streaming statistics. The sliding window twist at the end is what actually tripped me up, not the basic version.

Design a data structure that tracks max, mean, and mode over an unbounded integer stream. Estimate its memory footprint assuming values fall between 1 and 1001. Then extend it to support a sliding window of the last k elements only.

“Started fine with the basic version.”

View Post

Akuna Capital·Data Scientist·Technical Phone Screen

Jul 2026

Interviewed for a Data Scientist role at Akuna Capital and got hit with a classic prefix sum problem that sounds easy until you actually have to explain the negative numbers case under pressure.

Given an integer array and an integer k, count the number of contiguous subarrays whose sum equals k. Solve it in O(n) time and O(n) space, explain why it handles negative numbers correctly, and walk through the complexity.

“I knew prefix sums going in but the negative numbers justification tripped me up more than I expected.”

View Post