chore(i18n,learn): processed translations (#45001)

curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sorted-union.md

@@ -45,6 +45,18 @@ assert.deepEqual(uniteUnique([1, 2, 3], [5, 2, 1, 4], [2, 1], [6, 7, 8]), [
 ]);
 ```
 
+`uniteUnique([1, 3, 2], [5, 4], [5, 6])` should return `[1, 3, 2, 5, 4, 6]`.
+
+```js
+assert.deepEqual(uniteUnique([1, 3, 2], [5, 4], [5, 6]), [1, 3, 2, 5, 4, 6]);
+```
+
+`uniteUnique([1, 3, 2, 3], [5, 2, 1, 4], [2, 1])` should return `[1, 3, 2, 5, 4]`.
+
+```js
+assert.deepEqual(uniteUnique([1, 3, 2, 3], [5, 2, 1, 4], [2, 1]), [1, 3, 2, 5, 4]);
+```
+
 # --seed--
 
 ## --seed-contents--
@@ -62,7 +74,11 @@ uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]);
 ```js
 function uniteUnique(arr) {
   return [].slice.call(arguments).reduce(function(a, b) {
-    return [].concat(a, b.filter(function(e) {return a.indexOf(e) === -1;}));
+    return [].concat(
+      a, 
+      b.filter(function(e, currentIndex) {
+        return b.indexOf(e) === currentIndex && a.indexOf(e) === -1;
+      }));
   }, []);
 }
 ```

curriculum/challenges/japanese/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md

@@ -128,14 +128,15 @@ assert(
     if (typeof test.remove !== 'function') {
       return false;
     }
-    test.add(-1);
+    test.add(1);
+    test.add(4);
     test.add(3);
-    test.add(7);
-    test.add(16);
-    test.remove(16);
-    test.remove(7);
+    test.add(2);
+    test.add(6);
+    test.add(8);
+    test.remove(6);
     test.remove(3);
-    return test.inorder().join('') == '-1';
+    return test.inorder().join('') == '1248';
   })()
 );
 ```