2024-01-24 v. 4.0.3.1: updated README.md

Author: fartem

leetcode-ruby.gemspec

@@ -5,7 +5,7 @@ require 'English'
 ::Gem::Specification.new do |s|
   s.required_ruby_version = '>= 3.0'
   s.name = 'leetcode-ruby'
-  s.version = '4.0.3'
+  s.version = '4.0.3.1'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[bin/leetcode-ruby README.md LICENSE]
   s.executable = 'leetcode-ruby'

lib/easy/1929_concatenation_of_array.rb

@@ -1,6 +1,6 @@
 # frozen_string_literal: true
 
-# https://leetcode.com/problems/concatenation-of-array/description/
+# https://leetcode.com/problems/concatenation-of-array/
 # @param {Integer[]} nums
 # @return {Integer[]}
 def get_concatenation(nums)

lib/easy/1935_maximum_number_of_words_you_can_type.rb

@@ -1,6 +1,6 @@
 # frozen_string_literal: true
 
-# https://leetcode.com/problems/maximum-number-of-words-you-can-type/description/
+# https://leetcode.com/problems/maximum-number-of-words-you-can-type/
 # @param {String} text
 # @param {String} broken_letters
 # @return {Integer}

lib/easy/1941_check_if_all_characters_have_equal_number_of_occurrences.rb

@@ -1,6 +1,6 @@
 # frozen_string_literal: true
 
-# https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/description/
+# https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/
 # @param {String} s
 # @return {Boolean}
 def are_occurrences_equal(s)

lib/easy/1952_three_divisors.rb

@@ -1,6 +1,6 @@
 # frozen_string_literal: true
 
-# https://leetcode.com/problems/three-divisors/description/
+# https://leetcode.com/problems/three-divisors/
 # @param {Integer} n
 # @return {Boolean}
 def is_three(n)

lib/easy/1957_delete_characters_to_make_fancy_string.rb

@@ -1,6 +1,6 @@
 # frozen_string_literal: true
 
-# https://leetcode.com/problems/delete-characters-to-make-fancy-string/description/
+# https://leetcode.com/problems/delete-characters-to-make-fancy-string/
 # @param {String} s
 # @return {String}
 def make_fancy_string(s)

lib/easy/1961_check_if_string_is_a_prefix_of_array.rb

@@ -1,6 +1,6 @@
 # frozen_string_literal: true
 
-# https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/description/
+# https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/
 # @param {String} s
 # @param {String[]} words
 # @return {Boolean}

lib/easy/1967_number_of_strings_that_appear_as_substrings_in_word.rb

@@ -1,6 +1,6 @@
 # frozen_string_literal: true
 
-# https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/description/
+# https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/
 # @param {String[]} patterns
 # @param {String} word
 # @return {Integer}

lib/easy/1971_find_if_path_exists_in_graph.rb

@@ -1,6 +1,6 @@
 # frozen_string_literal: true
 
-# https://leetcode.com/problems/find-if-path-exists-in-graph/description/
+# https://leetcode.com/problems/find-if-path-exists-in-graph/
 # @param {Integer} n
 # @param {Integer[][]} edges
 # @param {Integer} source

lib/easy/1974_minimum_time_to_type_word_using_special_typewriter.rb

@@ -1,6 +1,6 @@
 # frozen_string_literal: true
 
-# https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/description/
+# https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/
 # @param {String} word
 # @return {Integer}
 def min_time_to_type(word)