Candidatei-me por meio de uma faculdade ou universidade. Fui entrevistado pela AKUNA CAPITAL (Chicago, IL) em fev. de 2021
Entrevista
Difficult interview, requires a lot of knowledge on your fingertips. Not only you have to ace the test cases, you also have to ensure optimal coding performance as well.
Likely questions: repeated digits, dynamic programming, and some sort of string manipulation or optimization problem. Algorithm proficiency heavily required.
Perguntas de entrevista [1]
Pergunta 1
They asked me how to find the repeated digits recursively given a series of numbers.
Dynamic programming with some sort of min problem.
String oscillation.
Candidatei-me online. Fui entrevistado pela AKUNA CAPITAL (Chicago, IL) em out. de 2023
Entrevista
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.
Perguntas de entrevista [2]
Pergunta 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.
Candidatei-me online. O processo levou 4 semanas. Fui entrevistado pela AKUNA CAPITAL (Chicago, IL) em set. de 2023
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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
Candidatei-me online. O processo levou 2 semanas. Fiz uma entrevista na empresa AKUNA CAPITAL (Sydney).
Entrevista
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!
Perguntas de entrevista [1]
Pergunta 1
Graph search question, shortest path from A->B according to a given time schedule.