diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.english.md
index 94db84c92ec..980b72020ca 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.english.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.english.md
@@ -23,8 +23,6 @@ Let's create one more method for our doubly linked list called reverse which rev
 tests:
   - text: The DoublyLinkedList data structure should exist.
     testString: assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; return (typeof test == 'object')})());
-  - text: The DoublyLinkedList should have a method called add.
-    testString: assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; if (test.add == undefined) { return false; }; return (typeof test.add == 'function')})());
   - text: The DoublyLinkedList should have a method called reverse.
     testString: assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; if (test.reverse == undefined) { return false; }; return (typeof test.reverse == 'function')})());
   - text: Reversing an empty list should return null.