Fix duplicated words in comments and test description

Author: trekhleb

src/algorithms/image-processing/seam-carving/README.md

@@ -440,7 +440,7 @@ const findLowEnergySeam = (energyMap: EnergyMap, { w, h }: ImageSize): Seam => {
     }
   }
 
-  // Find the lowest energy energy seam.
+  // Find the lowest energy seam.
   // Once we know where the tail is we may traverse and assemble the lowest
   // energy seam based on the "previous" value of the seam pixel metadata.
   const seam: Seam = [];

src/algorithms/image-processing/seam-carving/README.ru-RU.md

@@ -440,7 +440,7 @@ const findLowEnergySeam = (energyMap: EnergyMap, { w, h }: ImageSize): Seam => {
     }
   }
 
-  // Find the lowest energy energy seam.
+  // Find the lowest energy seam.
   // Once we know where the tail is we may traverse and assemble the lowest
   // energy seam based on the "previous" value of the seam pixel metadata.
   const seam: Seam = [];

src/algorithms/image-processing/seam-carving/resizeImageWidth.js

@@ -170,7 +170,7 @@ const findLowEnergySeam = (energyMap, { w, h }) => {
     }
   }
 
-  // Find the lowest energy energy seam.
+  // Find the lowest energy seam.
   // Once we know where the tail is we may traverse and assemble the lowest
   // energy seam based on the "previous" value of the seam pixel metadata.
   const seam = [];

src/algorithms/string/z-algorithm/zAlgorithm.js

@@ -48,7 +48,7 @@ function buildZArray(zString) {
       }
 
       // Now we may calculate how many characters starting from current position
-      // are are the same as the prefix. We may calculate it by difference between
+      // are the same as the prefix. We may calculate it by difference between
       // right and left Z box boundaries.
       zArray[charIndex] = zBoxRightIndex - zBoxLeftIndex;
 

src/data-structures/graph/__test__/Graph.test.js

@@ -261,7 +261,7 @@ describe('Graph', () => {
     expect(graph.getAllEdges()[1].getKey()).toBe(edgeAC.getKey());
   });
 
-  it('should should throw an error when trying to delete not existing edge', () => {
+  it('should throw an error when trying to delete not existing edge', () => {
     function deleteNotExistingEdge() {
       const graph = new Graph();