Welcome to the Specialists-Plan-W25 repository! This repository is dedicated to students who have completed the Pupils Plan or have an equivalent background in problem-solving and algorithm design. Each week we tackle advanced topics in dynamic programming, data structures, and number theory, building up to more complex algorithms and techniques.
Join our problem-solving community on VJudge to participate in contests and practice sessions. The group contains problem sets for each week, and you can submit your solutions and track your progress.
- Topics: Fibonacci, Knapsack, Number of Possible Paths in Grid, Coin Change
- Problem Set | Solutions
- Additional Problems | Solutions
- Topics: Bitmask DP, Digit DP, Permutation to Subset
- Problem Set | Solutions
- Additional Problems | Solutions
- Topics: Prefix DP, Subarray DP, Range DP, Interval DP, Permutation DP
- Problem Set | Solutions
- Additional Problems | Solutions
- Topics: Basic counting techniques
- Problem Set | Solutions
- Additional Problems | Solutions
- Topics: Extended Euclid, Euler’s Phi, Mobius Mu
- Problem Set | Solutions
- Additional Problems | Solutions
Feel free to submit pull requests for new solutions, optimizations, or alternate approaches. Collaboration is encouraged!
The aim of this plan is to push students beyond basic problem-solving, introduce more sophisticated techniques, and build a strong foundation for competitive programming or advanced algorithm design.
Good luck, and happy solving! 🎯