Remove Boxes | A Detailed Explanation of the 3D DP Solution скачать в хорошем качестве

Remove Boxes | A Detailed Explanation of the 3D DP Solution

LeetCode: 546. Remove Boxes. A hard problem, 3D DP Solution. I attempt to explain it simply. Fun! The goal is to return the maximum points we can get. Since we can't know what's the best answer at any point, we'll use recursion to help us look into the future. I also explain how greedily picking the longest same element sequence is the most optimal. Then, we move onto the 3 dimensional part of the problem. It was a 2D DP up till now, but looking at a special test case, makes us think that it is not enough. So, how about 3D DP? Let's jump into it! 0:00 General discussion 0:20 Problem discussion and core observations 3:17 Visual Explanation of a test case 4:11 Code (first part) + Explanation 8:37 Visual of a tricky test case 10:56 Code (complete) + Explanation 14:56 Discussion Problem: https://leetcode.com/problems/remove-... My writeup: https://leetcode.com/problems/remove-... Hiepit's writeup: https://leetcode.com/problems/remove-... ================================================== Stuff I use: My mic: https://amzn.to/3Fsx1Ok My laptop: https://amzn.to/3oHfqw4 My headphones: https://amzn.to/3BrwTfI My pen-tablet: https://amzn.to/3lCIZx6 NOTE: These are affiliate links. Doesn't cost you anything Gives me a kickback if you buy this (or, anything on Amazon) using this link in the next 24 hours :) ================================================== Follow: LeetCode: https://leetcode.com/chaudhary1337/ GitHub: https://github.com/chaudhary1337 LinkedIn:   / tanishq-chaudhary-a2035119b   My Website: https://chaudhary1337.com/ My (old) Website: http://chaudhary1337.github.io/ #LeetCode #coding #programming #chaudhary1337 ==================================================