PYTHON ALGORITHMS & DATA STRUCTURES · 27 lessons

Big-O notation, runtime and memory limits, measuring performance

sys.stdin.readline, sys.stdout.write and EOF handling

Time complexity of list, deque, set and dict operations

Slicing, string methods and ASCII handling

list vs deque, bracket matching and postfix notation

dict, set, Counter and the idea of hash collisions

heapq, min/max heaps and Top-K problems

Implementing singly, doubly and circular linked lists

Bubble, insertion, merge and quick sort — implementation and performance

sorted/sort, key functions, multiple keys and stable sorting

Implementing binary search plus bisect and lower/upper bounds

Parametric search and the 'maximise the feasible value' pattern

Adjacency lists and matrices, directed, undirected and weighted graphs

Recursive and stack-based DFS, visited state and connected components

deque-based BFS, shortest paths and grid traversal

Kahn (BFS) and DFS topological sort, cycle detection

Pre-order, in-order, post-order and level-order traversal, recursive vs iterative

BST insertion, search and deletion, plus the idea of balance

String search, autocomplete and prefix queries

Memoisation and tabulation with Fibonacci and staircase problems

LCS, LIS, 0/1 knapsack and matrix-chain multiplication

Meeting-room scheduling, coin change, activity selection and correctness proofs

Merge sort, quick sort, fast exponentiation and the CCW orientation test

Priority-queue shortest paths and the limits of negative weights

A DP perspective on all-pairs shortest paths

Kruskal with union-find, and Prim

Two pointers, sliding windows, bitmasking and prefix sums