Candidatei-me online. Fui entrevistado pela IMC Trading em jan. de 2021
Entrevista
You are given two hours to solve two problems in HackerRank. One is the minimum number of moves of a knight given a bishop on the chessboard. One is the implementation of a new stack class with two new functions inc(int i, int v) and sum().
Perguntas de entrevista [1]
Pergunta 1
1. The minimum number of steps to move a knight to a destination on the chessboard. A bishop is given on the chessboard at the start. You should avoid being captured by the bishop. You can also capture the bishop.
2. Implement a new stack class.
Candidatei-me online. Fui entrevistado pela IMC Trading (Amsterdã) em dez. de 2025
Entrevista
it was hard, was not a standard medium or hard leetcode problem. it was an optimization DP problem. study competitive programming from books for it, and be ready 💪
this is my experience.
Fiz uma entrevista na empresa IMC Trading (Amsterdã).
Entrevista
Applied online. Got a coding OA. Then received a video assessment where I was asked to explain questions about computer science fundamentals. This felt a bit strange and I did not pass.
Perguntas de entrevista [1]
Pergunta 1
What is the project that you are most proud of and why
Fiz uma entrevista na empresa IMC Trading (Chicago, IL).
Entrevista
There was first an online assessment with two medium coding questions. After passing, there was a virtual interview with a small technical short response section and a basic behavioral section.