Data Structures From Scratch

In some SIG live rounds you write a container you've used for years. One of them has come up in several rounds, including a second-round coding session and an early screen, and in one reported round the candidate had about thirty minutes alone to write the class.

Getting either one working doesn't take long. Then an engineer comes back, goes over what each call costs, and asks for a faster or smaller version, which you code in the same session. Have your complexity reasoning ready before they ask, since the optimizing starts once you've explained what you wrote.

Much of SIG's trading code is C++, so the follow-ups lean on memory: when a buffer reallocates, how much that copies, and what heap allocation sits behind each node. Keep each class small, and the change they ask for stays small too. The problems below start with the one that comes up most.

SusquehannaPremium lesson · Coding round

The 3 Susquehanna problems are below.

1. 1A Premium questionCoding · Medium · Frequently asked
2. 2A Premium questionCoding · Medium
3. 3A Premium questionCoding · Medium

Each with hints, the follow-up and a tested solution.

Get the Susquehanna questions

$49 a year · all 100 companies · cancel anytime

From 20,000+ candidate reports, forum threads behind logins and write-ups in Chinese.

Read a free Susquehanna lesson firstAlready a member? Sign in