Skip to content

Fix some typos. #3038

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Apr 28, 2022
Merged

Fix some typos. #3038

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/main/java/com/thealgorithms/datastructures/lists/CircleLinkedList.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/com/thealgorithms/dynamicprogramming/CoinChange.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/com/thealgorithms/maths/VectorCrossProduct.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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.
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/com/thealgorithms/misc/RangeInSortedArray.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
}
}
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/com/thealgorithms/others/Implementing_auto_completing_features_using_trie.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down