IMC TradingSoftware Engineer InternSoftware Engineer InternQuestion #93
What is the minimum number of moves required for a knight to reach a target position on a chessboard, given that there is a bishop present which threatens certain squares? The knight cannot move to squares attacked by the bishop.
Unlock the Full Solution
Enter your email to get the detailed step-by-step solution to this IMC Trading interview question, plus access to free interview prep resources.
We'll also send you a free HFT mock interview video.
More IMC Trading Software Engineer Intern Questions
Can you perform binary search on a linked list? Explain why or why not.What is a race condition?What does amortized runtime mean?What is a pointer and a shared pointer? How do you manage object ownership using these in programming?What makes a good hash function? Describe the key characteristics and properties that define an effective hash function.
Get All 94+ IMC Trading Questions with Solutions
Plus 16+ hours of video lectures, resume tailoring, and 1:1 mentorship from quants.
Schedule a Call