diff --git a/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-bubble-sort.english.md b/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-bubble-sort.english.md index f8ee7af419..f9dac5ca30 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-bubble-sort.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-bubble-sort.english.md @@ -44,9 +44,9 @@ tests: ```js function bubbleSort(array) { - // change code below this line + // Only change code below this line return array; - // change code above this line + // Only change code above this line } bubbleSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]); diff --git a/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-insertion-sort.english.md b/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-insertion-sort.english.md index 64095cfea2..e04678d15e 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-insertion-sort.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-insertion-sort.english.md @@ -42,9 +42,9 @@ tests: ```js function insertionSort(array) { - // change code below this line + // Only change code below this line return array; - // change code above this line + // Only change code above this line } insertionSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]); diff --git a/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-merge-sort.english.md b/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-merge-sort.english.md index 452043c8a9..7c088f58c1 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-merge-sort.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-merge-sort.english.md @@ -46,10 +46,9 @@ tests: ```js function mergeSort(array) { - // change code below this line - - // change code above this line + // Only change code below this line return array; + // Only change code above this line } mergeSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]); diff --git a/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-quick-sort.english.md b/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-quick-sort.english.md index 8019954cfe..edae31c600 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-quick-sort.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-quick-sort.english.md @@ -10,7 +10,6 @@ forumTopicId: 301615 Here we will move on to an intermediate sorting algorithm: quick sort. Quick sort is an efficient, recursive divide-and-conquer approach to sorting an array. In this method, a pivot value is chosen in the original array. The array is then partitioned into two subarrays of values less than and greater than the pivot value. We then combine the result of recursively calling the quick sort algorithm on both sub-arrays. This continues until the base case of an empty or single-item array is reached, which we return. The unwinding of the recursive calls return us the sorted array. Quick sort is a very efficient sorting method, providing O(nlog(n)) performance on average. It is also relatively easy to implement. These attributes make it a popular and useful sorting method. Instructions: Write a function quickSort which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest. While the choice of the pivot value is important, any pivot will do for our purposes here. For simplicity, the first or last element could be used. -Note:
We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging array to see your sorting algorithm in action! ## Instructions @@ -27,7 +26,7 @@ tests: testString: assert(typeof quickSort == 'function'); - text: quickSort should return a sorted array (least to greatest). testString: assert(isSorted(quickSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]))); - - text: quickSort should return an array that is unchanged except for order. + - text: quickSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]) should return an array that is unchanged except for order. testString: assert.sameMembers(quickSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]); - text: quickSort should not use the built-in .sort() method. testString: assert(isBuiltInSortUsed()); @@ -43,14 +42,10 @@ tests: ```js function quickSort(array) { - // change code below this line - - // change code above this line + // Only change code below this line return array; + // Only change code above this line } - -// test array: -// [1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92] ``` @@ -106,9 +101,6 @@ function quickSort(array) { return [...quickSort(lesser), ...equal, ...quickSort(greater)]; } } - -// test array: -// [1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92] ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-selection-sort.english.md b/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-selection-sort.english.md index eebce42c40..025f25b222 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-selection-sort.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/algorithms/implement-selection-sort.english.md @@ -42,9 +42,9 @@ tests: ```js function selectionSort(array) { - // change code below this line + // Only change code below this line return array; - // change code above this line + // Only change code above this line } diff --git a/curriculum/challenges/english/10-coding-interview-prep/algorithms/inventory-update.english.md b/curriculum/challenges/english/10-coding-interview-prep/algorithms/inventory-update.english.md index b8ca781f12..e2e730ccfd 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/algorithms/inventory-update.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/algorithms/inventory-update.english.md @@ -44,7 +44,6 @@ tests: ```js function updateInventory(arr1, arr2) { - // All inventory must be accounted for or you're fired! return arr1; } diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.english.md index 480f8ae913..7581ca6710 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.english.md @@ -53,8 +53,9 @@ function Node(value) { } function BinarySearchTree() { this.root = null; - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/breadth-first-search.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/breadth-first-search.english.md index 14ac244f21..df27563137 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/breadth-first-search.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/breadth-first-search.english.md @@ -56,7 +56,6 @@ tests: ```js function bfs(graph, root) { - // Distance object returned var nodesLen = {}; return nodesLen; @@ -112,7 +111,6 @@ function isEquivalent(a, b) { ```js function bfs(graph, root) { - // Distance object returned var nodesLen = {}; // Set all distances to infinity for (var i = 0; i < graph.length; i++) { diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.english.md index 246689953b..e97d744951 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.english.md @@ -49,8 +49,9 @@ function Node(value) { } function BinarySearchTree() { this.root = null; - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/check-if-binary-search-tree.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/check-if-binary-search-tree.english.md index 01c059a64f..de3259d819 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/check-if-binary-search-tree.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/check-if-binary-search-tree.english.md @@ -47,8 +47,9 @@ function BinarySearchTree() { this.root = null; } function isBinarySearchTree(tree) { - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.english.md index c3bc59a6a9..ed060dfd37 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.english.md @@ -56,8 +56,9 @@ var Node = function(data, prev) { var DoublyLinkedList = function() { this.head = null; this.tail = null; - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line }; ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-hash-table.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-hash-table.english.md index 90e8806806..ba1fb03f65 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-hash-table.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-hash-table.english.md @@ -59,8 +59,9 @@ var hash = string => { }; var HashTable = function() { this.collection = {}; - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line }; ``` @@ -105,7 +106,7 @@ var hash = (string) => { }; var HashTable = function() { this.collection = {}; - // change code below this line + // Only change code below this line this.add = function(key, val) { var theHash = hash(key); @@ -133,7 +134,7 @@ var HashTable = function() { } return null } - // change code above this line + // Only change code above this line }; ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-map-data-structure.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-map-data-structure.english.md index 77cd82138f..5694b4b0b8 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-map-data-structure.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-map-data-structure.english.md @@ -58,8 +58,9 @@ tests: ```js var Map = function() { this.collection = {}; - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line }; ``` @@ -72,7 +73,7 @@ var Map = function() { ```js var Map = function() { this.collection = {}; - // change code below this line + // Only change code below this line this.add = function(key,value) { this.collection[key] = value; @@ -103,7 +104,7 @@ var Map = function() { delete this.collection[item]; } } - // change code above this line + // Only change code above this line }; ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-set-class.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-set-class.english.md index a6f9627c56..3524fd98a7 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-set-class.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-set-class.english.md @@ -82,20 +82,14 @@ class Set { return this.dictionary[element] !== undefined; } - // This method will return all the values in the set as an array + // This method will return all the values in the set values() { return Object.keys(this.dictionary); } - // change code below this line + // Only change code below this line - // write your add method here - - // write your remove method here - - // write your size method here - - // change code above this line + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-trie-search-tree.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-trie-search-tree.english.md index fad397c0f3..93a5d6cd8a 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-trie-search-tree.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-a-trie-search-tree.english.md @@ -57,8 +57,9 @@ var Node = function() { }; }; var Trie = function() { - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line }; ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.english.md index 675d4fb198..6832f2f140 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.english.md @@ -43,7 +43,7 @@ tests:
```js -// change code below this line + ```
diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.english.md index 0682d977c6..406c6318ee 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.english.md @@ -54,9 +54,9 @@ tests: ```js function checkSet() { var set = new Set([1, 2, 3, 3, 2, 1, 2, 3, 1]); - // change code below this line + // Only change code below this line - // change code above this line + // Only change code above this line console.log(Array.from(set)); return set; } diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.english.md index e54507d00d..54e4859279 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.english.md @@ -58,7 +58,7 @@ function Node(value) { function BinarySearchTree() { this.root = null; - // case 1: target has no children, change code below this line + // Only change code below this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.english.md index 1d20c1e688..2e07a766a2 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.english.md @@ -61,7 +61,7 @@ function BinarySearchTree() { } var target; var parent = null; - // find the target value and its parent + // Find the target value and its parent (function findValue(node = this.root) { if (value == node.value) { target = node; @@ -80,10 +80,10 @@ function BinarySearchTree() { if (target === null) { return null; } - // count the children of the target to delete + // Count the children of the target to delete var children = (target.left !== null ? 1 : 0) + (target.right !== null ? 1 : 0); - // case 1: target has no children + // Case 1: Target has no children if (children === 0) { if (target == this.root) { this.root = null; @@ -95,7 +95,8 @@ function BinarySearchTree() { } } } - // case 2: target has one child, change code below this line + // Case 2: Target has one child + // Only change code below this line }; } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.english.md index a7e48c8dc4..3afc6da182 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.english.md @@ -66,7 +66,7 @@ function BinarySearchTree() { } var target; var parent = null; - // find the target value and its parent + // Find the target value and its parent (function findValue(node = this.root) { if (value == node.value) { target = node; @@ -85,10 +85,10 @@ function BinarySearchTree() { if (target === null) { return null; } - // count the children of the target to delete + // Count the children of the target to delete var children = (target.left !== null ? 1 : 0) + (target.right !== null ? 1 : 0); - // case 1: target has no children + // Case 1: Target has no children if (children === 0) { if (target == this.root) { this.root = null; @@ -100,7 +100,7 @@ function BinarySearchTree() { } } } - // case 2: target has one child + // Case 2: Target has one child else if (children == 1) { var newChild = target.left !== null ? target.left : target.right; if (parent === null) { @@ -114,7 +114,8 @@ function BinarySearchTree() { } target = null; } - // case 3: target has two children, change code below this line + // Case 3: Target has two children + // Only change code below this line }; } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.english.md index 41021e359c..db08d488a1 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.english.md @@ -55,8 +55,9 @@ function Node(value) { } function BinarySearchTree() { this.root = null; - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line } ``` @@ -117,8 +118,9 @@ function Node(value) { } function BinarySearchTree() { this.root = null; - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line this.findMinHeight = function(root = this.root) { // empty tree. if (root === null) { diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.english.md index 2141c693e7..a32fd641bb 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.english.md @@ -50,8 +50,9 @@ function Node(value) { } function BinarySearchTree() { this.root = null; - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.english.md index bec8ea6749..656caba3d5 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.english.md @@ -41,22 +41,22 @@ tests:
```js -// check if array is sorted function isSorted(a){ for(let i = 0; i < a.length - 1; i++) if(a[i] > a[i + 1]) return false; return true; } -// generate a randomly filled array +// Generate a randomly filled array var array = new Array(); (function createArray(size = 5) { array.push(+(Math.random() * 100).toFixed(0)); return size > 1 ? createArray(size - 1) : undefined; })(25); var MinHeap = function() { - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line }; ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.english.md index ca6a7c58fd..44fc166063 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.english.md @@ -55,8 +55,9 @@ tests: ```js var MaxHeap = function() { - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line }; ``` @@ -68,7 +69,7 @@ var MaxHeap = function() { ```js var MaxHeap = function() { - // change code below this line + // Only change code below this line this.heap = [null]; this.insert = (ele) => { var index = this.heap.length; @@ -84,7 +85,7 @@ var MaxHeap = function() { this.print = () => { return this.heap.slice(1); } - // change code above this line + // Only change code above this line }; ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/invert-a-binary-tree.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/invert-a-binary-tree.english.md index 318f55e2ea..468812017f 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/invert-a-binary-tree.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/invert-a-binary-tree.english.md @@ -46,8 +46,9 @@ function Node(value) { } function BinarySearchTree() { this.root = null; - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line } ``` @@ -127,7 +128,7 @@ function Node(value) { } function BinarySearchTree() { this.root = null; - // change code below this line + // Only change code below this line this.invert = function(node = this.root) { if (node) { const temp = node.left; @@ -138,7 +139,7 @@ function BinarySearchTree() { } return node; } - // change code above this line + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.english.md index 4f22b89699..26871de8d1 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.english.md @@ -42,15 +42,15 @@ class Set { this.dictionary = {}; this.length = 0; } - // this method will check for the presence of an element and return true or false + // This method will check for the presence of an element and return true or false has(element) { return this.dictionary[element] !== undefined; } - // this method will return all the values in the set + // This method will return all the values in the set values() { return Object.keys(this.dictionary); } - // this method will add an element to the set + // This method will add an element to the set add(element) { if (!this.has(element)) { this.dictionary[element] = true; @@ -60,7 +60,7 @@ class Set { return false; } - // this method will remove an element from a set + // This method will remove an element from a set remove(element) { if (this.has(element)) { delete this.dictionary[element]; @@ -70,11 +70,11 @@ class Set { return false; } - // this method will return the size of the set + // This method will return the size of the set size() { return this.length; } - // This is our union method from that lesson + // This is our union method union(set) { const newSet = new Set(); this.values().forEach(value => { @@ -86,7 +86,7 @@ class Set { return newSet; } - // This is our intersection method from that lesson + // This is our intersection method intersection(set) { const newSet = new Set(); @@ -108,8 +108,9 @@ class Set { return newSet; } - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.english.md index 98e55cf99d..f918d0b32e 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.english.md @@ -49,15 +49,15 @@ class Set { this.dictionary = {}; this.length = 0; } - // this method will check for the presence of an element and return true or false + // This method will check for the presence of an element and return true or false has(element) { return this.dictionary[element] !== undefined; } - // this method will return all the values in the set + // This method will return all the values in the set values() { return Object.keys(this.dictionary); } - // this method will add an element to the set + // This method will add an element to the set add(element) { if (!this.has(element)) { this.dictionary[element] = true; @@ -67,7 +67,7 @@ class Set { return false; } - // this method will remove an element from a set + // This method will remove an element from a set remove(element) { if (this.has(element)) { delete this.dictionary[element]; @@ -77,11 +77,11 @@ class Set { return false; } - // this method will return the size of the set + // This method will return the size of the set size() { return this.length; } - // This is our union method from that lesson + // This is our union method union(set) { const newSet = new Set(); this.values().forEach(value => { @@ -93,7 +93,7 @@ class Set { return newSet; } - // This is our intersection method from that lesson + // This is our intersection method intersection(set) { const newSet = new Set(); @@ -115,7 +115,7 @@ class Set { return newSet; } - // This is our difference method from that lesson + difference(set) { const newSet = new Set(); @@ -127,8 +127,9 @@ class Set { return newSet; } - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.english.md index f5c7f3e0c3..b837ea33f2 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.english.md @@ -40,15 +40,15 @@ class Set { this.dictionary = {}; this.length = 0; } - // this method will check for the presence of an element and return true or false + // This method will check for the presence of an element and return true or false has(element) { return this.dictionary[element] !== undefined; } - // this method will return all the values in the set + // This method will return all the values in the set values() { return Object.keys(this.dictionary); } - // this method will add an element to the set + // This method will add an element to the set add(element) { if (!this.has(element)) { this.dictionary[element] = true; @@ -58,7 +58,7 @@ class Set { return false; } - // this method will remove an element from a set + // This method will remove an element from a set remove(element) { if (this.has(element)) { delete this.dictionary[element]; @@ -68,13 +68,13 @@ class Set { return false; } - // this method will return the size of the set + // This method will return the size of the set size() { return this.length; } - // change code below this line + // Only change code below this line - // change code above this line + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.english.md index 1e41fc3245..bb6798e34b 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.english.md @@ -41,15 +41,15 @@ class Set { this.dictionary = {}; this.length = 0; } - // this method will check for the presence of an element and return true or false + // This method will check for the presence of an element and return true or false has(element) { return this.dictionary[element] !== undefined; } - // this method will return all the values in the set + // This method will return all the values in the set values() { return Object.keys(this.dictionary); } - // this method will add an element to the set + // This method will add an element to the set add(element) { if (!this.has(element)) { this.dictionary[element] = true; @@ -59,7 +59,7 @@ class Set { return false; } - // this method will remove an element from a set + // This method will remove an element from a set remove(element) { if (this.has(element)) { delete this.dictionary[element]; @@ -69,11 +69,11 @@ class Set { return false; } - // this method will return the size of the set + // This method will return the size of the set size() { return this.length; } - // This is our union method from that lesson + // This is our union method union(set) { const newSet = new Set(); this.values().forEach(value => { @@ -85,8 +85,9 @@ class Set { return newSet; } - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.english.md index 5f199373fc..6b24544506 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.english.md @@ -61,9 +61,9 @@ var MaxHeap = function() { this.print = () => { return this.heap.slice(1); } - // change code below this line + // Only change code below this line - // change code above this line + // Only change code above this line }; ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.english.md index 7c8aa9808d..b2e53a4bbe 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.english.md @@ -52,7 +52,7 @@ function LinkedList() { var length = 0; var head = null; - var Node = function(element){ // {1} + var Node = function(element){ this.element = element; this.next = null; }; @@ -100,7 +100,7 @@ function LinkedList() { var length = 0; var head = null; - var Node = function (element) { // {1} + var Node = function (element) { this.element = element; this.next = null; }; diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.english.md index 884aaa2f3c..43a32e198d 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.english.md @@ -43,10 +43,7 @@ tests: ```js function checkSet(){ - var set = //Create a set with values 1, 2, 3, 4, & 5 - //Remove the value 2 - //Remove the value 5 - //Return the set + var set = null; return set; } ``` 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 37ab559c2e..3cd0b48021 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 @@ -49,8 +49,9 @@ var Node = function(data, prev) { var DoublyLinkedList = function() { this.head = null; this.tail = null; - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line }; ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/search-within-a-linked-list.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/search-within-a-linked-list.english.md index 8a1024fe9e..5d079cf4ce 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/search-within-a-linked-list.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/search-within-a-linked-list.english.md @@ -55,7 +55,7 @@ function LinkedList() { var length = 0; var head = null; - var Node = function(element){ // {1} + var Node = function(element){ this.element = element; this.next = null; }; @@ -120,7 +120,7 @@ function LinkedList() { var length = 0; var head = null; - var Node = function(element){ // {1} + var Node = function(element){ this.element = element; this.next = null; }; diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.english.md index 335359438a..e6bc755b6b 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.english.md @@ -40,13 +40,11 @@ tests: ```js function checkSet(arrToBeSet, checkValue){ - // change code below this line + // Only change code below this line - // change code above this line + // Only change code above this line } - -checkSet([ 1, 2, 3], 2); // Should return [ true, 3 ] ```
diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.english.md index 2ec80e96e9..72e56cb86f 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.english.md @@ -53,8 +53,9 @@ function Node(value) { } function BinarySearchTree() { this.root = null; - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line } ``` @@ -114,7 +115,7 @@ function Node(value) { } function BinarySearchTree() { this.root = null; - // change code below this line + // Only change code below this line this.levelOrder = (root = this.root) => { if(!root) return null; let queue = [root]; @@ -140,7 +141,7 @@ function BinarySearchTree() { } return results; } - // change code above this line + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.english.md index 914799aab3..eeb4284770 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.english.md @@ -65,8 +65,9 @@ function Node(value) { } function BinarySearchTree() { this.root = null; - // change code below this line - // change code above this line + // Only change code below this line + + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.english.md index 31863a2c87..df997f1bcd 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.english.md @@ -44,9 +44,9 @@ tests: ```js function checkSet(set){ - // change code below this line + // Only change code below this line - // change code above this line + // Only change code above this line } ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.english.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.english.md index e5cd9cd37e..31c324f144 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.english.md @@ -44,10 +44,9 @@ var Kitten = new Node('Kitten'); var Puppy = new Node('Puppy'); Kitten.next = Puppy; -// only add code below this line +// Only change code below this line + -// test your code -console.log(Kitten.next); ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.english.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.english.md index e47c6a604b..bbaeebb6a8 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.english.md @@ -61,7 +61,6 @@ primeSummation(2000000);
```js -//noprotect function primeSummation(n) { if (n < 3) { return 0 }; let nums = [0, 0, 2]; diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.english.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.english.md index e5c7d0d013..24013a7045 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.english.md @@ -59,11 +59,9 @@ tests: ```js function fiboEvenSum(n) { - // You can do it! + return true; } - -fiboEvenSum(10); ``` diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.english.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.english.md index 1bf71d5501..1f35c8d27b 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.english.md @@ -53,7 +53,7 @@ function codedTriangleNumbers(n) { return 1; } -// only change code above this line +// Only change code above this line const words = ['A','ABILITY','ABLE','ABOUT','ABOVE','ABSENCE','ABSOLUTELY','ACADEMIC','ACCEPT','ACCESS','ACCIDENT','ACCOMPANY','ACCORDING','ACCOUNT','ACHIEVE','ACHIEVEMENT','ACID','ACQUIRE','ACROSS','ACT','ACTION','ACTIVE','ACTIVITY','ACTUAL','ACTUALLY','ADD','ADDITION','ADDITIONAL','ADDRESS','ADMINISTRATION','ADMIT','ADOPT','ADULT','ADVANCE','ADVANTAGE','ADVICE','ADVISE','AFFAIR','AFFECT','AFFORD','AFRAID','AFTER','AFTERNOON','AFTERWARDS','AGAIN','AGAINST','AGE','AGENCY','AGENT','AGO','AGREE','AGREEMENT','AHEAD','AID','AIM','AIR','AIRCRAFT','ALL','ALLOW','ALMOST','ALONE','ALONG','ALREADY','ALRIGHT','ALSO','ALTERNATIVE','ALTHOUGH','ALWAYS','AMONG','AMONGST','AMOUNT','AN','ANALYSIS','ANCIENT','AND','ANIMAL','ANNOUNCE','ANNUAL','ANOTHER','ANSWER','ANY','ANYBODY','ANYONE','ANYTHING','ANYWAY','APART','APPARENT','APPARENTLY','APPEAL','APPEAR','APPEARANCE','APPLICATION','APPLY','APPOINT','APPOINTMENT','APPROACH','APPROPRIATE','APPROVE','AREA','ARGUE','ARGUMENT','ARISE','ARM','ARMY','AROUND','ARRANGE','ARRANGEMENT','ARRIVE','ART','ARTICLE','ARTIST','AS','ASK','ASPECT','ASSEMBLY','ASSESS','ASSESSMENT','ASSET','ASSOCIATE','ASSOCIATION','ASSUME','ASSUMPTION','AT','ATMOSPHERE','ATTACH','ATTACK','ATTEMPT','ATTEND','ATTENTION','ATTITUDE','ATTRACT','ATTRACTIVE','AUDIENCE','AUTHOR','AUTHORITY','AVAILABLE','AVERAGE','AVOID','AWARD','AWARE','AWAY','AYE','BABY','BACK','BACKGROUND','BAD','BAG','BALANCE','BALL','BAND','BANK','BAR','BASE','BASIC','BASIS','BATTLE','BE','BEAR','BEAT','BEAUTIFUL','BECAUSE','BECOME','BED','BEDROOM','BEFORE','BEGIN','BEGINNING','BEHAVIOUR','BEHIND','BELIEF','BELIEVE','BELONG','BELOW','BENEATH','BENEFIT','BESIDE','BEST','BETTER','BETWEEN','BEYOND','BIG','BILL','BIND','BIRD','BIRTH','BIT','BLACK','BLOCK','BLOOD','BLOODY','BLOW','BLUE','BOARD','BOAT','BODY','BONE','BOOK','BORDER','BOTH','BOTTLE','BOTTOM','BOX','BOY','BRAIN','BRANCH','BREAK','BREATH','BRIDGE','BRIEF','BRIGHT','BRING','BROAD','BROTHER','BUDGET','BUILD','BUILDING','BURN','BUS','BUSINESS','BUSY','BUT','BUY','BY','CABINET','CALL','CAMPAIGN','CAN','CANDIDATE','CAPABLE','CAPACITY','CAPITAL','CAR','CARD','CARE','CAREER','CAREFUL','CAREFULLY','CARRY','CASE','CASH','CAT','CATCH','CATEGORY','CAUSE','CELL','CENTRAL','CENTRE','CENTURY','CERTAIN','CERTAINLY','CHAIN','CHAIR','CHAIRMAN','CHALLENGE','CHANCE','CHANGE','CHANNEL','CHAPTER','CHARACTER','CHARACTERISTIC','CHARGE','CHEAP','CHECK','CHEMICAL','CHIEF','CHILD','CHOICE','CHOOSE','CHURCH','CIRCLE','CIRCUMSTANCE','CITIZEN','CITY','CIVIL','CLAIM','CLASS','CLEAN','CLEAR','CLEARLY','CLIENT','CLIMB','CLOSE','CLOSELY','CLOTHES','CLUB','COAL','CODE','COFFEE','COLD','COLLEAGUE','COLLECT','COLLECTION','COLLEGE','COLOUR','COMBINATION','COMBINE','COME','COMMENT','COMMERCIAL','COMMISSION','COMMIT','COMMITMENT','COMMITTEE','COMMON','COMMUNICATION','COMMUNITY','COMPANY','COMPARE','COMPARISON','COMPETITION','COMPLETE','COMPLETELY','COMPLEX','COMPONENT','COMPUTER','CONCENTRATE','CONCENTRATION','CONCEPT','CONCERN','CONCERNED','CONCLUDE','CONCLUSION','CONDITION','CONDUCT','CONFERENCE','CONFIDENCE','CONFIRM','CONFLICT','CONGRESS','CONNECT','CONNECTION','CONSEQUENCE','CONSERVATIVE','CONSIDER','CONSIDERABLE','CONSIDERATION','CONSIST','CONSTANT','CONSTRUCTION','CONSUMER','CONTACT','CONTAIN','CONTENT','CONTEXT','CONTINUE','CONTRACT','CONTRAST','CONTRIBUTE','CONTRIBUTION','CONTROL','CONVENTION','CONVERSATION','COPY','CORNER','CORPORATE','CORRECT','COS','COST','COULD','COUNCIL','COUNT','COUNTRY','COUNTY','COUPLE','COURSE','COURT','COVER','CREATE','CREATION','CREDIT','CRIME','CRIMINAL','CRISIS','CRITERION','CRITICAL','CRITICISM','CROSS','CROWD','CRY','CULTURAL','CULTURE','CUP','CURRENT','CURRENTLY','CURRICULUM','CUSTOMER','CUT','DAMAGE','DANGER','DANGEROUS','DARK','DATA','DATE','DAUGHTER','DAY','DEAD','DEAL','DEATH','DEBATE','DEBT','DECADE','DECIDE','DECISION','DECLARE','DEEP','DEFENCE','DEFENDANT','DEFINE','DEFINITION','DEGREE','DELIVER','DEMAND','DEMOCRATIC','DEMONSTRATE','DENY','DEPARTMENT','DEPEND','DEPUTY','DERIVE','DESCRIBE','DESCRIPTION','DESIGN','DESIRE','DESK','DESPITE','DESTROY','DETAIL','DETAILED','DETERMINE','DEVELOP','DEVELOPMENT','DEVICE','DIE','DIFFERENCE','DIFFERENT','DIFFICULT','DIFFICULTY','DINNER','DIRECT','DIRECTION','DIRECTLY','DIRECTOR','DISAPPEAR','DISCIPLINE','DISCOVER','DISCUSS','DISCUSSION','DISEASE','DISPLAY','DISTANCE','DISTINCTION','DISTRIBUTION','DISTRICT','DIVIDE','DIVISION','DO','DOCTOR','DOCUMENT','DOG','DOMESTIC','DOOR','DOUBLE','DOUBT','DOWN','DRAW','DRAWING','DREAM','DRESS','DRINK','DRIVE','DRIVER','DROP','DRUG','DRY','DUE','DURING','DUTY','EACH','EAR','EARLY','EARN','EARTH','EASILY','EAST','EASY','EAT','ECONOMIC','ECONOMY','EDGE','EDITOR','EDUCATION','EDUCATIONAL','EFFECT','EFFECTIVE','EFFECTIVELY','EFFORT','EGG','EITHER','ELDERLY','ELECTION','ELEMENT','ELSE','ELSEWHERE','EMERGE','EMPHASIS','EMPLOY','EMPLOYEE','EMPLOYER','EMPLOYMENT','EMPTY','ENABLE','ENCOURAGE','END','ENEMY','ENERGY','ENGINE','ENGINEERING','ENJOY','ENOUGH','ENSURE','ENTER','ENTERPRISE','ENTIRE','ENTIRELY','ENTITLE','ENTRY','ENVIRONMENT','ENVIRONMENTAL','EQUAL','EQUALLY','EQUIPMENT','ERROR','ESCAPE','ESPECIALLY','ESSENTIAL','ESTABLISH','ESTABLISHMENT','ESTATE','ESTIMATE','EVEN','EVENING','EVENT','EVENTUALLY','EVER','EVERY','EVERYBODY','EVERYONE','EVERYTHING','EVIDENCE','EXACTLY','EXAMINATION','EXAMINE','EXAMPLE','EXCELLENT','EXCEPT','EXCHANGE','EXECUTIVE','EXERCISE','EXHIBITION','EXIST','EXISTENCE','EXISTING','EXPECT','EXPECTATION','EXPENDITURE','EXPENSE','EXPENSIVE','EXPERIENCE','EXPERIMENT','EXPERT','EXPLAIN','EXPLANATION','EXPLORE','EXPRESS','EXPRESSION','EXTEND','EXTENT','EXTERNAL','EXTRA','EXTREMELY','EYE','FACE','FACILITY','FACT','FACTOR','FACTORY','FAIL','FAILURE','FAIR','FAIRLY','FAITH','FALL','FAMILIAR','FAMILY','FAMOUS','FAR','FARM','FARMER','FASHION','FAST','FATHER','FAVOUR','FEAR','FEATURE','FEE','FEEL','FEELING','FEMALE','FEW','FIELD','FIGHT','FIGURE','FILE','FILL','FILM','FINAL','FINALLY','FINANCE','FINANCIAL','FIND','FINDING','FINE','FINGER','FINISH','FIRE','FIRM','FIRST','FISH','FIT','FIX','FLAT','FLIGHT','FLOOR','FLOW','FLOWER','FLY','FOCUS','FOLLOW','FOLLOWING','FOOD','FOOT','FOOTBALL','FOR','FORCE','FOREIGN','FOREST','FORGET','FORM','FORMAL','FORMER','FORWARD','FOUNDATION','FREE','FREEDOM','FREQUENTLY','FRESH','FRIEND','FROM','FRONT','FRUIT','FUEL','FULL','FULLY','FUNCTION','FUND','FUNNY','FURTHER','FUTURE','GAIN','GAME','GARDEN','GAS','GATE','GATHER','GENERAL','GENERALLY','GENERATE','GENERATION','GENTLEMAN','GET','GIRL','GIVE','GLASS','GO','GOAL','GOD','GOLD','GOOD','GOVERNMENT','GRANT','GREAT','GREEN','GREY','GROUND','GROUP','GROW','GROWING','GROWTH','GUEST','GUIDE','GUN','HAIR','HALF','HALL','HAND','HANDLE','HANG','HAPPEN','HAPPY','HARD','HARDLY','HATE','HAVE','HE','HEAD','HEALTH','HEAR','HEART','HEAT','HEAVY','HELL','HELP','HENCE','HER','HERE','HERSELF','HIDE','HIGH','HIGHLY','HILL','HIM','HIMSELF','HIS','HISTORICAL','HISTORY','HIT','HOLD','HOLE','HOLIDAY','HOME','HOPE','HORSE','HOSPITAL','HOT','HOTEL','HOUR','HOUSE','HOUSEHOLD','HOUSING','HOW','HOWEVER','HUGE','HUMAN','HURT','HUSBAND','I','IDEA','IDENTIFY','IF','IGNORE','ILLUSTRATE','IMAGE','IMAGINE','IMMEDIATE','IMMEDIATELY','IMPACT','IMPLICATION','IMPLY','IMPORTANCE','IMPORTANT','IMPOSE','IMPOSSIBLE','IMPRESSION','IMPROVE','IMPROVEMENT','IN','INCIDENT','INCLUDE','INCLUDING','INCOME','INCREASE','INCREASED','INCREASINGLY','INDEED','INDEPENDENT','INDEX','INDICATE','INDIVIDUAL','INDUSTRIAL','INDUSTRY','INFLUENCE','INFORM','INFORMATION','INITIAL','INITIATIVE','INJURY','INSIDE','INSIST','INSTANCE','INSTEAD','INSTITUTE','INSTITUTION','INSTRUCTION','INSTRUMENT','INSURANCE','INTEND','INTENTION','INTEREST','INTERESTED','INTERESTING','INTERNAL','INTERNATIONAL','INTERPRETATION','INTERVIEW','INTO','INTRODUCE','INTRODUCTION','INVESTIGATE','INVESTIGATION','INVESTMENT','INVITE','INVOLVE','IRON','IS','ISLAND','ISSUE','IT','ITEM','ITS','ITSELF','JOB','JOIN','JOINT','JOURNEY','JUDGE','JUMP','JUST','JUSTICE','KEEP','KEY','KID','KILL','KIND','KING','KITCHEN','KNEE','KNOW','KNOWLEDGE','LABOUR','LACK','LADY','LAND','LANGUAGE','LARGE','LARGELY','LAST','LATE','LATER','LATTER','LAUGH','LAUNCH','LAW','LAWYER','LAY','LEAD','LEADER','LEADERSHIP','LEADING','LEAF','LEAGUE','LEAN','LEARN','LEAST','LEAVE','LEFT','LEG','LEGAL','LEGISLATION','LENGTH','LESS','LET','LETTER','LEVEL','LIABILITY','LIBERAL','LIBRARY','LIE','LIFE','LIFT','LIGHT','LIKE','LIKELY','LIMIT','LIMITED','LINE','LINK','LIP','LIST','LISTEN','LITERATURE','LITTLE','LIVE','LIVING','LOAN','LOCAL','LOCATION','LONG','LOOK','LORD','LOSE','LOSS','LOT','LOVE','LOVELY','LOW','LUNCH','MACHINE','MAGAZINE','MAIN','MAINLY','MAINTAIN','MAJOR','MAJORITY','MAKE','MALE','MAN','MANAGE','MANAGEMENT','MANAGER','MANNER','MANY','MAP','MARK','MARKET','MARRIAGE','MARRIED','MARRY','MASS','MASTER','MATCH','MATERIAL','MATTER','MAY','MAYBE','ME','MEAL','MEAN','MEANING','MEANS','MEANWHILE','MEASURE','MECHANISM','MEDIA','MEDICAL','MEET','MEETING','MEMBER','MEMBERSHIP','MEMORY','MENTAL','MENTION','MERELY','MESSAGE','METAL','METHOD','MIDDLE','MIGHT','MILE','MILITARY','MILK','MIND','MINE','MINISTER','MINISTRY','MINUTE','MISS','MISTAKE','MODEL','MODERN','MODULE','MOMENT','MONEY','MONTH','MORE','MORNING','MOST','MOTHER','MOTION','MOTOR','MOUNTAIN','MOUTH','MOVE','MOVEMENT','MUCH','MURDER','MUSEUM','MUSIC','MUST','MY','MYSELF','NAME','NARROW','NATION','NATIONAL','NATURAL','NATURE','NEAR','NEARLY','NECESSARILY','NECESSARY','NECK','NEED','NEGOTIATION','NEIGHBOUR','NEITHER','NETWORK','NEVER','NEVERTHELESS','NEW','NEWS','NEWSPAPER','NEXT','NICE','NIGHT','NO','NOBODY','NOD','NOISE','NONE','NOR','NORMAL','NORMALLY','NORTH','NORTHERN','NOSE','NOT','NOTE','NOTHING','NOTICE','NOTION','NOW','NUCLEAR','NUMBER','NURSE','OBJECT','OBJECTIVE','OBSERVATION','OBSERVE','OBTAIN','OBVIOUS','OBVIOUSLY','OCCASION','OCCUR','ODD','OF','OFF','OFFENCE','OFFER','OFFICE','OFFICER','OFFICIAL','OFTEN','OIL','OKAY','OLD','ON','ONCE','ONE','ONLY','ONTO','OPEN','OPERATE','OPERATION','OPINION','OPPORTUNITY','OPPOSITION','OPTION','OR','ORDER','ORDINARY','ORGANISATION','ORGANISE','ORGANIZATION','ORIGIN','ORIGINAL','OTHER','OTHERWISE','OUGHT','OUR','OURSELVES','OUT','OUTCOME','OUTPUT','OUTSIDE','OVER','OVERALL','OWN','OWNER','PACKAGE','PAGE','PAIN','PAINT','PAINTING','PAIR','PANEL','PAPER','PARENT','PARK','PARLIAMENT','PART','PARTICULAR','PARTICULARLY','PARTLY','PARTNER','PARTY','PASS','PASSAGE','PAST','PATH','PATIENT','PATTERN','PAY','PAYMENT','PEACE','PENSION','PEOPLE','PER','PERCENT','PERFECT','PERFORM','PERFORMANCE','PERHAPS','PERIOD','PERMANENT','PERSON','PERSONAL','PERSUADE','PHASE','PHONE','PHOTOGRAPH','PHYSICAL','PICK','PICTURE','PIECE','PLACE','PLAN','PLANNING','PLANT','PLASTIC','PLATE','PLAY','PLAYER','PLEASE','PLEASURE','PLENTY','PLUS','POCKET','POINT','POLICE','POLICY','POLITICAL','POLITICS','POOL','POOR','POPULAR','POPULATION','POSITION','POSITIVE','POSSIBILITY','POSSIBLE','POSSIBLY','POST','POTENTIAL','POUND','POWER','POWERFUL','PRACTICAL','PRACTICE','PREFER','PREPARE','PRESENCE','PRESENT','PRESIDENT','PRESS','PRESSURE','PRETTY','PREVENT','PREVIOUS','PREVIOUSLY','PRICE','PRIMARY','PRIME','PRINCIPLE','PRIORITY','PRISON','PRISONER','PRIVATE','PROBABLY','PROBLEM','PROCEDURE','PROCESS','PRODUCE','PRODUCT','PRODUCTION','PROFESSIONAL','PROFIT','PROGRAM','PROGRAMME','PROGRESS','PROJECT','PROMISE','PROMOTE','PROPER','PROPERLY','PROPERTY','PROPORTION','PROPOSE','PROPOSAL','PROSPECT','PROTECT','PROTECTION','PROVE','PROVIDE','PROVIDED','PROVISION','PUB','PUBLIC','PUBLICATION','PUBLISH','PULL','PUPIL','PURPOSE','PUSH','PUT','QUALITY','QUARTER','QUESTION','QUICK','QUICKLY','QUIET','QUITE','RACE','RADIO','RAILWAY','RAIN','RAISE','RANGE','RAPIDLY','RARE','RATE','RATHER','REACH','REACTION','READ','READER','READING','READY','REAL','REALISE','REALITY','REALIZE','REALLY','REASON','REASONABLE','RECALL','RECEIVE','RECENT','RECENTLY','RECOGNISE','RECOGNITION','RECOGNIZE','RECOMMEND','RECORD','RECOVER','RED','REDUCE','REDUCTION','REFER','REFERENCE','REFLECT','REFORM','REFUSE','REGARD','REGION','REGIONAL','REGULAR','REGULATION','REJECT','RELATE','RELATION','RELATIONSHIP','RELATIVE','RELATIVELY','RELEASE','RELEVANT','RELIEF','RELIGION','RELIGIOUS','RELY','REMAIN','REMEMBER','REMIND','REMOVE','REPEAT','REPLACE','REPLY','REPORT','REPRESENT','REPRESENTATION','REPRESENTATIVE','REQUEST','REQUIRE','REQUIREMENT','RESEARCH','RESOURCE','RESPECT','RESPOND','RESPONSE','RESPONSIBILITY','RESPONSIBLE','REST','RESTAURANT','RESULT','RETAIN','RETURN','REVEAL','REVENUE','REVIEW','REVOLUTION','RICH','RIDE','RIGHT','RING','RISE','RISK','RIVER','ROAD','ROCK','ROLE','ROLL','ROOF','ROOM','ROUND','ROUTE','ROW','ROYAL','RULE','RUN','RURAL','SAFE','SAFETY','SALE','SAME','SAMPLE','SATISFY','SAVE','SAY','SCALE','SCENE','SCHEME','SCHOOL','SCIENCE','SCIENTIFIC','SCIENTIST','SCORE','SCREEN','SEA','SEARCH','SEASON','SEAT','SECOND','SECONDARY','SECRETARY','SECTION','SECTOR','SECURE','SECURITY','SEE','SEEK','SEEM','SELECT','SELECTION','SELL','SEND','SENIOR','SENSE','SENTENCE','SEPARATE','SEQUENCE','SERIES','SERIOUS','SERIOUSLY','SERVANT','SERVE','SERVICE','SESSION','SET','SETTLE','SETTLEMENT','SEVERAL','SEVERE','SEX','SEXUAL','SHAKE','SHALL','SHAPE','SHARE','SHE','SHEET','SHIP','SHOE','SHOOT','SHOP','SHORT','SHOT','SHOULD','SHOULDER','SHOUT','SHOW','SHUT','SIDE','SIGHT','SIGN','SIGNAL','SIGNIFICANCE','SIGNIFICANT','SILENCE','SIMILAR','SIMPLE','SIMPLY','SINCE','SING','SINGLE','SIR','SISTER','SIT','SITE','SITUATION','SIZE','SKILL','SKIN','SKY','SLEEP','SLIGHTLY','SLIP','SLOW','SLOWLY','SMALL','SMILE','SO','SOCIAL','SOCIETY','SOFT','SOFTWARE','SOIL','SOLDIER','SOLICITOR','SOLUTION','SOME','SOMEBODY','SOMEONE','SOMETHING','SOMETIMES','SOMEWHAT','SOMEWHERE','SON','SONG','SOON','SORRY','SORT','SOUND','SOURCE','SOUTH','SOUTHERN','SPACE','SPEAK','SPEAKER','SPECIAL','SPECIES','SPECIFIC','SPEECH','SPEED','SPEND','SPIRIT','SPORT','SPOT','SPREAD','SPRING','STAFF','STAGE','STAND','STANDARD','STAR','START','STATE','STATEMENT','STATION','STATUS','STAY','STEAL','STEP','STICK','STILL','STOCK','STONE','STOP','STORE','STORY','STRAIGHT','STRANGE','STRATEGY','STREET','STRENGTH','STRIKE','STRONG','STRONGLY','STRUCTURE','STUDENT','STUDIO','STUDY','STUFF','STYLE','SUBJECT','SUBSTANTIAL','SUCCEED','SUCCESS','SUCCESSFUL','SUCH','SUDDENLY','SUFFER','SUFFICIENT','SUGGEST','SUGGESTION','SUITABLE','SUM','SUMMER','SUN','SUPPLY','SUPPORT','SUPPOSE','SURE','SURELY','SURFACE','SURPRISE','SURROUND','SURVEY','SURVIVE','SWITCH','SYSTEM','TABLE','TAKE','TALK','TALL','TAPE','TARGET','TASK','TAX','TEA','TEACH','TEACHER','TEACHING','TEAM','TEAR','TECHNICAL','TECHNIQUE','TECHNOLOGY','TELEPHONE','TELEVISION','TELL','TEMPERATURE','TEND','TERM','TERMS','TERRIBLE','TEST','TEXT','THAN','THANK','THANKS','THAT','THE','THEATRE','THEIR','THEM','THEME','THEMSELVES','THEN','THEORY','THERE','THEREFORE','THESE','THEY','THIN','THING','THINK','THIS','THOSE','THOUGH','THOUGHT','THREAT','THREATEN','THROUGH','THROUGHOUT','THROW','THUS','TICKET','TIME','TINY','TITLE','TO','TODAY','TOGETHER','TOMORROW','TONE','TONIGHT','TOO','TOOL','TOOTH','TOP','TOTAL','TOTALLY','TOUCH','TOUR','TOWARDS','TOWN','TRACK','TRADE','TRADITION','TRADITIONAL','TRAFFIC','TRAIN','TRAINING','TRANSFER','TRANSPORT','TRAVEL','TREAT','TREATMENT','TREATY','TREE','TREND','TRIAL','TRIP','TROOP','TROUBLE','TRUE','TRUST','TRUTH','TRY','TURN','TWICE','TYPE','TYPICAL','UNABLE','UNDER','UNDERSTAND','UNDERSTANDING','UNDERTAKE','UNEMPLOYMENT','UNFORTUNATELY','UNION','UNIT','UNITED','UNIVERSITY','UNLESS','UNLIKELY','UNTIL','UP','UPON','UPPER','URBAN','US','USE','USED','USEFUL','USER','USUAL','USUALLY','VALUE','VARIATION','VARIETY','VARIOUS','VARY','VAST','VEHICLE','VERSION','VERY','VIA','VICTIM','VICTORY','VIDEO','VIEW','VILLAGE','VIOLENCE','VISION','VISIT','VISITOR','VITAL','VOICE','VOLUME','VOTE','WAGE','WAIT','WALK','WALL','WANT','WAR','WARM','WARN','WASH','WATCH','WATER','WAVE','WAY','WE','WEAK','WEAPON','WEAR','WEATHER','WEEK','WEEKEND','WEIGHT','WELCOME','WELFARE','WELL','WEST','WESTERN','WHAT','WHATEVER','WHEN','WHERE','WHEREAS','WHETHER','WHICH','WHILE','WHILST','WHITE','WHO','WHOLE','WHOM','WHOSE','WHY','WIDE','WIDELY','WIFE','WILD','WILL','WIN','WIND','WINDOW','WINE','WING','WINNER','WINTER','WISH','WITH','WITHDRAW','WITHIN','WITHOUT','WOMAN','WONDER','WONDERFUL','WOOD','WORD','WORK','WORKER','WORKING','WORKS','WORLD','WORRY','WORTH','WOULD','WRITE','WRITER','WRITING','WRONG','YARD','YEAH','YEAR','YES','YESTERDAY','YET','YOU','YOUNG','YOUR','YOURSELF','YOUTH']; diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/24-game.english.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/24-game.english.md index 7a5c44024d..88d17e9e24 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/24-game.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/24-game.english.md @@ -132,8 +132,6 @@ function replaceChar(origString, replaceChar, index) { ```js -// noprotect - function solve24(numStr) { const digitsArr = numStr.split(''); const answers = []; diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/emirp-primes.english.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/emirp-primes.english.md index 81dfa7e03c..a876a06bd5 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/emirp-primes.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/emirp-primes.english.md @@ -64,7 +64,6 @@ function emirps(n) { ```js -// noprotect function emirps(num, showEmirps) { const is_prime = function(n) diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/extensible-prime-generator.english.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/extensible-prime-generator.english.md index f9d13363a0..d5c5d1408b 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/extensible-prime-generator.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/extensible-prime-generator.english.md @@ -65,7 +65,6 @@ function primeGenerator(num, showPrimes) { ```js -// noprotect function primeGenerator(num, showPrimes) { let i, arr = []; diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hailstone-sequence.english.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hailstone-sequence.english.md index 21c89b2034..27d278b330 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hailstone-sequence.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hailstone-sequence.english.md @@ -50,7 +50,6 @@ tests:
```js -// noprotect function hailstoneSequence() { const res = []; @@ -78,7 +77,6 @@ const res = [[27, 82, 41, 124, 8, 4, 2, 1], [351, 77031]]; ```js -// noprotect function hailstoneSequence () { const res = []; diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.english.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.english.md index 93ea478a71..3dae5bfb6a 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.english.md @@ -43,7 +43,7 @@ function isHarshadOrNiven() { firstTwenty: [], firstOver1000: undefined }; - // Change after this line + // Only change code below this line return res; } diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/heronian-triangles.english.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/heronian-triangles.english.md index c8603bea8c..d0e3e3b036 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/heronian-triangles.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/heronian-triangles.english.md @@ -50,7 +50,6 @@ tests:
```js -// noprotect function heronianTriangle(n) { @@ -84,7 +83,6 @@ const res = [ ```js -// noprotect function heronianTriangle(n) { const list = []; const result = []; diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.english.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.english.md index 318e095860..98a5719727 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.english.md @@ -71,7 +71,6 @@ tests:
```js -// noprotect function ffr(n) { return n; } @@ -102,7 +101,6 @@ const ffsParamRes = [[10, 14], [50, 59], [100, 112], [1000, 1041]]; ```js -// noprotect const R = [null, 1]; const S = [null, 2]; diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.english.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.english.md index 246faf3226..678876cde2 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.english.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.english.md @@ -51,7 +51,6 @@ tests:
```js -// noprotect function splitCoconuts(intSailors) { return true; @@ -69,7 +68,6 @@ function splitCoconuts(intSailors) { ```js -// noprotect function splitCoconuts(intSailors) { let intNuts = intSailors; let result = splitCoconutsHelper(intNuts, intSailors);