One lesson
An individual lesson
This track has no lesson ready to buy yet. Each lesson becomes available only after it is built and reviewed.
Under Construction
Developer practice and architecture · 30 lessons · up to 10 minutes each
A planned algorithms path through search, sorting, recursion, and complexity checks.
One-time purchase · USD
Access is attached to your account after payment is verified. No subscription.
One lesson
This track has no lesson ready to buy yet. Each lesson becomes available only after it is built and reviewed.
Full category
Permanent access to the lessons published in this track when you buy. Future lessons are not included. 0 of 30 lessons are published; 0 are in owner review and 30 are Coming Soon.
Lessons 1–10
Topic: input and output contract
Draw a small map of input and output contract in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: loop invariant sketches
Label the main pieces in loop invariant sketches in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: linear and binary search
Follow one input through linear and binary search in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: sorting trade-offs
Write down one practical difference between sorting trade-offs in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: recursion and base cases
Mark where recursion and base cases in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: hash lookup patterns
Annotate a minimal example of hash lookup patterns in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: tree and graph traversal
Show how tree and graph traversal in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: dynamic programming states
Describe one likely failure for dynamic programming states in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: time complexity estimates
Summarize an official example of time complexity estimates in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: edge-case and property tests
Match one small use case to edge-case and property tests in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Lessons 11–20
Topic: input and output contract
Create a small working example that uses input and output contract in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: loop invariant sketches
Combine loop invariant sketches in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: linear and binary search
Set up linear and binary search in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: sorting trade-offs
Add a check around sorting trade-offs in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: recursion and base cases
Add recursion and base cases in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: hash lookup patterns
Extract hash lookup patterns in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: tree and graph traversal
Run sample data through tree and graph traversal in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: dynamic programming states
Capture the result of dynamic programming states in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: time complexity estimates
Handle one expected failure from time complexity estimates in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: edge-case and property tests
Write a short usage note for edge-case and property tests in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Lessons 21–30
Topic: input and output contract
Add an edge-case test for input and output contract in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: loop invariant sketches
Add the relevant access, safety, or validation control to loop invariant sketches in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: linear and binary search
Record a small baseline for linear and binary search in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: sorting trade-offs
Change one measurable cost in sorting trade-offs in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: recursion and base cases
Use an observable signal to explain a failure in recursion and base cases in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: hash lookup patterns
Show that rerunning hash lookup patterns in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: tree and graph traversal
Compare two documented approaches to tree and graph traversal in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: dynamic programming states
Refine dynamic programming states in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: time complexity estimates
Check that a complete small flow using time complexity estimates in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
Topic: edge-case and property tests
Check the implementation of edge-case and property tests in the context of algorithm contracts, common strategies, complexity, and tests; save a short example or check that demonstrates the result.
References support the selected track topics while its lesson content is built and reviewed progressively.
This track is a catalog outline only. Each lesson remains unavailable until it is built and personally reviewed.