J'ai postulé en ligne. J'ai passé un entretien chez AKUNA CAPITAL
Entretien
I applied online and got an online assessment back about a week later. The OA is 3 problems over 2 hours. The three problems worth 10, 15, and 5 points respectively. I solved the first two but get TLE(time limit exceed on 3/9 test cases for the third problem) using my brute-force O(n^3) method. I thought about it after the OA and came up with one that takes O(n^2 logn). It has been a week after the OA but I still have not heard back from them yet.
Questions d'entretien [1]
Question 1
1.compare the value of two hands of cards. 2.maximum of the shortest path from a source to other nodes on a direct graph. 3.if there exist three collinear points in a list of points.
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.