2022-05-21 update: updated links

Author: fartem

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MaxNumberOfKSumPairs.java

@@ -3,7 +3,7 @@
 import java.util.HashMap;
 import java.util.Map;
 
-// https://leetcode.com/problems/max-number-of-k-sum-pairs
+// https://leetcode.com/problems/max-number-of-k-sum-pairs/
 public class MaxNumberOfKSumPairs {
 
     private final int[] nums;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MaximumDifferenceBetweenNodeAndAncestor.java

@@ -2,7 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
 
-// https://leetcode.com/problems/maximum-difference-between-node-and-ancestor
+// https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/
 public class MaximumDifferenceBetweenNodeAndAncestor {
 
     private final TreeNode input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MaximumLevelSumOfABinaryTree.java

@@ -5,7 +5,7 @@
 import java.util.Deque;
 import java.util.LinkedList;
 
-// https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree
+// https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/
 public class MaximumLevelSumOfABinaryTree {
 
     private final TreeNode input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MaximumNestingDepthOfTwoValidParenthesesStrings.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings
+// https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/
 public class MaximumNestingDepthOfTwoValidParenthesesStrings {
 
     private final String seq;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MaximumProductAfterKIncrements.java

@@ -3,7 +3,7 @@
 import java.util.PriorityQueue;
 import java.util.Queue;
 
-// https://leetcode.com/problems/maximum-product-after-k-increments
+// https://leetcode.com/problems/maximum-product-after-k-increments/
 public class MaximumProductAfterKIncrements {
 
     private final int[] nums;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MaximumProductOfWordLengths.java

@@ -3,7 +3,7 @@
 import java.util.HashMap;
 import java.util.Map;
 
-// https://leetcode.com/problems/maximum-product-of-word-lengths
+// https://leetcode.com/problems/maximum-product-of-word-lengths/
 public class MaximumProductOfWordLengths {
 
     private final String[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MaximumTwinSumOfLinkedList.java

@@ -2,6 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.ListNode;
 
+// https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/
 public class MaximumTwinSumOfLinkedList {
 
     private final ListNode input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MaximumWidthOfBinaryTree.java

@@ -5,7 +5,7 @@
 import java.util.Deque;
 import java.util.LinkedList;
 
-// https://leetcode.com/problems/maximum-width-of-binary-tree
+// https://leetcode.com/problems/maximum-width-of-binary-tree/
 public class MaximumWidthOfBinaryTree {
 
     private final TreeNode input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MaximumXORForEachQuery.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/maximum-xor-for-each-query
+// https://leetcode.com/problems/maximum-xor-for-each-query/
 public class MaximumXORForEachQuery {
 
     private final int[] nums;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MergeInBetweenLinkedLists.java

@@ -2,20 +2,15 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.ListNode;
 
-// https://leetcode.com/problems/merge-in-between-linked-lists
+// https://leetcode.com/problems/merge-in-between-linked-lists/
 public class MergeInBetweenLinkedLists {
 
     private final ListNode list1;
     private int a;
     private int b;
     private final ListNode list2;
 
-    public MergeInBetweenLinkedLists(
-            ListNode list1,
-            int a,
-            int b,
-            ListNode list2
-    ) {
+    public MergeInBetweenLinkedLists(ListNode list1, int a, int b, ListNode list2) {
         this.list1 = list1;
         this.a = a;
         this.b = b;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MergeIntervals.java

@@ -4,7 +4,7 @@
 import java.util.Comparator;
 import java.util.LinkedList;
 
-// https://leetcode.com/problems/merge-intervals
+// https://leetcode.com/problems/merge-intervals/
 public class MergeIntervals {
 
     private final int[][] intervals;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MergeNodesInBetweenZeros.java

@@ -2,6 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.ListNode;
 
+// https://leetcode.com/problems/merge-nodes-in-between-zeros/
 public class MergeNodesInBetweenZeros {
 
     private final ListNode input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MinimizeMaximumPairSumInArray.java

@@ -2,7 +2,7 @@
 
 import java.util.Arrays;
 
-// https://leetcode.com/problems/minimize-maximum-pair-sum-in-array
+// https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/
 public class MinimizeMaximumPairSumInArray {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MinimumAddToMakeParenthesesValid.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/minimum-add-to-make-parentheses-valid
+// https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/
 public class MinimumAddToMakeParenthesesValid {
 
     private final String input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MinimumMovesToEqualArrayElementsII.java

@@ -2,7 +2,7 @@
 
 import java.util.Arrays;
 
-// https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii
+// https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/
 public class MinimumMovesToEqualArrayElementsII {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MinimumNumberOfStepsToMakeTwoStringsAnagram.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram
+// https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/
 public class MinimumNumberOfStepsToMakeTwoStringsAnagram {
 
     private final String s;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MinimumSizeSubarraySum.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/minimum-size-subarray-sum
+// https://leetcode.com/problems/minimum-size-subarray-sum/
 public class MinimumSizeSubarraySum {
 
     private final int target;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MinimumSuffixFlips.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/minimum-suffix-flips
+// https://leetcode.com/problems/minimum-suffix-flips/
 public class MinimumSuffixFlips {
 
     private final String target;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MinimumSwapsToMakeStringsEqual.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/minimum-swaps-to-make-strings-equal
+// https://leetcode.com/problems/minimum-swaps-to-make-strings-equal/
 public class MinimumSwapsToMakeStringsEqual {
 
     private final String s1;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MostFrequentSubtreeSum.java

@@ -7,7 +7,7 @@
 import java.util.List;
 import java.util.Map;
 
-// https://leetcode.com/problems/most-frequent-subtree-sum
+// https://leetcode.com/problems/most-frequent-subtree-sum/
 public class MostFrequentSubtreeSum {
 
     private final TreeNode input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MultiplyStrings.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/multiply-strings
+// https://leetcode.com/problems/multiply-strings/
 public class MultiplyStrings {
 
     private final String num1;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/NAryTreeLevelOrderTraversal.java

@@ -7,7 +7,7 @@
 import java.util.Deque;
 import java.util.List;
 
-// https://leetcode.com/problems/n-ary-tree-level-order-traversal
+// https://leetcode.com/problems/n-ary-tree-level-order-traversal/
 public class NAryTreeLevelOrderTraversal {
 
     private final Node input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/NextGreaterElementII.java

@@ -2,7 +2,7 @@
 
 import java.util.Stack;
 
-// https://leetcode.com/problems/next-greater-element-ii
+// https://leetcode.com/problems/next-greater-element-ii/
 public class NextGreaterElementII {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/NextGreaterNodeInLinkedList.java

@@ -7,7 +7,7 @@
 import java.util.Deque;
 import java.util.List;
 
-// https://leetcode.com/problems/next-greater-node-in-linked-list
+// https://leetcode.com/problems/next-greater-node-in-linked-list/
 public class NextGreaterNodeInLinkedList {
 
     private final ListNode input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/NthDigit.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/nth-digit
+// https://leetcode.com/problems/nth-digit/
 public class NthDigit {
 
     private int input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/NumberOfGoodWaysToSplitAString.java

@@ -3,7 +3,7 @@
 import java.util.HashSet;
 import java.util.Set;
 
-// https://leetcode.com/problems/number-of-good-ways-to-split-a-string
+// https://leetcode.com/problems/number-of-good-ways-to-split-a-string/
 public class NumberOfGoodWaysToSplitAString {
 
     private final String s;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/NumberOfLaserBeamsInABank.java

@@ -3,7 +3,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/number-of-laser-beams-in-a-bank
+// https://leetcode.com/problems/number-of-laser-beams-in-a-bank/
 public class NumberOfLaserBeamsInABank {
 
     private final String[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/NumberOfPairsOfStringsWithConcatenationEqualToTarget.java

@@ -5,7 +5,7 @@
 import java.util.List;
 import java.util.Map;
 
-// https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target
+// https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/
 public class NumberOfPairsOfStringsWithConcatenationEqualToTarget {
 
     private final String[] nums;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/NumberOfSubarraysOfSizeKAndAverageGreaterThanOrEqualToThreshold.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold
+// https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/
 public class NumberOfSubarraysOfSizeKAndAverageGreaterThanOrEqualToThreshold {
 
     private final int[] arr;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/NumberOfSubstringsContainingAllThreeCharacters.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/number-of-substrings-containing-all-three-characters
+// https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/
 public class NumberOfSubstringsContainingAllThreeCharacters {
 
     private final String s;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/OddEvenLinkedList.java

@@ -2,7 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.ListNode;
 
-// https://leetcode.com/problems/odd-even-linked-list
+// https://leetcode.com/problems/odd-even-linked-list/
 public class OddEvenLinkedList {
 
     private final ListNode input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/P132Pattern.java

@@ -2,7 +2,7 @@
 
 import java.util.Stack;
 
-// https://leetcode.com/problems/132-pattern
+// https://leetcode.com/problems/132-pattern/
 public class P132Pattern {
 
     private final int[] nums;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/PartitionArrayAccordingToGivenPivot.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/partition-array-according-to-given-pivot
+// https://leetcode.com/problems/partition-array-according-to-given-pivot/
 public class PartitionArrayAccordingToGivenPivot {
 
     private final int[] nums;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/PartitionArrayForMaximumSum.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/partition-array-for-maximum-sum
+// https://leetcode.com/problems/partition-array-for-maximum-sum/
 public class PartitionArrayForMaximumSum {
 
     private final int[] arr;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/PartitionList.java

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

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/PathSumII.java

@@ -5,14 +5,12 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/path-sum-ii
+// https://leetcode.com/problems/path-sum-ii/
 public class PathSumII {
 
     private final TreeNode root;
     private final int targetSum;
 
-    private final List<List<Integer>> paths = new ArrayList<>();
-
     public PathSumII(TreeNode root, int targetSum) {
         this.root = root;
         this.targetSum = targetSum;
@@ -29,12 +27,7 @@ public List<List<Integer>> solution() {
         return result;
     }
 
-    private void dfs(
-            TreeNode node,
-            List<List<Integer>> paths,
-            List<Integer> path,
-            int sum
-    ) {
+    private void dfs(TreeNode node, List<List<Integer>> paths, List<Integer> path, int sum) {
         if (sum == 0 && node.left == null && node.right == null) {
             List<Integer> targetPath = new ArrayList<>(path);
             paths.add(targetPath);

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/PeekingIterator.java

@@ -2,7 +2,7 @@
 
 import java.util.Iterator;
 
-// https://leetcode.com/problems/peeking-iterator
+// https://leetcode.com/problems/peeking-iterator/
 public class PeekingIterator implements Iterator<Integer> {
 
     private final Iterator<Integer> iterator;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/Permutations.java

@@ -3,7 +3,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-// https://leetcode.com/problems/permutations
+// https://leetcode.com/problems/permutations/
 public class Permutations {
 
     private final int[] input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/PopulatingNextRightPointersInEachNode.java

@@ -2,7 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.NextTreeNode;
 
-// https://leetcode.com/problems/populating-next-right-pointers-in-each-node
+// https://leetcode.com/problems/populating-next-right-pointers-in-each-node/
 public class PopulatingNextRightPointersInEachNode {
 
     private final NextTreeNode input;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/PopulatingNextRightPointersInEachNodeII.java

@@ -6,7 +6,7 @@
 import java.util.LinkedList;
 import java.util.List;
 
-// https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii
+// https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/
 public class PopulatingNextRightPointersInEachNodeII {
 
     private final NextTreeNode root;

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/PrintFooBarAlternately.java

@@ -2,7 +2,7 @@
 
 import java.util.concurrent.Semaphore;
 
-// https://leetcode.com/problems/print-foobar-alternately
+// https://leetcode.com/problems/print-foobar-alternately/
 public class PrintFooBarAlternately {
 
     private final Semaphore foo = new Semaphore(1);

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/ProductOfArrayExceptSelf.java

@@ -1,6 +1,6 @@
 package com.smlnskgmail.jaman.leetcodejava.medium;
 
-// https://leetcode.com/problems/product-of-array-except-self
+// https://leetcode.com/problems/product-of-array-except-self/
 public class ProductOfArrayExceptSelf {
 
     private final int[] nums;