Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso AKUNA CAPITAL (Chicago, IL) nel mese di mag 2016
Colloquio
After my resume was reviewed, I was sent a HackerRank challenge with six questions in three hours. These were to be answered using Python or C++. The problems were of increasing difficulty. The concepts I needed to know included stdin read, prime factorization, unbiased estimation of σ, matrix rotation, dice reroll expected value, and nested postfix-infix conversion.
A phone screen was later arranged.
Domande di colloquio [5]
Domanda 1
What is your experience with numerical programming?
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso AKUNA CAPITAL (Chicago, IL) nel mese di ott 2023
Colloquio
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.
Domande di colloquio [2]
Domanda 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.
Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso AKUNA CAPITAL (Chicago, IL) nel mese di set 2023
Colloquio
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.
Domande di colloquio [1]
Domanda 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
Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso AKUNA CAPITAL (Sydney)
Colloquio
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!
Domande di colloquio [1]
Domanda 1
Graph search question, shortest path from A->B according to a given time schedule.