1717. Maximum Score From Removing Substrings | Why not DP | Greedy | Stack | 2 Pointer | 2 Approach

In this video, I'll talk about how to solve Leetcode 1717. Maximum Score From Removing Substrings | Why not DP | Greedy | Stack | 2 Pointer | 2 Approaches

Let's Connect:
📱Discord (Join Community) :   / discord  

📝Linkedin:   / aryan-mittal-0077  
📸 Instagram:   / codewitharyanbhai  
💻 Twitter -   / aryan_mittal007  
🤖 Github: https://github.com/aryan-0077

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 - Spoiler & Bhek
00:45 - Problem Explanation
1:31 - DP Approach
3:44 - Why Stack?
8:00 - Why Greedy ? (Proof)
11:03 - Stack & Greedy Dry Run
14:00 - Code Explanation
18:46 - 2 Pointer Dry Run
27:52 - Code Explanation

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