2025-03-27 v. 9.1.3: added "2225. Find Players With Zero or One Losses"

Author: fartem

README.md

@@ -747,6 +747,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 2181. Merge Nodes in Between Zeros                                                  | [Link](https://leetcode.com/problems/merge-nodes-in-between-zeros/)                                                  | [Link](./lib/medium/2181_merge_nodes_in_between_zeros.rb)                                                  | [Link](./test/medium/test_2181_merge_nodes_in_between_zeros.rb)                                                  |
 | 2196. Create Binary Tree From Descriptions                                          | [Link](https://leetcode.com/problems/create-binary-tree-from-descriptions/)                                          | [Link](./lib/medium/2196_create_binary_tree_from_descriptions.rb)                                          | [Link](./test/medium/test_2196_create_binary_tree_from_descriptions.rb)                                          |
 | 2221. Find Triangular Sum of an Array                                               | [Link](https://leetcode.com/problems/find-triangular-sum-of-an-array/)                                               | [Link](./lib/medium/2221_find_triangular_sum_of_an_array.rb)                                               | [Link](./test/medium/test_2221_find_triangular_sum_of_an_array.rb)                                               |
+| 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)                                          |
 | 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.2'
+  s.version = '9.1.3'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/2225_find_players_with_zero_or_one_losses.rb

@@ -0,0 +1,29 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/find-players-with-zero-or-one-losses/
+# @param {Integer[][]} matches
+# @return {Integer[][]}
+def find_winners(matches)
+  zeros = ::Set.new
+  ones = ::Set.new
+  marks = ::Set.new
+
+  matches.each do |match|
+    w = match[0]
+
+    zeros << w unless marks.include?(w)
+
+    l = match[1]
+
+    if marks.include?(l)
+      ones.delete(l)
+    else
+      ones << l
+      marks << l
+    end
+
+    zeros.delete(l)
+  end
+
+  [zeros.sort, ones.sort]
+end

test/medium/test_2225_find_players_with_zero_or_one_losses.rb

@@ -0,0 +1,47 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/medium/2225_find_players_with_zero_or_one_losses'
+require 'minitest/autorun'
+
+class FindPlayersWithZeroOrOneLossesTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      [
+        [1, 2, 10],
+        [4, 5, 7, 8]
+      ],
+      find_winners(
+        [
+          [1, 3],
+          [2, 3],
+          [3, 6],
+          [5, 6],
+          [5, 7],
+          [4, 5],
+          [4, 8],
+          [4, 9],
+          [10, 4],
+          [10, 9]
+        ]
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      [
+        [1, 2, 5, 6],
+        []
+      ],
+      find_winners(
+        [
+          [2, 3],
+          [1, 3],
+          [5, 4],
+          [6, 4]
+        ]
+      )
+    )
+  end
+end