APS Search and Dynamic Programming – ETE388/summer25

Assignments

• Dynamic Programming I (Remaining: 446 days 6:36:19)
1. Knapsack
2. Longest Increasing Subsequence
3. Errands
• Dynamic Programming II (Remaining: 446 days 6:35:18)
1. e-Coins
2. Hiding Chickens
3. Tug of War
• Dynamic Programming III (Remaining: 81 days 6:35:17)
1. ls
2. Roller Coaster Fun
3. Maximum Loot
• Dynamic Programming IV (Remaining: 81 days 6:35:16)
1. Exchange Rates
2. Buying Coke
3. Funny Games
• Search I (Complete Search) (Remaining: 82 days 6:35:15)
1. Candy Division
2. GREAT + SWERC = PORTO
3. Selling Spatulas
• Search II (BFS/DFS) (Remaining: 82 days 6:35:14)
1. Getting Gold
2. Chicken Joggers
3. Promotions
• Search III (Binary Search) (Remaining: 82 days 6:35:13)
1. Firefly
2. Eko
3. Slalom 2
• Search IV (Search harder) (Remaining: 82 days 6:35:13)
1. Paintings
2. Gokigen Naname
3. Square Fields (Hard)