Fix some typos (#3038)

src/main/java/com/thealgorithms/datastructures/lists/CircleLinkedList.java

@@ -90,7 +90,7 @@ public class CircleLinkedList<E> {
         }
         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

src/main/java/com/thealgorithms/dynamicprogramming/CoinChange.java

@@ -49,7 +49,7 @@ public class CoinChange {
      *
      * @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

src/main/java/com/thealgorithms/maths/VectorCrossProduct.java

@@ -28,7 +28,7 @@ package com.thealgorithms.maths;
  * 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.

src/main/java/com/thealgorithms/misc/RangeInSortedArray.java

@@ -90,7 +90,7 @@ public class RangeInSortedArray {
             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;
             }
         }

src/main/java/com/thealgorithms/others/Implementing_auto_completing_features_using_trie.java

@@ -135,7 +135,7 @@ class Trieac {
             return -1;
         }
 
-        // If there are are nodes below last 
+        // If there are nodes below the last 
         // matching character. 
         if (!isLast) {
             String prefix = query;