Tracks
/
Scheme
Scheme
/
Exercises
/
Pascals Triangle
Pascals Triangle

Pascals Triangle

Medium

Instructions

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

In Pascal's Triangle each number is computed by adding the numbers to the right and left of the current position in the previous row.

    1
   1 1
  1 2 1
 1 3 3 1
1 4 6 4 1
# ... etc

Running and testing your solutions

From the command line

Simply type make chez if you're using ChezScheme or make guile if you're using GNU Guile. Sometimes the name for the scheme binary on your system will differ from the defaults. When this is the case, you'll need to tell make by running make chez chez=your-chez-binary or make guile guile=your-guile-binary.

From a REPL

  • Enter (load "test.scm") at the repl prompt.
  • Develop your solution in pascals-triangle.scm reloading as you go.
  • Run (test) to check your solution.

Failed Test Cases

If some of the test cases fail, you should see the failing input and the expected output. The failing input is presented as a list because the tests call your solution by (apply pascals-triangle input-list). To learn more about apply see The Scheme Programming Language -- Chapter 5

Last updated 16 June 2022
Edit via GitHub The link opens in a new window or tab
Scheme Exercism

Ready to start Pascals Triangle?

Sign up to Exercism to learn and master Scheme with 39 exercises, and real human mentoring, all for free.