Solving Questions With Brainpower || 1D DP || Recursion - Memo - Bottom Up DP || C++/Java/Python

In this video, I'll talk about how to solve this leetcode 2140. Solving Questions With Brainpower

Solving Questions With Brainpower || 1D DP || Recursion - Memo - Bottom Up DP || C++/Java/Python

Let's Connect:

🛍️ Products I use in Videos: (✨ Marked for Mostly requested Products)

Resources you can try:

🎥Channel Playlists

About Channel:
We teach about how you can grow in life & educate about programming in Fun & Intuitional way.

About Me:
I am Aryan Mittal - a Software Engineer, 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 - Bakwas
0:58 - Problem Explanation
5:12 - Intuition & Logic Building
10:50 - Recursion
13:14 - Memoization
14:20 - Bottom Up DP
21:13 - Bakwas

✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[ARYANMITTAL]

Do try to solve by yourself first ❤ !!

[aaryannaugaraiya]

jb aapne bola na ki bs vo 3-4 word khojo, samagh mein aa jaayega algo, tb hi samagh gya and khud se solve bhi kr dia...
your consistency is awesome 🔥🔥🔥🔥

[tejuschaturvedi]

Awesome explanation and never disappointing . Whenever i move on to your videos, then i know that after this, i don't need to go anywhere else . You are super good .

[tradelikesahil.]

Aryan Bhai, Please code live while making video. So that we can understand it easily.

[benoitblanc-zlrc]

Aryan how to distinguish whether to use greedy or dp in these types of question

[Dineshkumar-wjso]

Hi I have few doubts.
How to build intution if it is 2D dp or 1 D dp.
Second this question is moving dp array from right to left but most of the quesiton in 1D Dp travel from left to right can you explain more resources.