2025-04-01 v. 9.1.6: added "2266. Count Number of Texts"

Author: fartem

README.md

@@ -750,6 +750,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 2225. Find Players With Zero or One Losses                                          | [Link](https://leetcode.com/problems/find-players-with-zero-or-one-losses/)                                          | [Link](./lib/medium/2225_find_players_with_zero_or_one_losses.rb)                                          | [Link](./test/medium/test_2225_find_players_with_zero_or_one_losses.rb)                                          |
 | 2233. Maximum Product After K Increments                                            | [Link](https://leetcode.com/problems/maximum-product-after-k-increments/)                                            | [Link](./lib/medium/2233_maximum_product_after_k_increments.rb)                                            | [Link](./test/medium/test_2233_maximum_product_after_k_increments.rb)                                            |
 | 2265. Count Nodes Equal to Average of Subtree                                       | [Link](https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/)                                       | [Link](./lib/medium/2265_count_nodes_equal_to_average_of_subtree.rb)                                       | [Link](./test/medium/test_2265_count_nodes_equal_to_average_of_subtree.rb)                                       |
+| 2266. Count Number of Texts                                                         | [Link](https://leetcode.com/problems/count-number-of-texts/)                                                         | [Link](./lib/medium/2266_count_number_of_texts.rb)                                                         | [Link](./test/medium/test_2266_count_number_of_texts.rb)                                                         |
 | 2425. Bitwise XOR of All Pairings                                                   | [Link](https://leetcode.com/problems/bitwise-xor-of-all-pairings/)                                                   | [Link](./lib/medium/2425_bitwise_xor_of_all_pairings.rb)                                                   | [Link](./test/medium/test_2425_bitwise_xor_of_all_pairings.rb)                                                   |
 | 2429. Minimize XOR                                                                  | [Link](https://leetcode.com/problems/minimize-xor/)                                                                  | [Link](./lib/medium/2429_minimize_xor.rb)                                                                  | [Link](./test/medium/test_2429_minimize_xor.rb)                                                                  |
 | 2657. Find the Prefix Common Array of Two Arrays                                    | [Link](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/)                                    | [Link](./lib/medium/2657_find_the_prefix_common_array_of_two_arrays.rb)                                    | [Link](./test/medium/test_2657_find_the_prefix_common_array_of_two_arrays.rb)                                    |

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 = '9.1.5'
+  s.version = '9.1.6'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/2266_count_number_of_texts.rb

@@ -0,0 +1,27 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/count-number-of-texts/
+# @param {String} pressed_keys
+# @return {Integer}
+def count_texts(pressed_keys)
+  mod = 10**9 + 7
+  n = pressed_keys.size
+  dp = ::Array.new(n + 1, 0)
+  dp[0] = 1
+
+  (1..n).each do |i|
+    current_char = pressed_keys[i - 1]
+    dp[i] = dp[i - 1] % mod
+
+    next unless i >= 2 && pressed_keys[i - 2] == current_char
+
+    dp[i] = (dp[i] + dp[i - 2]) % mod
+
+    next unless i >= 3 && pressed_keys[i - 3] == current_char
+
+    dp[i] = (dp[i] + dp[i - 3]) % mod
+    dp[i] = (dp[i] + dp[i - 4]) % mod if %w[7 9].include?(current_char) && i >= 4 && pressed_keys[i - 4] == current_char
+  end
+
+  dp[n] % mod
+end

test/medium/test_2266_count_number_of_texts.rb

@@ -0,0 +1,25 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/medium/2266_count_number_of_texts'
+require 'minitest/autorun'
+
+class CountNumberOfTextsTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      8,
+      count_texts(
+        '22233'
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      82_876_089,
+      count_texts(
+        '222222222222222222222222222222222222'
+      )
+    )
+  end
+end

test/medium/test_2429_minimize_xor.rb

@@ -5,9 +5,24 @@
 require 'minitest/autorun'
 
 class MinimizeXORTest < ::Minitest::Test
-  def test_default_one = assert_equal(3, minimize_xor(3, 5))
+  def test_default_one
+    assert_equal(
+      3,
+      minimize_xor(3, 5)
+    )
+  end
 
-  def test_default_two = assert_equal(3, minimize_xor(1, 12))
+  def test_default_two
+    assert_equal(
+      3,
+      minimize_xor(1, 12)
+    )
+  end
 
-  def test_additional_one = assert_equal(24, minimize_xor(25, 72))
+  def test_additional_one
+    assert_equal(
+      24,
+      minimize_xor(25, 72)
+    )
+  end
 end

test/medium/test_3223_minimum_length_of_string_after_operations.rb

@@ -5,7 +5,21 @@
 require 'minitest/autorun'
 
 class MinimumLengthOfStringAfterOperationsTest < ::Minitest::Test
-  def test_default_one = assert_equal(5, minimum_length('abaacbcbb'))
+  def test_default_one
+    assert_equal(
+      5,
+      minimum_length(
+        'abaacbcbb'
+      )
+    )
+  end
 
-  def test_default_two = assert_equal(2, minimum_length('aa'))
+  def test_default_two
+    assert_equal(
+      2,
+      minimum_length(
+        'aa'
+      )
+    )
+  end
 end