IMC Trading–styleSoftware 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.
Build Your Approach
State the assumptions, try a simple case, then work toward a general solution. Check the result and explain how it changes if an assumption changes.
Try the free diagnostic with worked solutions →Get Free Interview Prep Resources
More IMC Trading–Style 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.
Practice the Reasoning Behind the Answer
Bring your target roles and interview timeline to a free quant consult. Discuss your preparation priorities and how Quant Blueprint’s lessons, practice and mock interviews can help.
Book a Free Quant ConsultYour goals · your preparation · your next steps