chore: manual translations (#42811)

curriculum/challenges/italian/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md

@@ -144,7 +144,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md

@@ -145,7 +145,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md

@@ -89,7 +89,7 @@ function BinarySearchTree() {
 }
 function isBinarySearchTree(tree) {
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md

@@ -160,7 +160,7 @@ assert(
 DoublyLinkedList.prototype = Object.assign(
   DoublyLinkedList.prototype,
   {
-  
+
   print() {
     if (this.head == null) {
       return null;
@@ -204,7 +204,7 @@ var DoublyLinkedList = function() {
   this.head = null;
   this.tail = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 };
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-hash-table.md

@@ -210,7 +210,7 @@ var hash = string => {
 var HashTable = function() {
   this.collection = {};
   // Only change code below this line
-  
+
   // Only change code above this line
 };
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-map-data-structure.md

@@ -158,7 +158,7 @@ assert(
 var Map = function() {
   this.collection = {};
   // Only change code below this line
-  
+
   // Only change code above this line
 };
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-set-class.md

@@ -170,7 +170,7 @@ class Set {
   }
 
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md

@@ -139,7 +139,7 @@ var Node = function() {
 };
 var Trie = function() {
   // Only change code below this line
-  
+
   // Only change code above this line
 };
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/depth-first-search.md

@@ -16,7 +16,7 @@ Once it reaches one end of a path, the search will backtrack to the last node wi
 
 The animation below shows how the algorithm works. The algorithm starts with the top node and visits the nodes in the numbered order.
 
-<img class='img-responsive' src='https://camo.githubusercontent.com/aaad9e39961daf34d967c616edeb50abf3bf1235/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f372f37662f44657074682d46697273742d5365617263682e676966'>
+<img class='img-responsive' src='https://camo.githubusercontent.com/aaad9e39961daf34d967c616edeb50abf3bf1235/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f372f37662f44657074682d46697273742d5365617263682e676966' />
 
 Notice how, unlike breadth-first search, every time a node is visited, it doesn't visit all of its neighbors. Instead, it first visits one of its neighbors and continues down that path until there are no more nodes to be visited on that path.
 

curriculum/challenges/italian/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md

@@ -261,7 +261,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```
@@ -278,7 +278,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
   this.findMinHeight = function(root = this.root) {
     // empty tree.

curriculum/challenges/italian/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md

@@ -187,7 +187,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md

@@ -125,14 +125,14 @@ function createRandomArray(size = 5){
   let a = new Array(size);
   for(let i = 0; i < size; i++)
     a[i] = Math.floor(Math.random() * 100);
-  
+
   return a;
 }
 const array = createRandomArray(25);
 
 var MinHeap = function() {
   // Only change code below this line
-  
+
   // Only change code above this line
 };
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md

@@ -123,7 +123,7 @@ assert(
 ```js
 var MaxHeap = function() {
   // Only change code below this line
-    
+
   // Only change code above this line
 };
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/invert-a-binary-tree.md

@@ -160,7 +160,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md

@@ -124,7 +124,7 @@ class Set {
     return newSet;
   }
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md

@@ -200,7 +200,7 @@ class Set {
     return newSet;
   }
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md

@@ -101,7 +101,7 @@ class Set {
     return newSet;
   }
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md

@@ -194,7 +194,7 @@ function LinkedList() {
       previous = currentNode;
       currentNode = currentNode.next;
     }
-    
+
     if (currentNode.next === null && currentNode.element !== element) {
       return;
     }

curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md

@@ -48,8 +48,11 @@ assert(
 
 ```js
 function checkSet(){
-   var set = null;
-   return set;
+  // Only change code below this line
+  var set = null;
+
+  // Only change code above this line
+  return set;   
 }
 ```
 

curriculum/challenges/italian/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md

@@ -165,7 +165,7 @@ var DoublyLinkedList = function() {
   this.head = null;
   this.tail = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 };
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md

@@ -214,7 +214,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```

curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md

@@ -278,7 +278,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```