Day 1 and 2

Dynamic Programming

• Two good blog entries for dp — Basic , Good Tricks
• Modified Knapsack — 1
• Maximum Disjoint Subtrees Sum
• Modified Knapsack — 2
• State-Space Reduction
• Chess Board Dp

Segment Trees

• A nice blog entry for this Everything About Segment Trees,contains many good problems to try as well
• Stack-SegTree problem
• Matrix Expo on SegTree
• Implementation-Hackerearth

Tries

• Topcoder tutorial is pretty good to get an understanding , Tries
• Try to make your own implementation and code up the problems in , BIT-Tries
• Watto and Mechanism
• Good Substrings

Mo's Algorithm & SQRT decomposition

• Blog , an entry by anudeep nekkanti which is really good.It has good problems at the end of it.
• Easy-Medium on Mo's
• Medium-Hard
• Medium-Hard
• Mo's Algorithm on Trees

Please leave a comment with other good problems or blog entries that you find. Will help make the blog better.