Course Topics
| Week | Lecture Topics and Assignments |
|---|---|
| 1 | Introduction Review syllabus and expectations Introduction to kattis |
| 2 | MLK Day – No class |
| 3 | Kattis coding contest Lecture: Two Pointer Technique |
| 4 | Mock interview with peers Lecture: Stacks, queues, 2D arrays, linked lists, binary search |
| 5 | Coding Contest Lecture: Sliding window |
| 6 | Mock interview with peers Lecture: Trees - traversals, binary search trees, heaps, tries |
| 7 | Midterm |
| SPRING BREAK | |
| 8 | Lecture: Dynamic Programming 1D arrays |
| 9 | Mock Interiews Lecture: Dynamic Programming 2D arrays |
| 10 | Coding Contest Lecture: Graphs - traversals (DFS, BFS for shortest paths), connected components |
| 11 | Coding Contest Lecture: Graphs - topological ordering, Dijkstra's shortest path, minimum spanning trees, Floyd-Warshall all pairs-shortest paths |
| 12 | Mock Interviews Lecture: Backtracking, review |
| 13 | Exam 2 |
| 14 | Easter break- no class |
| 15 | Last coding contest! |