Me postulé en línea. Acudí a una entrevista en AKUNA CAPITAL
Entrevista difícil
Solicitud
Acudí a una entrevista en AKUNA CAPITAL
Entrevista
OA contains 5 math problems. The phone interview is quite hard, about probability and algorithm. I think after the phone interview and there will be a virtual onsite as well. Unfortunately, I cannot pass the phone interview.
Preguntas de entrevista [1]
Pregunta 1
1. gamble game with 0.6 probability to win and choose the best policy; 2. there are n points on the plane and then find three points to form the largest angle.
The interview process involves a couple of online assessments and once you pass those there is the technical screen after the final interview. The technical screen involves probability, statistics questions that are quite hard - but which is expected for a quant researcher (greenbook like questions)
Preguntas de entrevista [1]
Pregunta 1
One question I parrticularly remember was to calculate EV of 2 games with a box in each. One game has a box with 100 notes that give +1 and a note that gives -100. The other game has a box with 100 notes that give -100 and a note that gives +100. You have to calculate EV of each game and choose which one to play and why
Me postulé en línea. Acudí a una entrevista en AKUNA CAPITAL en sep 2025
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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
Me postulé en línea. El proceso tomó 3 semanas. Acudí a una entrevista en AKUNA CAPITAL en sep 2025
Entrevista
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