IMC Trading Interview 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.

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.

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.

Implement a stack data structure with an additional method increment(k, v), which increments the bottom k elements of the stack by the value v.

Describe a stack and a queue to someone who does not have a background in data structures.

Write a function that takes an integer array as input and returns a boolean indicating whether the array contains any duplicate values.