Candidatei-me online. Fiz uma entrevista na empresa AKUNA CAPITAL.
Entrevista
Send my resume, get a response with hackerbank questions. The questions are different for everyone I think. Then they give me the phone interview. The interview is technical. The interview is quite difficult from my perspective.
Perguntas de entrevista [1]
Pergunta 1
All questions are easy except the last one. Calculate the number of reverse order pairs in the array. But this time it is not reverse pairs but reverse arrays in 3 numbers. This makes the question very difficult if you want to match the time limit Especially they only give me 1 hour to finish all the problem.
Candidatei-me online. Fui entrevistado pela AKUNA CAPITAL (Chicago, IL) em jan. de 2026
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 1
Talk about your professional and educational experience with C++
Candidatei-me online. Fiz uma entrevista na empresa AKUNA CAPITAL.
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 1
MC that require deep understanding of C++, and coding without any provided test cases
Fiz uma entrevista na empresa AKUNA CAPITAL (Chicago, IL).
Entrevista
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++.
Perguntas de entrevista [1]
Pergunta 1
In order to remove the element from the linked list and use it somewhere else, how do you do that efficiently?