diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.english.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.english.md
index 7e1ce76febb..3aef224e52d 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.english.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.english.md
@@ -32,7 +32,7 @@ tests:
     testString: assert.deepEqual(maximumSubsequence([0, 8, 10, -2, -4, -1, -5, -3]), [ 0, 8, 10 ]);
   - text: <code>maximumSubsequence([ 9, 9, -10, 1 ])</code> should return <code>[ 9, 9 ]</code>.
     testString: assert.deepEqual(maximumSubsequence([ 9, 9, -10, 1 ]), [ 9, 9 ]);
-  - text: <code>maximumSubsequence([ 7, 1, -5, -3, -8, 1 ]</code> should return <code>[ 7, 1 ]</code>.
+  - text: <code>maximumSubsequence([ 7, 1, -5, -3, -8, 1 ])</code> should return <code>[ 7, 1 ]</code>.
     testString: assert.deepEqual(maximumSubsequence([ 7, 1, -5, -3, -8, 1 ]), [ 7, 1 ]);
   - text: <code>maximumSubsequence([ -3, 6, -1, 4, -4, -6 ])</code> should return <code>[ 6, -1, 4 ]</code>.
     testString: assert.deepEqual(maximumSubsequence([ -3, 6, -1, 4, -4, -6 ]), [ 6, -1, 4 ]);
@@ -73,7 +73,6 @@ function maximumSubsequence(population) {
   }
   var greatest;
   var maxValue = 0;
-  var subsequence = [];
 
   for (var i = 0, len = population.length; i < len; i++) {
       for (var j = i; j <= len; j++) {