Efficient Algorithms and Intractable Problems (CS 170)
Undergraduate course, UC Berkeley, 2017
Teaching assistant for UC Berkeley CS170: Efficient Algorithms and Intractable Problems (Fall 2017 and Fall 2018), taught by Profs. Umesh Vazirani, Prasad Raghavendra, and Sanjam Garg. A core undergraduate algorithms course covering divide-and-conquer, dynamic programming, graph algorithms, NP-completeness, and approximation algorithms. Recognized among the top 10% of TAs in the UC Berkeley EECS Department.