IMC Trading–styleSoftware Engineer InternSoftware Engineering InternQuestion #92
1) Given a chessboard size, a knight's starting position, an end position, and a bishop's position, find the minimum number of moves required for the knight to reach the end position. The knight cannot move to any square that the bishop is attacking, unless it captures the bishop on that square. 2) Implement a stack with the following functions: pop, push, inc, isEmpty, and peek. The inc function should increase the first n elements of the stack by a value i.
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