APS Search and Dynamic Programming – ETE388/summer25

Assignments

• Dynamic Programming I (Remaining: 425 days 7:19:44)
1. Knapsack
2. Longest Increasing Subsequence
3. Errands
• Dynamic Programming II (Remaining: 425 days 7:18:43)
1. e-Coins
2. Hiding Chickens
3. Tug of War
• Dynamic Programming III (Remaining: 60 days 7:18:42)
1. ls
2. Roller Coaster Fun
3. Maximum Loot
• Dynamic Programming IV (Remaining: 60 days 7:18:41)
1. Exchange Rates
2. Buying Coke
3. Funny Games
• Search I (Complete Search) (Remaining: 61 days 7:18:40)
1. Candy Division
2. GREAT + SWERC = PORTO
3. Selling Spatulas
• Search II (BFS/DFS) (Remaining: 61 days 7:18:39)
1. Getting Gold
2. Chicken Joggers
3. Promotions
• Search III (Binary Search) (Remaining: 61 days 7:18:38)
1. Firefly
2. Eko
3. Slalom 2
• Search IV (Search harder) (Remaining: 61 days 7:18:38)
1. Paintings
2. Gokigen Naname
3. Square Fields (Hard)