Skip to main content

Resources

Algorithms study resources

Free and paid algorithms resources for theory, proofs, and practice.

Optimized for Algorithms · CS students practicing proofs and optimization strategies.

Showing 8 resources

MIT OCW Introduction to Algorithms (6.006)

advanced

Rigorous university course on algorithm design and analysis.

CoursesFreeLecture course40-60 hours
Visit resource

Stanford Algorithms specialization

intermediate

Coursera series covering divide-and-conquer, greedy, and DP.

CoursesOnline course40-60 hours
Visit resource

Loop-invariant proof guide

advanced

Templates for initialization, maintenance, and termination.

Proofs & analysisFreeGuide4-6 hours

Recurrence and master-theorem workbook

intermediate

Practice solving divide-and-conquer recurrences.

Proofs & analysisWorkbook5-7 hours

LeetCode algorithm problem sets

intermediate

Pattern-grouped problems for each paradigm.

Coding practiceFreeCoding problems20-30 hours
Visit resource

Dynamic programming problem ladder

advanced

Graduated DP problems from 1D to 2D state.

Coding practiceProblem set10-15 hours

Paradigm-cue reference

beginner

A table mapping problem cues to likely paradigms.

ReferenceFreeReference sheetOngoing

Complexity comparison chart

beginner

Best, average, and worst-case bounds for common algorithms.

ReferenceFreeReference sheetOngoing

FAQ

How should I use these algorithms study resources?

Choose one foundation resource, one practice resource, and one review loop before opening more tabs.

Should I use free resources first?

Yes. Start with free resources until your error log shows a specific gap that needs a paid course, book, or tutor.

How do I avoid passive resource browsing?

Pair every resource with a timed sprint, a visible output, and a recap note before moving to the next item.

Compare methods

Use it now

Turn this page into a live sprint

Start the matching room for Algorithms, then use the sprint plan as the first task and recap script.

Algorithms study resources
Focus target: Algorithms
Block 1 (25 min): closed-book recall or one timed practice set.
Break (5 min): mark confusing items without opening a new task.
Block 2 (25 min): correct misses and write the next first step.
Done: one score/error note plus one queued task for tomorrow.
Start Algorithms roomChecklistCompare methods