Wrap task description links in javadoc into <a href> tags

Author: andrei-punko

Diff for: src/main/java/by/andd3dfx/cache/LFUCacheUsingLinkedHashSet.java

@@ -11,7 +11,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/lfu-cache/
+ * <a href="https://leetcode.com/problems/lfu-cache/">Task description</a>
  *
  * Design and implement a data structure for Least Frequently Used (LFU) cache.
  * It should support the following operations: get and put.

Diff for: src/main/java/by/andd3dfx/cache/LFUCacheUsingTime.java

@@ -9,7 +9,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/lfu-cache/
+ * <a href="https://leetcode.com/problems/lfu-cache/">Task description</a>
  *
  * Design and implement a data structure for Least Frequently Used (LFU) cache.
  * It should support the following operations: get and put.

Diff for: src/main/java/by/andd3dfx/cache/LRUCache.java

@@ -9,7 +9,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/lru-cache/
+ * <a href="https://leetcode.com/problems/lru-cache/">Task description</a>
  *
  * Design and implement a data structure for Least Recently Used (LRU) cache.
  *

Diff for: src/main/java/by/andd3dfx/collections/ContainsDuplicates.java

@@ -4,7 +4,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/contains-duplicate/
+ * <a href="https://leetcode.com/problems/contains-duplicate/">Task description</a>
  *
  * Given an integer array nums, return true if any value appears at least twice in the array,
  * and return false if every element is distinct.

Diff for: src/main/java/by/andd3dfx/collections/RemoveDuplicatesFromSortedArray.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/remove-duplicates-from-sorted-array/
+ * <a href="https://leetcode.com/problems/remove-duplicates-from-sorted-array/">Task description</a>
  *
  * Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each
  * unique element appears only once. The relative order of the elements should be kept the same. Then return

Diff for: src/main/java/by/andd3dfx/collections/RemoveDuplicatesFromSortedArray_II.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/
+ * <a href="https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/">Task description</a>
  *
  * Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique
  * element appears at most twice. The relative order of the elements should be kept the same.

Diff for: src/main/java/by/andd3dfx/collections/RemoveDuplicatesFromSortedLinkedList.java

@@ -5,7 +5,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/remove-duplicates-from-sorted-list/
+ * <a href="https://leetcode.com/problems/remove-duplicates-from-sorted-list/">Task description</a>
  *
  * Given the head of a sorted linked list, delete all duplicates such that each element appears only once.
  * Return the linked list sorted as well.

Diff for: src/main/java/by/andd3dfx/collections/RemoveDuplicatesFromSortedLinkedList_II.java

@@ -8,7 +8,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/
+ * <a href="https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/">Task description</a>
  *
  * Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers
  * from the original list. Return the linked list sorted as well.

Diff for: src/main/java/by/andd3dfx/collections/RotateLinkedList.java

@@ -5,7 +5,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/rotate-list/
+ * <a href="https://leetcode.com/problems/rotate-list/">Task description</a>
  *
  * Given the head of a linked list, rotate the list to the right by k places.
  *

Diff for: src/main/java/by/andd3dfx/common/BracketsExpressionValidator.java

@@ -7,7 +7,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/valid-parentheses/description/
+ * <a href="https://leetcode.com/problems/valid-parentheses/description/">Task description</a>
  *
  * Есть скобочное выражение с разными видами скобок: {}, (), [], <>.
  * Проверить, что оно правильное.

Diff for: src/main/java/by/andd3dfx/common/ClimbingStairs.java

@@ -5,7 +5,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/climbing-stairs/description/
+ * <a href="https://leetcode.com/problems/climbing-stairs/description/">Task description</a>
  *
  * You are climbing a staircase. It takes n steps to reach the top.
  * Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Diff for: src/main/java/by/andd3dfx/common/DoorsNKeys.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://codeforces.com/problemset/problem/1709/A
+ * <a href="https://codeforces.com/problemset/problem/1709/A">Task description</a>
  *
  * Перед вами три двери, пронумерованные от 1 до 3 слева направо. На каждой двери висит замок,
  * который может быть открытым только ключом, на котором написано то же число, что и на двери.

Diff for: src/main/java/by/andd3dfx/common/GenerateParentheses.java

@@ -5,7 +5,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/generate-parentheses/
+ * <a href="https://leetcode.com/problems/generate-parentheses/">Task description</a>
  *
  * Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
  *

Diff for: src/main/java/by/andd3dfx/common/MatrixRotation.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://www.hackerrank.com/challenges/matrix-rotation-algo/problem
+ * <a href="https://www.hackerrank.com/challenges/matrix-rotation-algo/problem">Task description</a>
  *
  * You are given a 2D matrix of dimension m*n and a positive integer r. You have to rotate the matrix times and
  * print the resultant matrix. Rotation should be in anti-clockwise direction.

Diff for: src/main/java/by/andd3dfx/common/MaximumGap.java

@@ -4,7 +4,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/maximum-gap/description/
+ * <a href="https://leetcode.com/problems/maximum-gap/description/">Task description</a>
  *
  * Given an integer array nums, return the maximum difference between two successive elements in its sorted form.
  * If the array contains less than two elements, return 0.

Diff for: src/main/java/by/andd3dfx/common/Permutations.java

@@ -6,7 +6,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/permutations/
+ * <a href="https://leetcode.com/problems/permutations/">Task description</a>
  *
  * Given an array nums of distinct integers, return all the possible permutations.
  * You can return the answer in any order.

Diff for: src/main/java/by/andd3dfx/common/RemoveElement.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/remove-element/
+ * <a href="https://leetcode.com/problems/remove-element/">Task description</a>
  *
  * Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the
  * elements may be changed. Then return the number of elements in nums which are not equal to val.

Diff for: src/main/java/by/andd3dfx/common/SortedSquares.java

@@ -11,7 +11,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/squares-of-a-sorted-array/
+ * <a href="https://leetcode.com/problems/squares-of-a-sorted-array/">Task description</a>
  *
  * Дан массив целых чисел, отсортированный по возрастанию.
  * Вернуть массив, содержащий эл-ты исходного массива в квадрате, также отсортированный по возрастанию.

Diff for: src/main/java/by/andd3dfx/common/ValidAnagram.java

@@ -6,7 +6,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/valid-anagram/
+ * <a href="https://leetcode.com/problems/valid-anagram/">Task description</a>
  *
  * Given two strings s and t, return true if t is an anagram of s, and false otherwise.
  * An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase,

Diff for: src/main/java/by/andd3dfx/dynamic/BestTimeToBuyNSellStock.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/explore/interview/card/top-interview-questions-easy/97/dynamic-programming/572/
+ * <a href="https://leetcode.com/explore/interview/card/top-interview-questions-easy/97/dynamic-programming/572/">Task description</a>
  *
  * You are given an array prices where prices[i] is the price of a given stock on the ith day.
  *

Diff for: src/main/java/by/andd3dfx/dynamic/ChangeWithMinNumberOfCoins.java

@@ -6,7 +6,7 @@
 
 /**
  * <pre>
- * https://www.geeksforgeeks.org/find-minimum-number-of-coins-that-make-a-change/?ref=lbp
+ * <a href="https://www.geeksforgeeks.org/find-minimum-number-of-coins-that-make-a-change/?ref=lbp">Task description</a>
  *
  * Given a value V, if we want to make a change for V cents, and we have an infinite supply of each of
  * C = { C1, C2, .., Cm} valued coins, what is the minimum number of coins to make the change?

Diff for: src/main/java/by/andd3dfx/dynamic/RestoreIPAddress.java

@@ -5,7 +5,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/restore-ip-addresses/
+ * <a href="https://leetcode.com/problems/restore-ip-addresses/">Task description</a>
  *
  * A valid IP address consists of exactly four integers separated by single dots.
  * Each integer is between 0 and 255 (inclusive) and cannot have leading zeros.

Diff for: src/main/java/by/andd3dfx/multithreading/BuildingH2O.java

@@ -4,7 +4,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/building-h2o/description/
+ * <a href="https://leetcode.com/problems/building-h2o/description/">Task description</a>
  *
  * There are two kinds of threads: oxygen and hydrogen. Your goal is to group these threads to form water molecules.
  *

Diff for: src/main/java/by/andd3dfx/multithreading/FooBarNTimes.java

@@ -9,7 +9,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/print-foobar-alternately/
+ * <a href="https://leetcode.com/problems/print-foobar-alternately/">Task description</a>
  *
  * Suppose you are given the following code:
  * class FooBar {

Diff for: src/main/java/by/andd3dfx/multithreading/PrintInOrder.java

@@ -4,7 +4,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/print-in-order/
+ * <a href="https://leetcode.com/problems/print-in-order/">Task description</a>
  *
  * Suppose we have a class:
  *

Diff for: src/main/java/by/andd3dfx/numeric/AddDigits.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/add-digits/description/
+ * <a href="https://leetcode.com/problems/add-digits/description/">Task description</a>
  *
  * Given an integer num, repeatedly add all its digits until the result has only one digit, and return it.
  *

Diff for: src/main/java/by/andd3dfx/numeric/CountOnesInBinaryForm.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/number-of-1-bits/description/
+ * <a href="https://leetcode.com/problems/number-of-1-bits/description/">Task description</a>
  *
  * Write a function that takes the binary representation of a positive integer and returns
  * the number of set bits it has (also known as the Hamming weight).

Diff for: src/main/java/by/andd3dfx/numeric/FindNumberWhichAppearsOnce.java

@@ -4,7 +4,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/single-number/
+ * <a href="https://leetcode.com/problems/single-number/">Task description</a>
  *
  * Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.
  * You must implement a solution with a linear runtime complexity and use only constant extra space.

Diff for: src/main/java/by/andd3dfx/numeric/IntegerToRoman.java

@@ -4,7 +4,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/integer-to-roman/description/
+ * <a href="https://leetcode.com/problems/integer-to-roman/description/">Task description</a>
  *
  * Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
  * Symbol       Value

Diff for: src/main/java/by/andd3dfx/numeric/MaximumSwap.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/maximum-swap/
+ * <a href="https://leetcode.com/problems/maximum-swap/">Task description</a>
  *
  * You are given an integer num. You can swap two digits at most once to get the maximum valued number.
  * Return the maximum valued number you can get.

Diff for: src/main/java/by/andd3dfx/numeric/MoveZeroes.java

@@ -4,7 +4,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/move-zeroes/
+ * <a href="https://leetcode.com/problems/move-zeroes/">Task description</a>
  *
  * Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
  *

Diff for: src/main/java/by/andd3dfx/numeric/PalindromeNumber.java

@@ -1,9 +1,11 @@
 package by.andd3dfx.numeric;
 
 /**
- * https://leetcode.com/problems/palindrome-number/
- * <p>
+ * <pre>
+ * <a href="https://leetcode.com/problems/palindrome-number/">Task description</a>
+ *
  * Given an integer x, return true if x is a palindrome, and false otherwise.
+ * </pre>
  */
 public class PalindromeNumber {
 

Diff for: src/main/java/by/andd3dfx/numeric/PlusOne.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/plus-one/
+ * <a href="https://leetcode.com/problems/plus-one/">Task description</a>
  *
  * You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit
  * of the integer. The digits are ordered from most significant to least significant in left-to-right order.

Diff for: src/main/java/by/andd3dfx/numeric/PowerOfThree.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/power-of-three/description/
+ * <a href="https://leetcode.com/problems/power-of-three/description/">Task description</a>
  *
  * Given an integer n, return true if it is a power of three. Otherwise, return false.
  *

Diff for: src/main/java/by/andd3dfx/numeric/PowerOfTwo.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/power-of-two/description/
+ * <a href="https://leetcode.com/problems/power-of-two/description/">Task description</a>
  *
  * Given an integer n, return true if it is a power of two. Otherwise, return false.
  * An integer n is a power of two, if there exists an integer x such that n == 2^x.

Diff for: src/main/java/by/andd3dfx/numeric/RaiseToPower.java

@@ -5,7 +5,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/powx-n/
+ * <a href="https://leetcode.com/problems/powx-n/">Task description</a>
  *
  * Raise number a to power p
  *

Diff for: src/main/java/by/andd3dfx/numeric/RomanToInteger.java

@@ -4,7 +4,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/roman-to-integer/description/
+ * <a href="https://leetcode.com/problems/roman-to-integer/description/">Task description</a>
  *
  * Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
  *

Diff for: src/main/java/by/andd3dfx/numeric/SumOfTwoIntegersWithoutUsingPlusMinus.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/sum-of-two-integers/
+ * <a href="https://leetcode.com/problems/sum-of-two-integers/">Task description</a>
  *
  * Given two integers a and b, return the sum of the two integers without using the operators + and -.
  *

Diff for: src/main/java/by/andd3dfx/numeric/ValidNumber.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/valid-number/description/
+ * <a href="https://leetcode.com/problems/valid-number/description/">Task description</a>
  *
  * A valid number can be split up into these components (in order):
  *

Diff for: src/main/java/by/andd3dfx/search/CountNegativesInSortedMatrix.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/description/
+ * <a href="https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/description/">Task description</a>
  *
  * Given a m x n matrix grid which is sorted in non-increasing order both row-wise and column-wise,
  * return the number of negative numbers in grid.

Diff for: src/main/java/by/andd3dfx/search/FirstNLastPosOfElementInSortedArray.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/
+ * <a href="https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/">Task description</a>
  *
  * Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
  * If target is not found in the array, return [-1, -1].

Diff for: src/main/java/by/andd3dfx/search/FirstSmallestMissingPositive.java

@@ -1,11 +1,13 @@
 package by.andd3dfx.search;
 
 /**
- * https://leetcode.com/problems/first-missing-positive/
- * <p>
+ * <pre>
+ * <a href="https://leetcode.com/problems/first-missing-positive/">Task description</a>
+ *
  * Given an unsorted integer array nums, return the smallest missing positive integer.
- * <p>
+ *
  * You must implement an algorithm that runs in O(n) time and uses constant extra space.
+ * </pre>
  *
  * @see <a href="https://youtu.be/0i7x_YEXOpA">Video solution</a>
  */

Diff for: src/main/java/by/andd3dfx/search/wordsearch/WordSearch.java

@@ -2,7 +2,7 @@
 
 /**
  * <pre>
- * https://leetcode.com/problems/word-search/
+ * <a href="https://leetcode.com/problems/word-search/">Task description</a>
  *
  * Given an m x n grid of characters board and a string word, return true if word exists in the grid.
  *