Fix some typos (#3038)

Yulv-git · web-flow · commit 3ebba74e04be · 2022-04-28T21:09:25.000+08:00
diff --git a/src/main/java/com/thealgorithms/datastructures/lists/CircleLinkedList.java b/src/main/java/com/thealgorithms/datastructures/lists/CircleLinkedList.java
@@ -90,7 +90,7 @@ public E remove(int pos) {
         }
         Node<E> destroy = before.next;
         E saved = destroy.value;
-        // assigning the next reference to the the element following the element we want to remove...
+        // assigning the next reference to the element following the element we want to remove...
         // the last element will be assigned to the head.
         before.next = before.next.next;
         // scrubbing
diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/CoinChange.java b/src/main/java/com/thealgorithms/dynamicprogramming/CoinChange.java
@@ -49,7 +49,7 @@ public static int change(int[] coins, int amount) {
      *
      * @param coins The list of coins
      * @param amount The amount for which we need to find the minimum number of
-     * coins. Finds the the minimum number of coins that make a given value.
+     * coins. Finds the minimum number of coins that make a given value.
      */
     public static int minimumCoins(int[] coins, int amount) {
         // minimumCoins[i] will store the minimum coins needed for amount i
diff --git a/src/main/java/com/thealgorithms/maths/VectorCrossProduct.java b/src/main/java/com/thealgorithms/maths/VectorCrossProduct.java
@@ -28,7 +28,7 @@
  * following Java Program calculates the direction ratios of the cross products
  * of two vector. The program uses a function, cross() for doing so. The
  * direction ratios for the first and the second vector has to be passed one by
- * one seperated by a space character.
+ * one separated by a space character.
  *
  * Magnitude of a vector is the square root of the sum of the squares of the
  * direction ratios.
diff --git a/src/main/java/com/thealgorithms/misc/RangeInSortedArray.java b/src/main/java/com/thealgorithms/misc/RangeInSortedArray.java
@@ -90,7 +90,7 @@ public static int getLessThan(int[] nums, int key, int left, int right) {
             if (nums[mid] > key) {
                 right = mid - 1;
             } else if (nums[mid] <= key) {
-                count = mid + 1; // Atleast mid+1 elements exist which are <= key
+                count = mid + 1; // At least mid+1 elements exist which are <= key
                 left = mid + 1;
             }
         }
diff --git a/src/main/java/com/thealgorithms/others/Implementing_auto_completing_features_using_trie.java b/src/main/java/com/thealgorithms/others/Implementing_auto_completing_features_using_trie.java
@@ -135,7 +135,7 @@ static int printAutoSuggestions(TrieNode root,
             return -1;
         }
 
-        // If there are are nodes below last 
+        // If there are nodes below the last 
         // matching character. 
         if (!isLast) {
             String prefix = query;

Original file line number	Diff line number	Diff line change
`@@ -90,7 +90,7 @@ public E remove(int pos) {`
`90`	`90`	`}`
`91`	`91`	`Node<E> destroy = before.next;`
`92`	`92`	`E saved = destroy.value;`
`93`		`- // assigning the next reference to the the element following the element we want to remove...`
	`93`	`+ // assigning the next reference to the element following the element we want to remove...`
`94`	`94`	`// the last element will be assigned to the head.`
`95`	`95`	`before.next = before.next.next;`
`96`	`96`	`// scrubbing`
Original file line number	Diff line number	Diff line change
`@@ -49,7 +49,7 @@ public static int change(int[] coins, int amount) {`
`49`	`49`	`*`
`50`	`50`	`* @param coins The list of coins`
`51`	`51`	`* @param amount The amount for which we need to find the minimum number of`
`52`		`- * coins. Finds the the minimum number of coins that make a given value.`
	`52`	`+ * coins. Finds the minimum number of coins that make a given value.`
`53`	`53`	`*/`
`54`	`54`	`public static int minimumCoins(int[] coins, int amount) {`
`55`	`55`	`// minimumCoins[i] will store the minimum coins needed for amount i`
Original file line number	Diff line number	Diff line change
`@@ -28,7 +28,7 @@`
`28`	`28`	`* following Java Program calculates the direction ratios of the cross products`
`29`	`29`	`* of two vector. The program uses a function, cross() for doing so. The`
`30`	`30`	`* direction ratios for the first and the second vector has to be passed one by`
`31`		`- * one seperated by a space character.`
	`31`	`+ * one separated by a space character.`
`32`	`32`	`*`
`33`	`33`	`* Magnitude of a vector is the square root of the sum of the squares of the`
`34`	`34`	`* direction ratios.`
Original file line number	Diff line number	Diff line change
`@@ -90,7 +90,7 @@ public static int getLessThan(int[] nums, int key, int left, int right) {`
`90`	`90`	`if (nums[mid] > key) {`
`91`	`91`	`right = mid - 1;`
`92`	`92`	`} else if (nums[mid] <= key) {`
`93`		`- count = mid + 1; // Atleast mid+1 elements exist which are <= key`
	`93`	`+ count = mid + 1; // At least mid+1 elements exist which are <= key`
`94`	`94`	`left = mid + 1;`
`95`	`95`	`}`
`96`	`96`	`}`
Original file line number	Diff line number	Diff line change
`@@ -135,7 +135,7 @@ static int printAutoSuggestions(TrieNode root,`
`135`	`135`	`return -1;`
`136`	`136`	`}`
`137`	`137`
`138`		`- // If there are are nodes below last`
	`138`	`+ // If there are nodes below the last`
`139`	`139`	`// matching character.`
`140`	`140`	`if (!isLast) {`
`141`	`141`	`String prefix = query;`