3351. Sum of Good Subsequences | DP | Don't Overthink here :)

preview_player
Показать описание
In this video, I'll talk about how to solve Leetcode 3351. Sum of Good Subsequences | DP | Don't Overthink here :)

Let's Connect:

About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)

✨ Timelines✨
0:00 - Problem Explanation

✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms
Рекомендации по теме
Комментарии
Автор

Bhai feeling so good to see you back please keep posting weekend contests please

mukulkhanna
Автор

back to back 🔥.... i'm waiting for live by you 😢

Its_Shubham_Negi
Автор

This Hit me hard bro !!!, Thanks You saved hours in understanding this, cool stuff Thanks !!!

brahmatejachilumula
Автор

Thanks a ton for the solution
subah se kisi ka solution samjh nhi aya, ab jake aya h iss video

stith_pragya
Автор

what would be approximate rating if this problem was on codeforces?

prajitbanerjee
Автор

Amazing explanation! Looking forward to your videos on LeetCode contests.

shristisrivastava
Автор

some feedback
- make it a screen share instead of a vidcast a lot of the screen gets hidden
- share the code

bluesteel
Автор

i can see the hard work bro !!! so easy to understand

SATYAMGUPTA-ck
Автор

can anyone explain ...why he is doing ..in sum[num] part dp[num-/+1] * num ....?

ezcoding
Автор

hi aryan i am lacking in dp can you suggest some resource frow where i can learn different types of questions of dp, i have idea about dp, but i cant apply dp on unseen question

kshitijgarg
welcome to shbcf.ru