J'ai postulé en ligne. Le processus a pris 2 semaines. J'ai passé un entretien chez AKUNA CAPITAL (Chicago, IL) en févr. 2019
Entretien
I received an OA including three coding problems and 17 multiple choices problems including basic knowledge of C++. The questions are quite hard and the time limit is quite short. I didn't pass all the testcases of the last question.
Questions d'entretien [1]
Question 1
Given a set of numbers and a k. Count the numbers of all arrays with a size of k and composed of numbers belonging to the input set. The array should meet the condition that the first number in this array is prime to every other number in this array.
J'ai postulé en ligne. J'ai passé un entretien chez AKUNA CAPITAL (Chicago, IL) en janv. 2026
Entretien
They ask difficult questions but, given the role they seemed fair. They are painfully slow about the process and I wasn't able to attend the final round interview due to a job deadline I had informed them about, which I had to commit to since they did not reach back soon enough. Later they informed me they'd like to continue but it was too late lol.
Questions d'entretien [1]
Question 1
Talk about your professional and educational experience with C++
J'ai postulé en ligne. J'ai passé un entretien chez AKUNA CAPITAL
Entretien
First receive a online assignment that has 10 multiple choices and 3 coding, if you pass, you will revice another round of online assignment, which is about the same fottmat. This is the hardest OA I have ever done. Fail at the second round of the OA.
Questions d'entretien [1]
Question 1
MC that require deep understanding of C++, and coding without any provided test cases
J'ai passé un entretien chez AKUNA CAPITAL (Chicago, IL)
Entretien
Gives you some code and a task with CodePair, ask about your idea and complete part of the code. Expect extensive questions about C++ 11/17/20. You can google documents for C++.
Questions d'entretien [1]
Question 1
In order to remove the element from the linked list and use it somewhere else, how do you do that efficiently?