Hello everyone,
I just started my YouTube channel in which I have started posting videos related to competitive programming.
My first playlist is on Dynamic Programming and I will be uploading solutions for 16 DP problems in the month of May (with videos coming every second day.)
This playlist is aimed at those who have a conceptual understanding of what DP is and want to raise their DP problem solving level so that they are able to solve medium level DP problems (of CF rating from 1600 to 2000).
Please have a look at my channel and consider subscribing if you like the content.
I have also uploaded a general video on how to get better at Dynamic Programming which should be helpful for all skill levels: How to get better at Dynamic Programming
The problem list is as under:
1) Flowers (Round 271 Div 2 D Rated 1700) — DP, Combinatorics, Prefix Sums
2) Consecutive Subsequence (Round 479 Div 3 Rated 1700) — DP, Map Data Structure
3) Sleeping Schedule (Round 627 Div 3 E Rated 1700) — Scheduling 2D DP
4) Python Indentation (Round 455 Div 2 C Rated 1800) — DP, Prefix Sum Optimization
5) Multiplicity (Round 523 Div 2 C Rated 1700) — DP, Number Theory, Memory Optimization
6) Longest Regular Bracket Sequence (Beta Round 5 C Rated 1900) — DP, Stack Data Structure
7) Bad Luck Island (Round 301 D Rated 1900) — DP, Probabilities
8) Queries for Number of Palindromes (ACM-ICPC Elimination Round H Rated 1800) — DP, String Processing
9) K-Periodic Garland (Round 642 Div 3 E Rated 1900) — DP, Prefix Sums
10) Zuma (Round 336 Div 1 B Rated 1900) — Range DP
11) Clear the String (Educational Round 61 Div 2 F Rated 2000) — Range DP
12) Bottles (ACM ICPC NEERC J Rated 1900) — 3D DP; Greedy
13) The Least Round Way (Beta Round 2 B Rated 2000) — Grid DP
14) Yet Another Yet Another Task (Educational Round 88 Div 2 D Rated 2000) — DP; Kadane's Algorithm
15) Working Out (Round 245 Div 1 B Rated 1600) — Grid DP
16) Modulo Sum (Round 319 Div 2 B Rated 1900) — DP, Prefix Sums, Pigeonhole Principle
17) Fixed Points (Round 734 Div 3 E Rated 2000) — 2D DP
18) Moamen and Xor (Round 737 Div 2 C) — DP, Combinatorics, Bitmasks
19) Up the Strip (Round 740 Div 2 D1 + Hint for D2) — DP, Binary Indexed Tree
20) Book (Round 743 Div 2 C / Div 1 A) — DP, Topological sorting of a Directed Graph
21) Road Optimization (Round 765 Div 2 C) — 2 Dimensional DP
I am a high schooler who enjoys CP. I qualified for IOITC 2021 (in 9th grade); have a Codechef max rating of 2112 and a Codeforces max rating of 1748.
Edit:
Added a general video on how to get better at DP
Very much thanks!
Give me upvote
Love u Bro
please continue to post such explanations Thank you very much
All are Quality Problems. Nice Content.
I would like to recommend 730J (rated 1900). One of the best DP problems I came across.
Yes it is a nice problem which uses only the basic ideas in DP but still proves to be challenging. I will definitely make a video on it.
Video made: https://www.youtube.com/watch?v=o8pLwy_Zs-c
The work you are doing helps many people, keep doing it.
Thanks
Thanks for Providing Good Content
Please attach a link to each problem for practicing
Done!
Can you also add div2 A,B and C problems, I do find them difficult unlike the majority of the community, I often struggle with them especially B and C. Loads of thanks.
I plan to do problem Cs from recent contests if there is an interesting idea to share.
Good work ak2006 keep it up.
Good Going!! Thanks for the resources.
I'm going through your playlist and haven't finished it yet so don't know if this type of bugaboo is covered, but I found it interesting. Bugaboo
Great job creating this playlist though!
You can check out the official video editorial for that particular problem. Yes my playlist does cover similar problems to that one.
Thanks a lot!