Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso AKUNA CAPITAL
Colloquio
Was given a coding test via Hackerrank that had to be completed within 2 weeks. Had to answer 2 out of 3 questions in an hour. Did not make it past test phase of the interview process.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso AKUNA CAPITAL nel mese di set 2025
Colloquio
HackerRank Coding Test (3 problems, leetcode medium level), then Vidcruiter Test (need to verbally explain, serveral math, 5 min each), then Technical Phone Screen (normal brain teasers, probability etc.), then final round.
Domande di colloquio [1]
Domanda 1
Problem Analysis:
A k-star consists of a center node and up to k arms (edges to other nodes)
We need to find the k-star with maximum sum of all its nodes
For each potential center, we choose the best neighbors (up to k) to maximize sum
Algorithm:
Build an adjacency list from the edges
For each node as a potential center:
Get all its neighbors
Sort neighbors by their values (descending)
Select up to k best neighbors
Calculate sum: center + selected neighbors
Return the maximum sum found
Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso AKUNA CAPITAL nel mese di set 2025
Colloquio
the first step is a leetcode like challenge, easy to medium difficulties. for 2 hour, there is enough time for you to solve them. if you pass the test cases, the following is the video math OA
Ho sostenuto un colloquio presso AKUNA CAPITAL (Chicago, IL)
Colloquio
You will receive an automatic OA (HackerRank Coding Challenge). If you pass, you will have a 5-minute video-recorded interview. The topics will be linear algebra, brainteasers, combinatorics, and probability. Make sure you review theories in linear algebra.
Domande di colloquio [1]
Domanda 1
I got something similar to Leetcode's Maximum Subarray.