Trees and Strings
IMC's graduate and intern assessment has paired a binary search question with a tree problem that takes many queries against the same tree.
A tree walk per question passes the samples and then times out. One walk up front that gives every node a slot and a subtree size turns each answer into an array read. Write that walk without recursion, since the tree can be a long chain of 200,000 nodes.
The two string problems sit at opposite ends of the difficulty range. One was the warm-up in an older three-problem round. The other is a Hard, where starting from the right candidate leaves only a few options to check.
IMC TradingPremium lesson · Coding round
The 3 IMC Trading problems are below.
- A Premium questionCoding · Medium · Frequently asked
- A Premium questionCoding · Easy
- A Premium questionCoding · Hard
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.