PLACEMENT

Data structures and algorithms test: where to start

15 problems, about seven minutes. You read a problem and name the pattern it needs. No code, no timer per question.

At the end you get the correct pattern for every question, which groups came apart, and the step to pick the course up at.

How the problems are picked

The test walks the course in order, one problem per topic, from Big-O and arrays to dynamic programming and strings. Bit tricks, grids and the advanced topics are left out: if you still name the patterns right at dynamic programming, you are past the beginning.

Each problem is a short task with no label on it. You pick its pattern from 4 names, or press “I don’t know”. Nothing tells you between questions whether you were right. You need no account to take it.

How the result picks your step

A topic holds up when you named at least half of its problems. The result walks the topics in course order and stops at the first one that came apart; if that topic builds on one the test never asked about, you go back to that one. Its first step is where you start, and everything before it is yours to skim. If nothing came apart, it points you at the first topic the test did not reach.