Skip to main content

Courses About Pricing Educators

Sign in Get started

Courses About Pricing Educators

Get started Sign in

Loading courses

Loading lessons

Data Structures and Algorithms, in Python: Python: Uncharted

Courses PythonData Structures and Algorithms, in Python

Data Structures and Algorithms, in Python

Measure how work grows, build foundational structures, implement honest searches and sorts, and traverse graph relationships with explicit step budgets.

Python
Unit 19 of 20
20 lessons
180 min
420 XP

Every lesson is open. Sign in when you are ready to begin.

Sign in to start

Lessons

20 total

1Junk Drawer vs ToolboxConnect data organization to the amount of work required for retrieval.InteractiveConcept7 min20 XPOpen
2Counting StepsMatch everyday tasks to constant, linear, and quadratic growth in work.InteractiveConcept9 min20 XPOpen
3Measure It YourselfCount constant, linear, and quadratic loop steps for two input sizes.CodeConcept8 min20 XPOpen
4Why in Was InstantCompare a counted list scan with one membership check in an already-built set.CodeConcept8 min20 XPOpen
5Build a StackImplement independent LIFO stacks on top of Python lists.CodeConcept9 min20 XPOpen
6Matched BracketsUse a stack to validate nested pairs of brackets.CodeConcept9 min20 XPOpen
7Build a QueueImplement an independent FIFO queue without slow front removal.CodeConcept8 min20 XPOpen
8Stack or Queue?Choose LIFO or FIFO behavior from the relationship a task needs.InteractiveConcept9 min20 XPOpen
9Links in a ChainBuild and traverse a singly linked chain of nodes.CodeConcept9 min20 XPOpen
10Dicts Are Hash MapsBuild a tiny bucketed map that handles collisions and updates.CodeConcept9 min20 XPOpen
11Linear Search, Honest WorkImplement linear search and report the exact number of inspected values.CodeConcept8 min20 XPOpen
12Halve the HaystackImplement counted binary search over sorted values.CodeConcept10 min20 XPOpen
13Binary Search StepsPredict boundary and midpoint changes during binary search.InteractiveConcept10 min20 XPOpen
14Insertion Sort by HandImplement stable insertion sort and count value comparisons.CodeConcept9 min20 XPOpen
15Merge Two SortedMerge two sorted sequences with a linear comparison budget.CodeConcept9 min20 XPOpen
16sorted and Its PowersRank records with sorted key and reverse while preserving stable ties.CodeConcept8 min20 XPOpen
17The Friend MapRead immediate graph neighbors without exposing mutable graph storage.CodeConcept10 min20 XPOpen
18Ripples Outward: BFSUse a queue to compute shortest unweighted hop counts.CodeConcept10 min20 XPOpen
19Deep First: DFSExplore a walled maze depth first with sensors until the flag is found.Code worldConcept9 min20 XPOpen
20DSA Mastery CheckCombine binary search and breadth-first traversal with explicit work budgets.CodeMastery check12 min40 XPOpen

How Python Runs The Hero Road