Concepts: Each tutorial is about 10 minutes time. With videos it will help to rewind and play and if you don't get it the first time!
- Episode 1: Why do we need (efficient) algorithms?
- Episode 2: Our first algorithm: Quick-sort
- Episode 3: Merge-sort
- Episode 4: Binary search
- Episode 5: Binary search extended
- Episode 6: Dynamic Programming
- Episode 7: Dynamic Programming (contd.)
- Episode 8: Graphs in a grid
Problems: All problems only involve the above concepts (in general, the problems get more difficult over time, i.e. problems from 2012 are easier than those from 2016).
Hints available:
- Secret Cow Code (Silver, January Contest: USACO 2017)
- Sequence Game (ICO 2010: India)
- Wormholes (ZCO 2012: India)
- Matched Brackets (ZCO 2012: India)
- Round Table (ZCO 2012: India)
- Matched Brackets 2 (ZCO 2012: India)
- Chewing (ZCO 2013: India)
- Little Red Riding Hood (ZCO 2013: India)
- Save Spaceman Spiff (ZCO 2013: India)
- Tournament (ZCO 2013: India)
- SUPW (ZCO 2014: India)
- IPL (ZCO 2014: India)
- Smart Phone (ZCO 2014: India)
- Video Game (ZCO 2014: India)
- Break Up (ZCO 2015: India)
- Covering (ZCO 2015: India)
- Rectangle (ZCO 2015: India)
- Variation (ZCO 2015: India)
- Bamboo Art (ZCO 2016: India)
- Bookshelves (ZCO 2016: India)
- Four Sum (ZCO 2017: India)
- Lasers (ZCO 2017: India)
Hints NOT available (yet!): None!
More practice problems
- Beginner channel of ICO Online Judge community (beginner problems)
- Intermediate concepts and problems (this community)
- Advanced concepts and problems (this community)
I have not separated the problems by topic since that significantly reduces how much better your problem solving skills are getting with each problem.
Enjoy!
P.S.: Problem Save Spaceman Spiff (ZCO 2013: India) has been removed from the above list because of weak test data and incorrect solutions passing.
Last updated: 24th December, 2016
