Merge pull request #737 from fartem/209_Minimum_Size_Subarray_Sum

2024-09-27 v. 6.7.0: added "209. Minimum Size Subarray Sum"

Author: fartem

README.md

@@ -535,3 +535,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 200. Number of Islands                                          | [Link](https://leetcode.com/problems/number-of-islands/)                                          | [Link](./lib/medium/200_number_of_islands.rb)                                          | [Link](./test/medium/test_200_number_of_islands.rb)                                          |
 | 204. Count Primes                                               | [Link](https://leetcode.com/problems/count-primes/)                                               | [Link](./lib/medium/204_count_primes.rb)                                               | [Link](./test/medium/test_204_count_primes.rb)                                               |
 | 208. Implement Trie (Prefix Tree)                               | [Link](https://leetcode.com/problems/implement-trie-prefix-tree/)                                 | [Link](./lib/medium/208_implement_trie_prefix_tree.rb)                                 | [Link](./test/medium/test_208_implement_trie_prefix_tree.rb)                                 |
+| 209. Minimum Size Subarray Sum                                  | [Link](https://leetcode.com/problems/minimum-size-subarray-sum/)                                  | [Link](./lib/medium/209_minimum_size_subarray_sum.rb)                                  | [Link](./test/medium/test_209_minimum_size_subarray_sum.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 = '6.6.9'
+  s.version = '6.7.0'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/209_minimum_size_subarray_sum.rb

@@ -0,0 +1,23 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/minimum-size-subarray-sum/
+# @param {Integer} target
+# @param {Integer[]} nums
+# @return {Integer}
+def min_sub_array_len(target, nums)
+  max = 1_000_000_000_000_000
+  result = max
+  l = 0
+  sum = 0
+  (0...nums.size).each do |i|
+    sum += nums[i]
+    while sum >= target
+      result = [result, i - l].min
+      sum -= nums[l]
+
+      l += 1
+    end
+  end
+
+  result == max ? 0 : result + 1
+end

test/medium/test_209_minimum_size_subarray_sum.rb

@@ -0,0 +1,37 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/medium/209_minimum_size_subarray_sum'
+require 'minitest/autorun'
+
+class MinimumSizeSubarraySumTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      2,
+      min_sub_array_len(
+        7,
+        [2, 3, 1, 2, 4, 3]
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      1,
+      min_sub_array_len(
+        4,
+        [1, 4, 4]
+      )
+    )
+  end
+
+  def test_default_three
+    assert_equal(
+      0,
+      min_sub_array_len(
+        11,
+        [1, 1, 1, 1, 1, 1, 1, 1]
+      )
+    )
+  end
+end