2022-05-21 update: updated links

Author: fartem

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RearrangeSpacesBetweenWords.java

@@ -3,7 +3,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/rearrange-spaces-between-words
+// https://leetcode.com/problems/rearrange-spaces-between-words/
 public class RearrangeSpacesBetweenWords {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RedistributeCharactersToMakeAllStringsEqual.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal
+// https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/
 public class RedistributeCharactersToMakeAllStringsEqual {
 
     private final String[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReformatDate.java

@@ -3,7 +3,7 @@
 import java.util.HashMap;
 import java.util.Map;
 
-// https://leetcode.com/problems/reformat-date
+// https://leetcode.com/problems/reformat-date/
 public class ReformatDate {
 
     private static final Map<String, String> MONTHS = new HashMap<>();

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReformatPhoneNumber.java

@@ -3,7 +3,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/reformat-phone-number
+// https://leetcode.com/problems/reformat-phone-number/
 public class ReformatPhoneNumber {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReformatTheString.java

@@ -3,7 +3,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/reformat-the-string
+// https://leetcode.com/problems/reformat-the-string/
 public class ReformatTheString {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RelativeRanks.java

@@ -4,7 +4,7 @@
 import java.util.HashMap;
 import java.util.Map;
 
-// https://leetcode.com/problems/relative-ranks
+// https://leetcode.com/problems/relative-ranks/
 public class RelativeRanks {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RemoveAllAdjacentDuplicatesInString.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string
+// https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/
 public class RemoveAllAdjacentDuplicatesInString {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RemoveDuplicatesFromSortedArray.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/remove-duplicates-from-sorted-array
+// https://leetcode.com/problems/remove-duplicates-from-sorted-array/
 public class RemoveDuplicatesFromSortedArray {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RemoveDuplicatesFromSortedList.java

@@ -2,7 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.ListNode;
 
-// https://leetcode.com/problems/remove-duplicates-from-sorted-list
+// https://leetcode.com/problems/remove-duplicates-from-sorted-list/
 public class RemoveDuplicatesFromSortedList {
 
     private final ListNode head;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RemoveElement.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/remove-element
+// https://leetcode.com/problems/remove-element/
 public class RemoveElement {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RemoveLinkedListElements.java

@@ -2,7 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.ListNode;
 
-// https://leetcode.com/problems/remove-linked-list-elements
+// https://leetcode.com/problems/remove-linked-list-elements/
 public class RemoveLinkedListElements {
 
     private ListNode head;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RemoveOneElementToMakeTheArrayStrictlyIncreasing.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing
+// https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/
 public class RemoveOneElementToMakeTheArrayStrictlyIncreasing {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RemoveOutermostParentheses.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/remove-outermost-parentheses
+// https://leetcode.com/problems/remove-outermost-parentheses/
 public class RemoveOutermostParentheses {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RemovePalindromicSubsequences.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/remove-palindromic-subsequences
+// https://leetcode.com/problems/remove-palindromic-subsequences/
 public class RemovePalindromicSubsequences {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReorderDataInLogFiles.java

@@ -2,7 +2,7 @@
 
 import java.util.Arrays;
 
-// https://leetcode.com/problems/reorder-data-in-log-files
+// https://leetcode.com/problems/reorder-data-in-log-files/
 public class ReorderDataInLogFiles {
 
     private final String[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RepeatedSubstringPattern.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/repeated-substring-pattern
+// https://leetcode.com/problems/repeated-substring-pattern/
 public class RepeatedSubstringPattern {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReplaceAllDigitsWithCharacters.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/replace-all-digits-with-characters
+// https://leetcode.com/problems/replace-all-digits-with-characters/
 public class ReplaceAllDigitsWithCharacters {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReplaceAllQuestionMarksAvoidConsecutiveRepeatingCharacters.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters
+// https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/
 public class ReplaceAllQuestionMarksAvoidConsecutiveRepeatingCharacters {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReplaceElementsWithGreatestElementOnRightSide.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side
+// https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/
 public class ReplaceElementsWithGreatestElementOnRightSide {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReverseBits.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/reverse-bits
+// https://leetcode.com/problems/reverse-bits/
 public class ReverseBits {
 
     private final int input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReverseInteger.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/reverse-integer
+// https://leetcode.com/problems/reverse-integer/
 public class ReverseInteger {
 
     private int input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReverseLinkedList.java

@@ -2,7 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.ListNode;
 
-// https://leetcode.com/problems/reverse-linked-list
+// https://leetcode.com/problems/reverse-linked-list/
 public class ReverseLinkedList {
 
     private final ListNode head;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReverseOnlyLetters.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/reverse-only-letters
+// https://leetcode.com/problems/reverse-only-letters/
 public class ReverseOnlyLetters {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReversePrefixOfWord.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/reverse-prefix-of-word
+// https://leetcode.com/problems/reverse-prefix-of-word/
 public class ReversePrefixOfWord {
 
     private final String word;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReverseString.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/reverse-string
+// https://leetcode.com/problems/reverse-string/
 public class ReverseString {
 
     private final char[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReverseVowelsOfAString.java

@@ -3,7 +3,7 @@
 import java.util.HashSet;
 import java.util.Set;
 
-// https://leetcode.com/problems/reverse-vowels-of-a-string
+// https://leetcode.com/problems/reverse-vowels-of-a-string/
 public class ReverseVowelsOfAString {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ReverseWordsInAStringIII.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/reverse-words-in-a-string-iii
+// https://leetcode.com/problems/reverse-words-in-a-string-iii/
 public class ReverseWordsInAStringIII {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RichestCustomerWealth.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/richest-customer-wealth
+// https://leetcode.com/problems/richest-customer-wealth/
 public class RichestCustomerWealth {
 
     private final int[][] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RingsAndRods.java

@@ -5,7 +5,7 @@
 import java.util.Map;
 import java.util.Set;
 
-// https://leetcode.com/problems/rings-and-rods
+// https://leetcode.com/problems/rings-and-rods/
 public class RingsAndRods {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RobotReturnToOrigin.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/robot-return-to-origin
+// https://leetcode.com/problems/robot-return-to-origin/
 public class RobotReturnToOrigin {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RomanToInteger.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/roman-to-integer
+// https://leetcode.com/problems/roman-to-integer/
 public class RomanToInteger {
 
     private static final int[] VALUES = new int[100];

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RootEqualsSumOfChildren.java

@@ -2,7 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
 
-// https://leetcode.com/problems/root-equals-sum-of-children
+// https://leetcode.com/problems/root-equals-sum-of-children/
 public class RootEqualsSumOfChildren {
 
     private final TreeNode input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RotateString.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/rotate-string
+// https://leetcode.com/problems/rotate-string/
 public class RotateString {
 
     private final String a;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/RunningSumOf1DArray.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/running-sum-of-1d-array
+// https://leetcode.com/problems/running-sum-of-1d-array/
 public class RunningSumOf1DArray {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/SameTree.java

@@ -2,7 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
 
-// https://leetcode.com/problems/same-tree
+// https://leetcode.com/problems/same-tree/
 public class SameTree {
 
     private final TreeNode p;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/SearchInABinarySearchTree.java

@@ -2,16 +2,13 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
 
-// https://leetcode.com/problems/search-in-a-binary-search-tree
+// https://leetcode.com/problems/search-in-a-binary-search-tree/
 public class SearchInABinarySearchTree {
 
     private final TreeNode root;
     private final int val;
 
-    public SearchInABinarySearchTree(
-            TreeNode root,
-            int val
-    ) {
+    public SearchInABinarySearchTree(TreeNode root, int val) {
         this.root = root;
         this.val = val;
     }

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/SearchInsertPosition.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/search-insert-position
+// https://leetcode.com/problems/search-insert-position/
 public class SearchInsertPosition {
 
     private final int[] array;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/SecondLargestDigitInAString.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/second-largest-digit-in-a-string
+// https://leetcode.com/problems/second-largest-digit-in-a-string/
 public class SecondLargestDigitInAString {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/SecondMinimumNodeInABinaryTree.java

@@ -2,7 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
 
-// https://leetcode.com/problems/second-minimum-node-in-a-binary-tree
+// https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/
 public class SecondMinimumNodeInABinaryTree {
 
     private final TreeNode input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/SelfDividingNumbers.java

@@ -3,7 +3,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/self-dividing-numbers
+// https://leetcode.com/problems/self-dividing-numbers/
 public class SelfDividingNumbers {
 
     private final int left;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/SetMismatch.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/set-mismatch
+// https://leetcode.com/problems/set-mismatch/
 public class SetMismatch {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ShortestDistanceToACharacter.java

@@ -3,7 +3,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/shortest-distance-to-a-character
+// https://leetcode.com/problems/shortest-distance-to-a-character/
 public class ShortestDistanceToACharacter {
 
     private final String string;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ShuffleString.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/shuffle-string
+// https://leetcode.com/problems/shuffle-string/
 public class ShuffleString {
 
     private final String string;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ShuffleTheArray.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/shuffle-the-array
+// https://leetcode.com/problems/shuffle-the-array/
 public class ShuffleTheArray {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/SignOfTheProductOfAnArray.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/sign-of-the-product-of-an-array
+// https://leetcode.com/problems/sign-of-the-product-of-an-array/
 public class SignOfTheProductOfAnArray {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/SingleNumber.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/single-number/solution
+// https://leetcode.com/problems/single-number/solution/
 public class SingleNumber {
 
     private final int[] input;