Pascal's Triangle II | Leetcode | Data Structures and Algorithms

In this video, I will go over the solution of the Leetcode problem, "Pascal's Triangle II". Lately, I've been studying data structures and algorithms in preparation for FAANG technical interviews. I will do a lot more in this series in the next couple of months, so come join the fam and the journey.

The pascal's triangle is the fifth problem of this journey of learning algorithms better. There are other techniques I want to get familiar with because I know they will assist in optimizing the algorithms I write with them. I also used a technique called "Memoization" to reduce duplicate calculations in this video.

The programming language of choice is java. I think java is an easy language to understand and to do coding interviews with it.

Chapters:
00:00 Intro
00:26 Read the Prompt
00:44 Example #1
00:54 Example #2
01:03 Example #3
01:12 Constraints
01:18 Step #1
01:42 Step #2
02:22 Step #3
02:52 Step #4-5
04:01 Step #6
04:44 Step #7
05:32 First Submission | B - roll
05:39 Why it failed?
06:10 Memoization technique explained
06:30 Step #8
06:41 Step #9
07:18 Afterthought...Simplify Implementation
07:31 Step #10
08:15 Step #11
08:36 Second Submission | B - roll
08:44 Complexity Analysis
09:42 Outtro

// Solution to Pascal's Triangle II:
https://github.com/SoftwareJournal/al...