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.” The rest of the author's notes on Software Engineer interview at Akuna Capital, Online Assessment (OA) round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post