Stone Game | Simple Strategy | 2 Approaches | Leetcode 877 | codestorywithMIK

This video was discovered through MyVideoLibrary, a public long-form video discovery platform using official YouTube embeds.

Hi Everyone, this is the 149th video of our Playlist "Dynamic Programming : Popular Interview Problems" by codestorywithMIK. Today we will be solving a good problem based on DP Game Strategy : Stone Game | Simple Strategy | 2 Approaches | Leetcode 877 | codestorywithMIK Problem Name : Stone Game | Simple Strategy | 2 Approaches | Leetcode 877 | codestorywithMIK Company Tags : will update later My solutions on Github(C++ & JAVA) : My DP Concepts Playlist : My Graph Concepts Playlist : My Segment Tree Concepts Playlist : My Recursion Concepts Playlist : Difference Array Technique: Concepts & Qns : My Line Sweep Technique Playlist : Small Java Dopamine Videos : My GitHub Repo for interview preparation : Approach 1 (Recursion + Memoization) treats the game as: on your turn you grab either the left or right pile, then your opponent — assumed to play optimally — moves next. Since the opponent will always leave you the worse of the two remaining options, you take min over their choices and m...