AKUNA CAPITAL interview questions

A couple of online assessments, followed by a phone interview (mostly technical questions i.e. probability and stats, mental math) and then a video interview (tougher questions than the phone screen, mix of technical and soft).

Applied for a Junior Python Developer internship at Akuna Capital in Sydney. First was a 2 hour HackerRank coding quiz with twelve questions on general computer science (hashmaps, tree traversals, memory stuff) then three questions on graph related problems that were reasonably easy. The next stage was a one-on-one technical phone screen where we were given a scaffold for a portfolio hierarchy structure and had to complete four functions. Seemed to be designed for a graph data structure. Given parent and child, add to graph; find root node in graph (node with no edges pointing in); find all duplicate nodes (more than one edge pointing in); find longest path from root node to any node (DFS/BFS related).