From 59393ecee7e5d3180435f608554c96ddb6f99cbc Mon Sep 17 00:00:00 2001
From: fartem <jaman.smlnsk@gmail.com>
Date: Thu, 23 Jan 2025 10:43:15 +0300
Subject: [PATCH] 2025-01-23 v. 8.2.4: added "1023. Camelcase Matching"

---
 README.md                                   |  1 +
 leetcode-ruby.gemspec                       |  2 +-
 lib/medium/1023_camelcase_matching.rb       | 33 ++++++++++
 test/medium/test_1023_camelcase_matching.rb | 73 +++++++++++++++++++++
 4 files changed, 108 insertions(+), 1 deletion(-)
 create mode 100644 lib/medium/1023_camelcase_matching.rb
 create mode 100644 test/medium/test_1023_camelcase_matching.rb

diff --git a/README.md b/README.md
index c1f25353..5133c96d 100644
--- a/README.md
+++ b/README.md
@@ -656,6 +656,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 998. Maximum Binary Tree II                                      | [Link](https://leetcode.com/problems/maximum-binary-tree-ii/)                                      | [Link](./lib/medium/998_maximum_binary_tree_ii.rb)                                      | [Link](./test/medium/test_998_maximum_binary_tree_ii.rb)                                      |
 | 1008. Construct Binary Search Tree from Preorder Traversal       | [Link](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/)        | [Link](./lib/medium/1008_construct_binary_search_tree_from_preorder_traversal.rb)       | [Link](./test/medium/test_1008_construct_binary_search_tree_from_preorder_traversal.rb)       |
 | 1019. Next Greater Node In Linked List                           | [Link](https://leetcode.com/problems/next-greater-node-in-linked-list/)                            | [Link](./lib/medium/1019_next_greater_node_in_linked_list.rb)                           | [Link](./test/medium/test_1019_next_greater_node_in_linked_list.rb)                           |
+| 1023. Camelcase Matching                                         | [Link](https://leetcode.com/problems/camelcase-matching/)                                          | [Link](./lib/medium/1023_camelcase_matching.rb)                                         | [Link](./test/medium/test_1023_camelcase_matching.rb)                                         |
 | 1400. Construct K Palindrome Strings                             | [Link](https://leetcode.com/problems/construct-k-palindrome-strings/)                              | [Link](./lib/medium/1400_construct_k_palindrome_strings.rb)                             | [Link](./test/medium/test_1400_construct_k_palindrome_strings.rb)                             |
 | 2116. Check if a Parentheses String Can Be Valid                 | [Link](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/)                  | [Link](./lib/medium/2116_check_if_a_parentheses_string_can_be_valid.rb)                 | [Link](./test/medium/test_2116_check_if_a_parentheses_string_can_be_valid.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)                                |
diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec
index 883bb20e..bef18ba1 100644
--- a/leetcode-ruby.gemspec
+++ b/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 = '8.2.3'
+  s.version = '8.2.4'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'
diff --git a/lib/medium/1023_camelcase_matching.rb b/lib/medium/1023_camelcase_matching.rb
new file mode 100644
index 00000000..ec6b17db
--- /dev/null
+++ b/lib/medium/1023_camelcase_matching.rb
@@ -0,0 +1,33 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/camelcase-matching/
+# @param [Array<String>] queries
+# @param [String] pattern
+# @return [Array<Boolean>]
+def camel_match(queries, pattern)
+  result = []
+  p_length = pattern.size
+
+  queries.each do |query|
+    p = 0
+    i = 0
+
+    while i < query.size
+      c = query[i]
+
+      break if p >= p_length && c >= 'A' && c <= 'Z'
+
+      if p < p_length && c == pattern[p]
+        p += 1
+      elsif c >= 'A' && c <= 'Z' && c != pattern[p]
+        break
+      end
+
+      i += 1
+    end
+
+    result << (i == query.size && p == p_length)
+  end
+
+  result
+end
diff --git a/test/medium/test_1023_camelcase_matching.rb b/test/medium/test_1023_camelcase_matching.rb
new file mode 100644
index 00000000..f9ef87be
--- /dev/null
+++ b/test/medium/test_1023_camelcase_matching.rb
@@ -0,0 +1,73 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/medium/1023_camelcase_matching'
+require 'minitest/autorun'
+
+class CamelcaseMatchingTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      [
+        true,
+        false,
+        true,
+        true,
+        false
+      ],
+      camel_match(
+        %w[
+          FooBar
+          FooBarTest
+          FootBall
+          FrameBuffer
+          ForceFeedBack
+        ],
+        'FB'
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      [
+        true,
+        false,
+        true,
+        false,
+        false
+      ],
+      camel_match(
+        %w[
+          FooBar
+          FooBarTest
+          FootBall
+          FrameBuffer
+          ForceFeedBack
+        ],
+        'FoBa'
+      )
+    )
+  end
+
+  def test_default_three
+    assert_equal(
+      [
+        false,
+        true,
+        false,
+        false,
+        false
+      ],
+      camel_match(
+        %w[
+          FooBar
+          FooBarTest
+          FootBall
+          FrameBuffer
+          ForceFeedBack
+        ],
+        'FoBaT'
+      )
+    )
+  end
+end