Notes

• DP’s secret: think globally optimal, not just locally.

  • You have to break the problem into simpler subproblems, solving each of them just once, and building the solution combining these solved subproblems

• The opposite of DP is a greedy algorithm because the latter picks the locally optimal choice at each step. And locally optimal choices may result in a bad global solution.

Links

• ​Competitive Programmer’s Handbook​

• ​How to prepare for competitive programming?​

• ​What is the best strategy to improve my skills in competitive programming in C++ in 2-3 months?​

• ​Awesome Competitive Programming​

• ​Collection of algorithms and data structures I use in programming contests​

• ​Competitive Programming books​

• ​Ultimate Competitive Programming setup for VSCode with C, C++ and Python (2020)​

• ​How to crack HashCode competition with some engineering skills (2020)​

• ​Competitive Programming Resources​

• ​Online Judge Solutions in C++​

• ​Competitive Programming Solutions in C++​

• ​Competitive Programming Snippets in Rust​

• ​USA Computing Olympiad​

• ​Prepare for competitive programming​

• ​C++ implementations of useful algorithms and data structures for competitive programming​

• ​Algorithmic Problem Solving - Algorithms and data structures for preparing programming competitions: basic and advanced.

• ​Competitive programming solutions in Rust​

• ​Competitive programming solutions in C++​

• ​Solutions to Competitive Programming problems​

• ​Programming Challenges - Data structures and algorithms. Programming challenges and competitions to improve knowledge.

• ​Data Structures and Algorithms for Competitive Programming​

• ​C++ basics for competitive programming (2016)​