Competitive Programming 2 – CS390-CP2/2020_Fall

Assignments

• T07: Dynamic Programming II [converted from problem group] (Ended)
1. exactchange2
2. knapsack
3. ninepacks
• T08: Traversal and Topological Sort [converted from problem group] (Ended)
1. brexit
2. builddeps
3. pickupsticks
• T04: Linked List and Queues [converted from problem group] (Ended)
1. ferryloading3
2. joinstrings
3. knigsoftheforest
• T00: Introduction [converted from problem group] (Ended)
1. birdrescue
2. gold
3. horror
4. pivot
• T01: Recursive Search [converted from problem group] (Ended)
1. dobra
2. fruitbaskets
3. paintings
• T02: Simulation and Bisection [converted from problem group] (Ended)
1. financialplanning
2. freeweights
3. memorymatch
• T03: Dynamic Programming I [converted from problem group] (Ended)
1. keyboardconcert
2. narrowartgallery
3. trainsorting
• T05: Stacks [converted from problem group] (Ended)
1. evenup
2. restaurant
3. teque
• T06: Tree [converted from problem group] (Ended)
1. marblestree
2. molekule
3. numbertree
• T09: Union Find and MST [converted from problem group] (Ended)
1. ladice
2. lostmap
3. millionairemadness
• T10: Shortest Paths [converted from problem group] (Ended)
1. allpairspath
2. flowerytrails
3. nikola

Teachers