This course on algorithms and data structures was taught by Professors Lengler and Steurer. It covered a wide range of topics, including algorithmic thinking, basic search and sorting algorithms, fundamental data structures, dynamic programming, graph traversal, shortest path algorithms, and spanning tree algorithms. In my opinion, this was an excellent course for building a strong foundational understanding of algorithms and data structures. The course was well-structured, though at times, the explanations felt overly verbose and formal. Overall, it provided a solid introduction to the subject and was highly beneficial.

Lecture Notes

Study Notes

Other Stuff


3 items under this folder.