sanskaromar / CP-Learning_Resources

This is a collection of links, blogs and threads etc that I have used to understand and learn new topics in CP.

CP-Learning_Resources

This is a collection of links, blogs and problems etc that I have used to understand and learn new Data Structures, Algorithms and Techniques in Competitive Programming.

1. CP-Algorithms.com (Best resource ever with almost all important topics with brief & precise explanation and code. 🧡)
2. Fenwick Tree
3. DP on Trees
4. Centroid Decomposition
5. Grundy Numbers and Nim
6. Suffix Array
7. FFT
8. DFS Trees!!
9. Expectation
10. Basis and xor!

Some topics, DP in particular, can only be understood well by solving problems, these are some problems that I believe are very educating.

1. Dp:

   • A small list of problems(comment)
   • Music shopping
   • Families of Chefland
   • Marbles
   • Keyboard Purchase
   • Jongmah
   • Segments Subset
   • Knapsack variation
   • Cycles!

2. General Problems

   • New Year Tree (lazy seg practice)
   • Nastya and Unexpected Guest ( graph concepts )
   • Ada Pawns ( brilliant reduction to nim )
   • Merging Towers
   • Jack's Candy Shop (See the Time complexity analysis)
   • Range AND,OR,GCD (Trick)
   • Longest awesome string (Another Trick involving bits)
   • 664B (Two solutions -> handling conflicting pairs using recursion; hashing integer sets)
   • Number Theory 1
   • Game Theory 2
   • Race car
   • Expectation
   • Greedy (Great editorial!)
   • Divide and Conquer
   • Graph
   • Random and Hashing/seg-trees (see tutorial-2 for hash soln)

3. Implementation Practice

• String letters swapping

(More links will be added regularly.)