Skip to content

Commit fa51afc

Browse files
authored
Merge pull request #622 from fartem/2395_Find_Subarrays_With_Equal_Sum
2024-05-10 v. 5.6.5: added "2395. Find Subarrays With Equal Sum"
2 parents 7ec43b9 + da86865 commit fa51afc

File tree

4 files changed

+35
-1
lines changed

4 files changed

+35
-1
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -425,3 +425,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
425425
| 2379. Minimum Recolors to Get K Consecutive Black Blocks | [Link](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/) | [Link](./lib/easy/2379_minimum_recolors_to_get_k_consecutive_black_blocks.rb) |
426426
| 2383. Minimum Hours of Training to Win a Competition | [Link](https://leetcode.com/problems/minimum-hours-of-training-to-win-a-competition/) | [Link](./lib/easy/2383_minimum_hours_of_training_to_win_a_competition.rb) |
427427
| 2389. Longest Subsequence With Limited Sum | [Link](https://leetcode.com/problems/longest-subsequence-with-limited-sum/) | [Link](./lib/easy/2389_longest_subsequence_with_limited_sum.rb) |
428+
| 2395. Find Subarrays With Equal Sum | [Link](https://leetcode.com/problems/find-subarrays-with-equal-sum/) | [Link](./lib/easy/2395_find_subarrays_with_equal_sum.rb) |

leetcode-ruby.gemspec

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ require 'English'
55
::Gem::Specification.new do |s|
66
s.required_ruby_version = '>= 3.0'
77
s.name = 'leetcode-ruby'
8-
s.version = '5.6.4'
8+
s.version = '5.6.5'
99
s.license = 'MIT'
1010
s.files = ::Dir['lib/**/*.rb'] + %w[bin/leetcode-ruby README.md LICENSE]
1111
s.executable = 'leetcode-ruby'
Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
# frozen_string_literal: true
2+
3+
# https://leetcode.com/problems/find-subarrays-with-equal-sum/
4+
# @param {Integer[]} nums
5+
# @return {Boolean}
6+
def find_subarrays(nums)
7+
sums = ::Set.new
8+
prev = nums.first
9+
(1...nums.length).each do |i|
10+
num = nums[i]
11+
sum = num + prev
12+
13+
return true if sums.include?(sum)
14+
15+
sums << sum
16+
prev = num
17+
end
18+
19+
false
20+
end
Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
# frozen_string_literal: true
2+
3+
require_relative '../test_helper'
4+
require_relative '../../lib/easy/2395_find_subarrays_with_equal_sum'
5+
require 'minitest/autorun'
6+
7+
class FindSubarraysWithEqualSumTest < ::Minitest::Test
8+
def test_default
9+
assert(find_subarrays([4, 2, 4]))
10+
assert(!find_subarrays([1, 2, 3, 4, 5]))
11+
assert(find_subarrays([0, 0, 0]))
12+
end
13+
end

0 commit comments

Comments
 (0)