More courses
Browse course shelfWeekly outline
Syllabus
Week topics from the course map
00W00
Topic
Incomplete
01W01
Python Refresher
Incomplete
02W02
Complexity, Notations, Sorting and Searching Algorithms
Incomplete
03W03
Arrays, Lists, Stacks, Queues, Hashing
Incomplete
04W04
Graph Algorithms
Incomplete
05W05
Graph Algorithms (Continued)
Incomplete
06W06
Union-Find Data Structure, Priority Queue, Heap, Binary Search Tree
Incomplete
07W07
Balanced Search Tree, Greedy Algorithms
Incomplete
08W08
Divide and Conquer
Incomplete
09W09
Dynamic Programming
Incomplete
010W10
String or Pattern Matching Algorithms
Incomplete
011W11
Network Flows, Linear Programming, Class of Algorithms
Incomplete
012W12
Summary
Incomplete
Study tools
Memorize first
Compact recall strip
Practice Dock
One drill at a time, with Theo hints, teacher lanes, and a replay queue.
Use this when the theory is already clear and the goal is fast, clean retrieval under pressure. Mark weak questions, copy a revision pack, and move on.
TheoTeacherTextbookSpeedrun
Hint ladder
5 steps
Weak replay
Local
Revision pack
Copy
Mode lanes
4
Ask less. Recall more.
Open Practice Dock
SM-2 Active
Spaced Repetition
Flashcards
Spaced repetition engine for long-term retention of core concepts.
Start session
Not Available
Interactive Simulations
Visual Labs
Exam Mode
Adaptive Practice
Mock Exam
Set paper
Code Protocol
OPPE Simulator
Secure Comm-Link Terminal
Syllabus Matrix Registry
Global Course Index