I applied online. I interviewed at IMC Trading in Jan 2021
Interview
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().
Interview questions [1]
Question 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.
I applied online. I interviewed at IMC Trading (Amsterdam) in Dec 2025
Interview
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.
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.
Interview questions [1]
Question 1
What is the project that you are most proud of and why
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.