diff --git a/README.md b/README.md
index 8c83a614..acd0c5ab 100644
--- a/README.md
+++ b/README.md
@@ -415,3 +415,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 2325. Decode the Message                                           | [Link](https://leetcode.com/problems/decode-the-message/)                                           | [Link](./lib/easy/2325_decode_the_message.rb)                                           |
 | 2331. Evaluate Boolean Binary Tree                                 | [Link](https://leetcode.com/problems/evaluate-boolean-binary-tree/)                                 | [Link](./lib/easy/2331_evaluate_boolean_binary_tree.rb)                                 |
 | 2335. Minimum Amount of Time to Fill Cups                          | [Link](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/)                          | [Link](./lib/easy/2335_minimum_amount_of_time_to_fill_cups.rb)                          |
+| 2341. Maximum Number of Pairs in Array                             | [Link](https://leetcode.com/problems/maximum-number-of-pairs-in-array/)                             | [Link](./lib/easy/2341_maximum_number_of_pairs_in_array.rb)                             |
diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec
index cd48c96f..37a7ff6b 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 = '5.5.4'
+  s.version = '5.5.5'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[bin/leetcode-ruby README.md LICENSE]
   s.executable = 'leetcode-ruby'
diff --git a/lib/easy/2341_maximum_number_of_pairs_in_array.rb b/lib/easy/2341_maximum_number_of_pairs_in_array.rb
new file mode 100644
index 00000000..af4d0965
--- /dev/null
+++ b/lib/easy/2341_maximum_number_of_pairs_in_array.rb
@@ -0,0 +1,17 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/maximum-number-of-pairs-in-array/
+# @param {Integer[]} nums
+# @return {Integer[]}
+def number_of_pairs(nums)
+  map = {}
+  nums.each { |num| map[num] = map.fetch(num, 0) + 1 }
+  pairs = 0
+  leftover = 0
+  map.each_value do |count|
+    pairs += count / 2
+    leftover += count % 2
+  end
+
+  [pairs, leftover]
+end
diff --git a/test/easy/test_2341_maximum_number_of_pairs_in_array.rb b/test/easy/test_2341_maximum_number_of_pairs_in_array.rb
new file mode 100644
index 00000000..00d4042b
--- /dev/null
+++ b/test/easy/test_2341_maximum_number_of_pairs_in_array.rb
@@ -0,0 +1,13 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/easy/2341_maximum_number_of_pairs_in_array'
+require 'minitest/autorun'
+
+class MaximumNumberOfPairsInArrayTest < ::Minitest::Test
+  def test_default
+    assert_equal([3, 1], number_of_pairs([1, 3, 2, 1, 3, 2, 2]))
+    assert_equal([1, 0], number_of_pairs([1, 1]))
+    assert_equal([0, 1], number_of_pairs([0]))
+  end
+end