diff --git a/curriculum/challenges/english/blocks/lab-nth-fibonacci-number-js/7a97b79c096ecb000d03bd36.md b/curriculum/challenges/english/blocks/lab-nth-fibonacci-number-js/7a97b79c096ecb000d03bd36.md
index 807bb0dda19..9e4a3d331c8 100644
--- a/curriculum/challenges/english/blocks/lab-nth-fibonacci-number-js/7a97b79c096ecb000d03bd36.md
+++ b/curriculum/challenges/english/blocks/lab-nth-fibonacci-number-js/7a97b79c096ecb000d03bd36.md
@@ -13,9 +13,9 @@ dashedName: build-an-nth-fibonacci-number-calculator
 
 1. You should create a function named `fibonacci`.
 2. You should define an array named `sequence` within the `fibonacci` function, and it should be initialized with the values `[0, 1]`.
-3. The `fibonacci` function should accept one parameter, a positive integer `n`.
+3. The `fibonacci` function should accept one parameter, a non-negative integer `n`.
 4. Calling `fibonacci(n)` should use a dynamic programming approach to compute and return the `n`-th number from the Fibonacci sequence, where each number is the sum of the two preceding numbers.
-5. Each computed number at the position `n` in the Fibonacci sequence should be stored in the `sequence` array at index `n - 1`.
+5. Each computed Fibonacci number should be appended to the `sequence` array.
 
 # --hints--
 
diff --git a/curriculum/challenges/english/blocks/lab-nth-fibonacci-number/68de7360e1832ea180577a8a.md b/curriculum/challenges/english/blocks/lab-nth-fibonacci-number/68de7360e1832ea180577a8a.md
index 02e2ea3991b..330b1ed2f73 100644
--- a/curriculum/challenges/english/blocks/lab-nth-fibonacci-number/68de7360e1832ea180577a8a.md
+++ b/curriculum/challenges/english/blocks/lab-nth-fibonacci-number/68de7360e1832ea180577a8a.md
@@ -13,9 +13,9 @@ dashedName: build-an-nth-fibonacci-number-calculator
 
 1. You should create a function named `fibonacci`.
 2. You should define a list named `sequence` within the `fibonacci` function, and it should be initialized with the values `[0, 1]`.
-3. The `fibonacci` function should accept one parameter, a positive integer `n`.  
+3. The `fibonacci` function should accept one parameter, a non-negative integer `n`.  
 4. Calling `fibonacci(n)` should use a dynamic programming approach to compute and return the `n`-th number from the Fibonacci sequence, where each number is the sum of the two preceding numbers.
-5. Each computed number at the position `n` in the Fibonacci sequence should be stored in the `sequence` list at index `n - 1`.
+5. Each computed Fibonacci number should be appended to the `sequence` list.
 
 # --hints--