# Competitive Programming 2 – CS390-CP2/Spring2020

This course offering has no end date

### Assignments:

- W1: Backtracking [converted from problem group] (Ended, Students: 39)
- W2: Simulations [converted from problem group] (Ended, Students: 39)
- W3: Dynamic Programming 1 [converted from problem group] (Ended, Students: 39)
- W5: Tree [converted from problem group] (Ended, Students: 39)
- W7: Dynamic Programming 2 [converted from problem group] (Ended, Students: 39)
- W6: Linked List [converted from problem group] (Ended, Students: 39)
- W9: Topological Sort [converted from problem group] (Ended, Students: 39)
- W11: Shortest Path [converted from problem group] (Ended, Students: 39)
- W10: Union-Find and MST [converted from problem group] (Ended, Students: 39)