2022-05-20 update: updated links

Author: fartem

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/a-number-after-a-double-reversal
+// https://leetcode.com/problems/a-number-after-a-double-reversal/
 public class ANumberAfterADoubleReversal {
 
     private final int input;

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

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

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

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

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

@@ -1,15 +1,12 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/add-strings
+// https://leetcode.com/problems/add-strings/
 public class AddStrings {
 
     private final String num1;
     private final String num2;
 
-    public AddStrings(
-            String num1,
-            String num2
-    ) {
+    public AddStrings(String num1, String num2) {
         this.num1 = num1;
         this.num2 = num2;
     }

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

@@ -4,7 +4,7 @@
 import java.util.Collections;
 import java.util.List;
 
-// https://leetcode.com/problems/add-to-array-form-of-integer
+// https://leetcode.com/problems/add-to-array-form-of-integer/
 public class AddToArrayFormOfInteger {
 
     private final int[] num;

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/add-two-integers
+// https://leetcode.com/problems/add-two-integers/
 public class AddTwoIntegers {
 
     private final int num1;

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

@@ -5,16 +5,13 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/all-elements-in-two-binary-search-trees
+// https://leetcode.com/problems/all-elements-in-two-binary-search-trees/
 public class AllElementsInTwoBinarySearchTrees {
 
     private final TreeNode root1;
     private final TreeNode root2;
 
-    public AllElementsInTwoBinarySearchTrees(
-            TreeNode root1,
-            TreeNode root2
-    ) {
+    public AllElementsInTwoBinarySearchTrees(TreeNode root1, TreeNode root2) {
         this.root1 = root1;
         this.root2 = root2;
     }

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

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

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

@@ -2,7 +2,7 @@
 
 import java.util.Arrays;
 
-// https://leetcode.com/problems/array-partition-i
+// https://leetcode.com/problems/array-partition-i/
 public class ArrayPartitionI {
 
     private final int[] input;

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

@@ -2,7 +2,7 @@
 
 import java.util.Arrays;
 
-// https://leetcode.com/problems/assign-cookies
+// https://leetcode.com/problems/assign-cookies/
 public class AssignCookies {
 
     private final int[] g;

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

@@ -7,7 +7,7 @@
 import java.util.List;
 import java.util.Queue;
 
-// https://leetcode.com/problems/average-of-levels-in-binary-tree
+// https://leetcode.com/problems/average-of-levels-in-binary-tree/
 public class AverageOfLevelsInBinaryTree {
 
     private final TreeNode input;

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

@@ -2,7 +2,7 @@
 
 import java.util.Arrays;
 
-// https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary
+// https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/
 public class AverageSalaryExcludingTheMinimumAndMaximumSalary {
 
     private final int[] input;

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

@@ -2,16 +2,13 @@
 
 import java.util.Stack;
 
-// https://leetcode.com/problems/backspace-string-compare
+// https://leetcode.com/problems/backspace-string-compare/
 public class BackspaceStringCompare {
 
     private final String s;
     private final String t;
 
-    public BackspaceStringCompare(
-            String s,
-            String t
-    ) {
+    public BackspaceStringCompare(String s, String t) {
         this.s = s;
         this.t = t;
     }

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

@@ -2,7 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
 
-// https://leetcode.com/problems/balanced-binary-tree
+// https://leetcode.com/problems/balanced-binary-tree/
 public class BalancedBinaryTree {
 
     private final TreeNode input;

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

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

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

@@ -2,6 +2,7 @@
 
 import java.util.Stack;
 
+// https://leetcode.com/problems/baseball-game/
 public class BaseballGame {
 
     private final String[] input;

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/best-time-to-buy-and-sell-stock
+// https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
 public class BestTimeToBuyAndSellStock {
 
     private final int[] input;

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

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

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/binary-number-with-alternating-bits
+// https://leetcode.com/problems/binary-number-with-alternating-bits/
 public class BinaryNumberWithAlternatingBits {
 
     private int input;

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

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

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

@@ -5,7 +5,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/binary-tree-inorder-traversal
+// https://leetcode.com/problems/binary-tree-inorder-traversal/
 public class BinaryTreeInorderTraversal {
 
     private final TreeNode input;

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

@@ -5,7 +5,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/binary-tree-paths
+// https://leetcode.com/problems/binary-tree-paths/
 public class BinaryTreePaths {
 
     private final TreeNode input;

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

@@ -5,7 +5,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/binary-tree-postorder-traversal
+// https://leetcode.com/problems/binary-tree-postorder-traversal/
 public class BinaryTreePostorderTraversal {
 
     private final TreeNode input;

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

@@ -5,7 +5,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/binary-tree-preorder-traversal
+// https://leetcode.com/problems/binary-tree-preorder-traversal/
 public class BinaryTreePreorderTraversal {
 
     private final TreeNode input;

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

@@ -2,6 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
 
+// https://leetcode.com/problems/binary-tree-tilt/
 public class BinaryTreeTilt {
 
     private final TreeNode input;

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/buddy-strings
+// https://leetcode.com/problems/buddy-strings/
 public class BuddyStrings {
 
     private final String s;

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

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

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

@@ -3,7 +3,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/calculate-digit-sum-of-a-string
+// https://leetcode.com/problems/calculate-digit-sum-of-a-string/
 public class CalculateDigitSumOfAString {
 
     private String s;

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

@@ -2,7 +2,7 @@
 
 import java.util.Arrays;
 
-// https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence
+// https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/
 public class CanMakeArithmeticProgressionFromSequence {
 
     private final int[] input;

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/capitalize-the-title
+// https://leetcode.com/problems/capitalize-the-title/
 public class CapitalizeTheTitle {
 
     private final String input;

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

@@ -3,7 +3,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet
+// https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/
 public class CellsInARangeOnAnExcelSheet {
 
     private final String s;

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/cells-with-odd-values-in-a-matrix
+// https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/
 public class CellsWithOddValuesInAMatrix {
 
     private final int m;

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence
+// https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/
 public class CheckIFNumbersAreAscendingInASentence {
 
     private final String input;

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
+// https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/
 public class CheckIfAWordOccursAsAPrefixOfAnyWordInASentence {
 
     private final String sentence;

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

@@ -1,15 +1,12 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away
+// https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/
 public class CheckIfAll1AreAtLeastLengthKPlacesAway {
 
     private final int[] nums;
     private final int k;
 
-    public CheckIfAll1AreAtLeastLengthKPlacesAway(
-            int[] nums,
-            int k
-    ) {
+    public CheckIfAll1AreAtLeastLengthKPlacesAway(int[] nums, int k) {
         this.nums = nums;
         this.k = k;
     }

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/check-if-all-as-appears-before-all-bs
+// https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/
 public class CheckIfAllAsAppearsBeforeAllBs {
 
     private final String input;

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences
+// https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/
 public class CheckIfAllCharactersHaveEqualNumberOfOccurrences {
 
     private final String input;

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered
+// https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/
 public class CheckIfAllTheIntegersInARangeAreCovered {
 
     private final int[][] ranges;

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/check-if-array-is-sorted-and-rotated
+// https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/
 public class CheckIfArrayIsSortedAndRotated {
 
     private final int[] input;

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones
+// https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/
 public class CheckIfBinaryStringHasAtMostOneSegmentOfOnes {
 
     private final String input;

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

@@ -2,7 +2,7 @@
 
 import java.util.HashSet;
 
-// https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers
+// https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/
 public class CheckIfEveryRowAndColumnContainsAllNumbers {
 
     private final int[][] input;

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

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.easy;
 
-// https://leetcode.com/problems/check-if-it-is-a-straight-line
+// https://leetcode.com/problems/check-if-it-is-a-straight-line/
 public class CheckIfItIsAStraightLine {
 
     private final int[][] input;