R

E

A

C

T

O

xamples 

epeat

ode

pproach

ptimize

est

{Pascal's Triangle}

Problem

Given a value, n, construct a flat array of the values in Pascal's Triangle to that depth.

The approach

1. Start with an empty array to hold your values.

2. Iterate n times (the depth of the triangle)

3. In a nested for-loop, iterate i + 1 times (each row has i + 1 elements)

4. Insert a 1 if you are at an edge, otherwise calculate an interior value

One Solution

Another Solution

Conclusion  

Solution : https://repl.it/BhFY/1

Solution (Binomial): https://repl.it/BhIQ