LeetCode 119: Pascal's Triangle II - Interview Prep Ep 28

⭐ Shop on Amazon to support me: https://www.amazon.com/?tag=fishercoder0f-20 ⭐ NordVPN to protect your online privacy: https://go.nordvpn.net/aff_c?offer_id=15&aff_id=82405&url_id=902 ⭐ NordPass to help manage all of your passwords: https://go.nordpass.io/aff_c?offer_id=488&aff_id=82405&url_id=9356 LeetCode 119. Pascal's Triangle II: https://leetcode.com/problems/pascals-triangle-ii/ Solution explained: 1. We can build the solution from the very smallest array [1] up to rowIndex 2. Every time, we always add one to the head of the current list, and then reset the values in between to the correct ones by adding up the two nodes right above it. ⭐ Support my channel and connect with me: https://www.youtube.com/channel/UCPL5uAbYQ40HwAdOe4ikI0w/join // TOOLS THAT I USE: ○ Memory Foam Set Keyboard Wrist Rest Pad - https://amzn.to/3cOGOAj ○ Electric Height Adjustable Standing Desk - https://amzn.to/2S9YexJ ○ Apple Magic Keyboard (Wireless, Rechargable) - https://amzn.to/36gy5FJ ○ Apple Magic Trackpad 2 (Wireless, Rechargable) - https://amzn.to/36ltimu ○ Apple MacBook Pro - https://amzn.to/30iSvKE ○ All-In One Printer - https://amzn.to/34etmSi ○ Apple AirPods Pro - https://amzn.to/2GpVYQf ○ My new favorite Apple Watch - https://amzn.to/2EIIUFd // MY FAVORITE BOOKS: ○ Introduction to Algorithms - https://amzn.to/36hxHXD ○ Designing Data-Intensive Applications - https://amzn.to/2S7snOg ○ Head First Java - https://amzn.to/2ScLDKa ○ Design Patterns - https://amzn.to/2SaGeU2 Follow me on Github for complete LeetCode solutions: https://github.com/fishercoder1534/Leetcode Support me on Patreon: https://www.patreon.com/fishercoder My ENTIRE Programming Equipment and Computer Science Bookshelf: https://www.amazon.com/shop/fishercoder And make sure you subscribe to my channel! Your comments/thoughts/questions/advice will be greatly appreciated! #softwareengineering #leetcode #algorithms #coding #interview #SDE #SWE #SiliconValley #programming #datastructures