J'ai postulé en ligne. Le processus a pris 3 semaines. J'ai passé un entretien chez AKUNA CAPITAL en déc. 2019
Entretien
Multi-staged. First stage was a relatively manageable mental math test. Second stage was one of the most challenging coding challenges I've received for internship applications, with very algorithm-oriented problems.
There are supposed to be two-three stages following this, all of which are technical intwrviews. I was only able to make it to the interview that immediately followed, which was a technical interview focusing on recent math you have done. What would've followed was a coding-based technical phone interview.
Questions d'entretien [1]
Question 1
Find the eigenvalue and eigenvectors of a n by n matrix with all 1's.
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.
