Leg A: Foundations
Open- PYTH
Python for DSAoptional warm-upyou are here
PYTH Python for DSA: lessons and problems Code Lesson or problem Status PYTH-1 Lists, indexing and slicing Not started PYTH-2 Loops and comprehensions Not started PYTH-3 Functions Not started PYTH-4 Dicts, sets and tuples Not started PYTH-5 Classes for nodes Not started PYTH-6 How practice and tests work Not started PYTH-P1 Rotate the departure board Not solved PYTH-P2 Running totals Not solved PYTH-P3 The first repeated code Not solved PYTH-P4 The codes seen once Not solved PYTH-P5 Build a train Not solved - CORR
Correctness
- BSRC
Binary search
- SORT
Sorting
Leg B: Data structures
Open- LINK
Linked lists
- HASH
Hashing
- TREE
Trees and BSTs
- BALT
Balanced trees
- HEAP
Heaps
- TRIE
Tries
- DSUF
Union-find
- RNGQ
Range queries
Leg C: Design techniques
Open- BITS
Bit manipulation
Leg D: Graphs and beyond
Open- GRPH
Graphs
- PATH
Shortest paths
- CONN
Connectivity
- FLOW
Network flow
- ADDP
Advanced DP
- HARD
Hard problemslast station