Topic 10: Computational Geometry: Line-segment properties (33.1) and Determining whether any pair of segments intersects (33.2) https://docs.google.com/forms/d/e/1FAIpQLSdeLot3bpPcAx3Ne6iT1gBt1vrKjzcqrk6ow7IqUNAv-UZ1MQ/viewform?usp=publish-editor

Topic 12: Computational Geometry: Finding the closest pair of points (33.4) https://docs.google.com/forms/d/e/1FAIpQLSeQpNhMrzYQUbdunkHKanKQlaMbVao9_Cibid8VylUJBakPXg/viewform?usp=publish-editor

Topic 01: Medians and Order Statistics (Chap 9) 💡

Topic 02: Dynamic Programming: Longest common subsequence (15.4)💡

Topic 03: Greedy Algorithms: Huffman codes (16.3)💡

Topic 04: Elementary Graph Algorithms: Representations of graphs (22.1) and Breadth-first search (22.2) 💡

Topic 05: Elementary Graph Algorithms: Depth-first search (22.3)

Topic 06: Elementary Graph Algorithms: Topological sort (22.4) and Strongly connected components (22.5)

Topic 07: Minimum Spanning Trees (23.1 💡and 23.2)

Topic 08: String Matching: The naive string-matching algorithm (32.1) and The Rabin-Karp algorithm (32.2)💡

Topic 08-1: String matching with finite automata (32.3)💡

Topic 09: String Matching: The Knuth-Morris-Pratt algorithm (32.4)

Topic 11: Computational Geometry: Finding the convex hull (33.3)