J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 semaines. J'ai passé un entretien chez AKUNA CAPITAL (Chicago, IL) en nov. 2017
Entretien
Only made it through to the online coding portion of Hacker Rank (this is only one of 3 portions). There 4 problems in two and a half hours. Only solved 3 out of 4.
Questions d'entretien [1]
Question 1
There are N satellites that can deliver messages. Each satellite can only deliver messages to some subset of satellites. For each satellite that can send a message, each message has a delay in time. Given a starting satellite, that sends a message return the minimum time required for all the satellites to receive the message. If the message cannot be broadcasted to all satellites then return -1.
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.