Pascal's Triangle

Challenge Overview

Compute Pascal's triangle up to a given number of rows.

Visit the pascals-triangle exercise on Exercism to read the full instructions and download the exercise files.

Community Solutions

View Community Solutions

The following are the top 3 community solutions by stars:

Solution 1 by @Bliellough (⭐ 0) — View on Exercism
Solution 2 by @ErikSchierboom (⭐ 0) — View on Exercism
Solution 3 by @LuisFigueiredo (⭐ 0) — View on Exercism

Source: Exercism nim/pascals-triangle

💡 View Solution

func pascal*(n: int): seq[seq[int]] =
  var previous, current: seq[int]

  for _ in 1 .. n:
    current.add(1)
    for idx in 1 .. previous.high:
      current[idx] = previous[idx - 1] + previous[idx]
    result.add(current)
    previous = current