Dynamic Programming #1 | Codeforces - USACO - Leetcode - Codejam

preview_player
Показать описание
ِYou. can watch all the topic streams in this playlist:

🚀 What will be covered in this livestream:

1. Start with the basics of Dynamic Programming: the logic behind it and when to apply it.

0:00 Intro
7:05 The basics of Dynamic Programming
25:00 DP Problem Boredom - Difficulty 1500
48:15 DP Problem Consecutive Subsequence - Difficulty 1700
1:13:52 DP Problem Red-Green Tower - Difficulty 2000
1:42:18 DP Problem Winter is here - Difficulty 2200

For questions or further discussion, contact me via my Telegram channel:

#dynamic_programming #codeforces #usaco #learn_programming_online #learn_coding_online #code_tutorial #computer_science #usa_computing_olympiad #leetcode #faang #codejam #programming #coding_interview #dsa
Рекомендации по теме
Комментарии
Автор

this type of lecture what we cp community want with crystal clear explanation with best problems... hoping for more lecture like that... waiting for your binary seach one shot

mohdalizilani
Автор

bro just upload these type of videos as many as possible, way too helpful

thank you for this amazing session

urdaddy
Автор

very good problems for getting better at dp, this stream helped alot!

gengi-pocx
Автор

A great session shayan. Pls keep this going. Gonna recommend this stream and channel to my juniors and friends!!

prakhargupta
Автор

We want more of such streams! Awesome work.

keerthireddy
Автор

Great video! I just started, 1100 R still understood everything u explained.Really amazing explanation

PuspanjaliBehera-xl
Автор

Amazing! This lecture is useful for me (as a newbie competitive programming learner)! Thank you so much!

HgLi-wloy
Автор

Dp used to be hard for me. Thank u a lot

ИванИванова-ля
Автор

DOPE DOPE DOPE, blue green pink, bring me whatever you cook

Shauryacious
Автор

please add more of these, and problems based on graphs and trees as well

Aryan-vwlt
Автор

Please do more dp problems
Your work is much appreciated.

solosoul
Автор

Pretty good problems choosing, I've been more familiar with DP.

Xinyang
Автор

Thanks for this! Looking forward for many more such lectures!

anshulwarade
Автор

Thank you so much for this amazing session, I hope you keep it, and we want more dp please. Thanks Shayan :)

zvenom
Автор

you are actually doing great work can you express your view's on how to increase your ratings in cf and keeping doing this

ankitsha
Автор

Very very thanks
Can you please share a roadmap i am very much struggling with the problems even after solving so much i seems i'm not improving

Leo-kxgu
Автор

awesome shayan, waiting for more content like this

manishkumar-uwmw
Автор

can we go with recursive style of coding dp problems for these problems? i find them more intuitive.

fomoCoder
Автор

One of the finest resources for mastering dynamic programming, particularly for competitive programming, is truly invaluable. However, it would be fantastic to have similarly exceptional tutorials covering a broader range of topics! @CPwithShayan

quantaedits_
Автор

great ! today I learned when to not use array for DP. I always used to think why the heck people are using Maps in dp, now I know the reason why maps are a better option when dealing with large datasets.
If someone does not know why, then let me tell you
if I am decalring an array of size (int)1e9, then I will be making my compiler allocate 4gb worth of RAM for this process, but my OS won't allow that. (how i came to the 4gb memory thing, its simple an int is of 4bytes, now you will be decalring an int array of (int)1e9 size, which means 4byte X 1Billion = 4gb) Hence my compiler will throw an error. Now this is because, when an array is created, consecutive memory cells of the ram are allocated for this process, but when using map, the memory allocation is different than an array, and that's why map can be used.

rlm