J'ai postulé en ligne. Le processus a pris 3 semaines. J'ai passé un entretien chez AKUNA CAPITAL (San Diego, CA) en janv. 2018
Entretien
overall exciting experience. I think I was lucky to pass the coding round since I only was only self-taught, and picked up quantitative finance in less than half a year as a 2nd major in college. The interview shined lights on what topics I need to study more about. Although the interview was very monotone and short sighted, since it was pretty structural as she was just reading out listed questions one by one, rather than actually get to know me.
Questions d'entretien [1]
Question 1
What is time complexity in Python? What is multiple inheritance? Can you explain this? etc
J'ai postulé en ligne. J'ai passé un entretien chez AKUNA CAPITAL (Chicago, IL) en oct. 2023
Entretien
One coding OA, one math video OA, and then phone interview. The phone interview also has a coding test and a math test. They both are not really hard, but I felt nervous and stuttered a little.
Questions d'entretien [2]
Question 1
Design a class that can handle streaming prices data and implement function for get the top 5 prices and the other function for the most frequest price.
J'ai postulé en ligne. Le processus a pris 4 semaines. J'ai passé un entretien chez AKUNA CAPITAL (Chicago, IL) en sept. 2023
Entretien
The first round is OA, including 3 coding questions. We need to complete them in 1 hour. After that, I received online math test on Easyhire, which requires interviewers to answers questions with webcam.
Questions d'entretien [1]
Question 1
How many ways are there to place the digits 0-9 in a sequence such that each digit is either an integer multiple of each of its neighbors or a divisor of each of its neighbors
J'ai postulé en ligne. Le processus a pris 2 semaines. J'ai passé un entretien chez AKUNA CAPITAL (Sydney)
Entretien
It was a technical coding interview with data structure and algorithms related questions. The interviewer was friendly and offered tips if you were on the right track to a solution!
Questions d'entretien [1]
Question 1
Graph search question, shortest path from A->B according to a given time schedule.