# Competitive Programming 2 – CS390-CP2/Summer2020

This course offering has no end date

### Teachers

- Trung Dang (Teaching Assistant)

### Assignments:

- T01: Recursive Search [converted from problem group] (Remaining: 57 days 21:57:56, Students: 4)
- T02: Simulation and Bisection [converted from problem group] (Remaining: 60 days 21:57:56, Students: 4)
- T03: Dynamic Programming I [converted from problem group] (Remaining: 65 days 21:57:56, Students: 4)
- T04: Linked List and Queues [converted from problem group] (Remaining: 72 days 21:57:56, Students: 4)
- T05: Stacks [converted from problem group] (Remaining: 74 days 21:57:56, Students: 4)
- T06: Tree [converted from problem group] (Remaining: 76 days 21:57:56, Students: 4)
- T08: Traversal and Topological Sort [converted from problem group] (Remaining: 90 days 21:57:56, Students: 4)
- T09: Union Find and MST [converted from problem group] (Remaining: 93 days 21:57:56, Students: 4)
- T07: Dynamic Programming II [converted from problem group] (Remaining: 148 days 21:57:56, Students: 4)
- T10: Shortest Paths [converted from problem group] (Remaining: 148 days 21:57:56, Students: 4)