⭐ Shop on Amazon to support me: [ Ссылка ]
⭐ NordVPN to protect your online privacy: [ Ссылка ]
⭐ NordPass to help manage all of your passwords: [ Ссылка ]

LeetCode 119. Pascal's 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:
[ Ссылка ]

// TOOLS THAT I USE:
○ Memory Foam Set Keyboard Wrist Rest Pad - [ Ссылка ]
○ Electric Height Adjustable Standing Desk - [ Ссылка ]
○ Apple Magic Keyboard (Wireless, Rechargable) - [ Ссылка ]
○ Apple Magic Trackpad 2 (Wireless, Rechargable) - [ Ссылка ]
○ Apple MacBook Pro - [ Ссылка ]
○ All-In One Printer - [ Ссылка ]
○ Apple AirPods Pro - [ Ссылка ]
○ My new favorite Apple Watch - [ Ссылка ]

// MY FAVORITE BOOKS:
○ Introduction to Algorithms - [ Ссылка ]
○ Designing Data-Intensive Applications - [ Ссылка ]
○ Head First Java - [ Ссылка ]
○ Design Patterns - [ Ссылка ]



Follow me on Github for complete LeetCode solutions: [ Ссылка ]

Support me on Patreon: [ Ссылка ]

My ENTIRE Programming Equipment and Computer Science Bookshelf:
[ Ссылка ]


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

свернуть