Grid Problems
Grids come up on IMC's online assessment more than any other input. The Online Assessment covered the jump search and the knight that has to avoid a bishop. The three problems here ask different questions of a board.
The best known of them asks for a route scored by how close it comes to danger. Solve it in two parts. First, one BFS started from every source at once gives each cell its distance. Then a second search finds the route. If you take the binary search route for that second part, Binary Search Problems has more of the same idea.
The other two are older and shorter. One is mostly careful parsing, and the other is a flood fill with a twist in what the cells hold. Check the grid size before you pick a plan. A fresh search from every cell is fine on a small map, but on a 400 by 400 one it times out.
IMC TradingPremium lesson · Coding round
The 3 IMC Trading problems are below.
- A Premium questionCoding · Hard · Signature problem
- A Premium questionCoding · Medium
- A Premium questionCoding · Medium
Each with hints, the follow-up and a tested solution.
Get the IMC Trading questions$49 a year · all 100 companies · cancel anytime
From 20,000+ candidate reports, forum threads behind logins and write-ups in Chinese.
IMC Trading interview guideKnow what IMC Trading asks before you walk in.
26 coding · 1 system design · 34 behavioral questions
Get their questions first.
InterviewLegend is independent and not affiliated with or endorsed by any company it covers.