2025-01-17 v. 8.1.4: added "973. K Closest Points to Origin"

Author: fartem

README.md

@@ -648,6 +648,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 951. Flip Equivalent Binary Trees                                | [Link](https://leetcode.com/problems/flip-equivalent-binary-trees/)                                | [Link](./lib/medium/951_flip_equivalent_binary_trees.rb)                                | [Link](./test/medium/test_951_flip_equivalent_binary_trees.rb)                                |
 | 958. Check Completeness of a Binary Tree                         | [Link](https://leetcode.com/problems/check-completeness-of-a-binary-tree/)                         | [Link](./lib/medium/958_check_completeness_of_a_binary_tree.rb)                         | [Link](./test/medium/test_958_check_completeness_of_a_binary_tree.rb)                         |
 | 967. Numbers With Same Consecutive Differences                   | [Link](https://leetcode.com/problems/numbers-with-same-consecutive-differences/)                   | [Link](./lib/medium/967_numbers_with_same_consecutive_differences.rb)                   | [Link](./test/medium/test_967_numbers_with_same_consecutive_differences.rb)                   |
+| 973. K Closest Points to Origin                                  | [Link](https://leetcode.com/problems/k-closest-points-to-origin/)                                  | [Link](./lib/medium/973_k_closest_points_to_origin.rb)                                  | [Link](./test/medium/test_973_k_closest_points_to_origin.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)                                |

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

lib/medium/973_k_closest_points_to_origin.rb

@@ -0,0 +1,9 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/k-closest-points-to-origin/
+# @param {Integer[][]} points
+# @param {Integer} k
+# @return {Integer[][]}
+def k_closest(points, k)
+  points.sort_by { |point| point[0] * point[0] + point[1] * point[1] }[0...k]
+end

test/medium/test_973_k_closest_points_to_origin.rb

@@ -0,0 +1,39 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/medium/973_k_closest_points_to_origin'
+require 'minitest/autorun'
+
+class KClosestPointsToOriginTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      [
+        [-2, 2]
+      ],
+      k_closest(
+        [
+          [1, 3],
+          [-2, 2]
+        ],
+        1
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      [
+        [3, 3],
+        [-2, 4]
+      ],
+      k_closest(
+        [
+          [3, 3],
+          [5, -1],
+          [-2, 4]
+        ],
+        2
+      )
+    )
+  end
+end