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
Problem Link
Video Editorial Link
2) Consecutive Subsequence (Round 479 Div 3 Rated 1700) — DP, Map Data Structure
Problem Link
Video Editorial Link
3) Sleeping Schedule (Round 627 Div 3 E Rated 1700) — Scheduling 2D DP
Problem Link
Video Editorial Link
4) Python Indentation (Round 455 Div 2 C Rated 1800) — DP, Prefix Sum Optimization
Problem Link
Video Editorial Link
5) Multiplicity (Round 523 Div 2 C Rated 1700) — DP, Number Theory, Memory Optimization
Problem Link
Video Editorial Link
6) Longest Regular Bracket Sequence (Beta Round 5 C Rated 1900) — DP, Stack Data Structure
Problem Link
Video Editorial Link
7) Bad Luck Island (Round 301 D Rated 1900) — DP, Probabilities
Problem Link
Video Editorial Link
8) Queries for Number of Palindromes (ACM-ICPC Elimination Round H Rated 1800) — DP, String Processing
Problem Link
Video Editorial Link
9) K-Periodic Garland (Round 642 Div 3 E Rated 1900) — DP, Prefix Sums
Problem Link
Video Editorial Link
10) Zuma (Round 336 Div 1 B Rated 1900) — Range DP
Problem Link
Video Editorial Link
11) Clear the String (Educational Round 61 Div 2 F Rated 2000) — Range DP
Problem Link
Video Editorial Link
12) Bottles (ACM ICPC NEERC J Rated 1900) — 3D DP; Greedy
Problem Link
Video Editorial Link
13) The Least Round Way (Beta Round 2 B Rated 2000) — Grid DP
Problem Link
Video Editorial Link
14) Yet Another Yet Another Task (Educational Round 88 Div 2 D Rated 2000) — DP; Kadane's Algorithm
Problem Link
Video Editorial Link
15) Working Out (Round 245 Div 1 B Rated 1600) — Grid DP
Problem Link
Video Editorial Link
16) Modulo Sum (Round 319 Div 2 B Rated 1900) — DP, Prefix Sums, Pigeonhole Principle
Problem Link
Video Editorial Link
17) Fixed Points (Round 734 Div 3 E Rated 2000) — 2D DP
Problem Link
Video Editorial Link
18) Moamen and Xor (Round 737 Div 2 C) — DP, Combinatorics, Bitmasks
Problem Link
Video Editorial Link
19) Up the Strip (Round 740 Div 2 D1 + Hint for D2) — DP, Binary Indexed Tree
Problem Link
Video Editorial Link
20) Book (Round 743 Div 2 C / Div 1 A) — DP, Topological sorting of a Directed Graph
Problem Link
Video Editorial Link
21) Road Optimization (Round 765 Div 2 C) — 2 Dimensional DP
Problem Link
Video Editorial Link
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