We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent f9bbd25 commit fc4bd94Copy full SHA for fc4bd94
19_pascal/README.md
@@ -13,5 +13,6 @@ Fourth row: `[0+1, 1+2, 2+1, 1+0]` or simply `[1, 3, 3, 1]`
13
14
The pattern continues forever.
15
16
-Your task is to create a *recursive* function, `pascal` - that will take an input `n` and output the
17
-`n`th pascal's row.
+Your task is to create a *recursive* function, `pascal` - that will take an input `n` and output the `n`th pascal's row as an array of numbers.
+
18
+For example, `pascal(3)` should return `[1, 2, 1]`.
0 commit comments