May we remember this browser? It lets us tell a returning reader from a new one, which is the only way we can see whether anything we change actually helps. Say no and the site is exactly the same — we still count how many people opened this page, without keeping anything on your device. What we measure

Python for the technical interview

Data structures, complexity and the patterns interviews reuse, practised in Python. Placeholder content.

10 lessons · about 3.3 hours · Knows some Python, preparing for coding interviews

The syllabus, mapped

01Lists, dictionaries and sets — The tools every solution is built from.
02Complexity and Big-O — The question after every solution.
03Recursion and dynamic programming — The pattern most people fail on.
04Trees and graphs — Traversals appear in half of all problems.
05Sorting and searching — Known algorithms, expected fluently.

The 10 lessons

01Lists, dictionaries and sets: the ideas · free
02Lists, dictionaries and sets: exam problems
03Complexity and Big-O: the ideas
04Complexity and Big-O: exam problems
05Recursion and dynamic programming: the ideas
06Recursion and dynamic programming: exam problems
07Trees and graphs: the ideas
08Trees and graphs: exam problems
09Sorting and searching: the ideas
10Sorting and searching: exam problems

The first lesson is free. The other 9 (3.3 hours in all) cost $8.42 bought together.

Or $1.70 a lesson one at a time, or $20.00 a month for Minimal — cheaper once you take more than ~11 lessons a month.

Try a block from the first lesson: Lists, dictionaries and sets: the ideas

Trace · a Python loopRUNNING

1total = 0

2for n in [3, 1, 4, 1, 5]:

3 if n > total:

4 total = n

5print(total)

total0

n—

Outputwaiting…

Start with nothing in the box.

Step 1 of 15

What does type(3 / 2) evaluate to in Python 3?

Pick an option.

Free account. The course comes with you; nothing is charged for the first lesson.

My course isn't here. Tell us what you are preparing for