This is a list of problems suggested by seniors who taught in the 2014 CPSIG. You can read theory from tutorials on Codechef or TopCoder or a book on algorithms.
- Largest Rectangle in a Histogram
- Farmer Sepp (Hint: Solve the above problem first, and extend its solution to solve this.)
- Coins Game
- Alphacode
- Bytelandian gold coins (Hint: Having an array of size 10^9 will not work (if one integer takes 4 bytes, think of how much memory this would consume). Try to use some other data structure for memoization (think of the STL data structures))
- Edit Distance
- Crack the Safe
- DNA
- Yet Another Electronic Device
- Knapsack:
- Simple 0/1 knapsack: The Knapsack Problem (this is a tutorial problem on SPOJ):
- Knapsack with larger constraints: Large Knapsack (Usual time complexity will pass, but you need to optimize on space complexity)
- Knapsack where some items are attachments, and can be bought only when a certain item is bought: Dab of Backpack
- GameOfSegments
- MATGAME
- 1×n grid, place X or O, no 2 consecutive O's or X's. Each player can place either X or O. Player with no move loses.
- TRIOMINO
- StoneGameStrategist
- A Coin Game
- M&M Game
- A game of consecutive piles