Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -666,6 +666,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
| 1111. Maximum Nesting Depth of Two Valid Parentheses Strings | [Link](https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/) | [Link](./lib/medium/1111_maximum_nesting_depth_of_two_valid_parentheses_strings.rb) | [Link](./test/medium/test_1111_maximum_nesting_depth_of_two_valid_parentheses_strings.rb) |
| 1123. Lowest Common Ancestor of Deepest Leaves | [Link](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/) | [Link](./lib/medium/1123_lowest_common_ancestor_of_deepest_leaves.rb) | [Link](./test/medium/test_1123_lowest_common_ancestor_of_deepest_leaves.rb) |
| 1161. Maximum Level Sum of a Binary Tree | [Link](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/) | [Link](./lib/medium/1161_maximum_level_sum_of_a_binary_tree.rb) | [Link](./test/medium/test_1161_maximum_level_sum_of_a_binary_tree.rb) |
| 1171. Remove Zero Sum Consecutive Nodes from Linked List | [Link](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/) | [Link](./lib/medium/1171_remove_zero_sum_consecutive_nodes_from_linked_list.rb) | [Link](./test/medium/test_1171_remove_zero_sum_consecutive_nodes_from_linked_list.rb) |
| 1209. Remove All Adjacent Duplicates in String II | [Link](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | [Link](./lib/medium/1209_remove_all_adjacent_duplicates_in_string_ii.rb) | [Link](./test/medium/test_1209_remove_all_adjacent_duplicates_in_string_ii.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) |
Expand Down
2 changes: 1 addition & 1 deletion leetcode-ruby.gemspec
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@ require 'English'
::Gem::Specification.new do |s|
s.required_ruby_version = '>= 3.0'
s.name = 'leetcode-ruby'
s.version = '8.3.4'
s.version = '8.3.5'
s.license = 'MIT'
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
s.executable = 'leetcode-ruby'
Expand Down
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
# frozen_string_literal: true

require_relative '../common/linked_list'

# https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/
# @param {ListNode} head
# @return {ListNode}
def remove_zero_sum_sublists(head)
return unless head

dummy = ::ListNode.new(0)
dummy.next = head
prefix_sum = 0
prefix_sums = {}
current = dummy

while current
prefix_sum += current.val

if prefix_sums[prefix_sum]
prev = prefix_sums[prefix_sum]
temp_sum = prefix_sum
temp = prev.next

while temp != current
temp_sum += temp.val
prefix_sums.delete(temp_sum)
temp = temp.next
end

prev.next = current.next
else
prefix_sums[prefix_sum] = current
end

current = current.next
end

dummy.next
end
Original file line number Diff line number Diff line change
@@ -0,0 +1,53 @@
# frozen_string_literal: true

require_relative '../test_helper'
require_relative '../../lib/common/linked_list'
require_relative '../../lib/medium/1171_remove_zero_sum_consecutive_nodes_from_linked_list'
require 'minitest/autorun'

class RemoveZeroSumConsecutiveNodesFromLinkedListTest < ::Minitest::Test
def test_default_one
assert(
::ListNode.are_equals(
::ListNode.from_array(
[3, 1]
),
remove_zero_sum_sublists(
::ListNode.from_array(
[1, 2, -3, 3, 1]
)
)
)
)
end

def test_default_two
assert(
::ListNode.are_equals(
::ListNode.from_array(
[1, 2, 4]
),
remove_zero_sum_sublists(
::ListNode.from_array(
[1, 2, 3, -3, 4]
)
)
)
)
end

def test_default_three
assert(
::ListNode.are_equals(
::ListNode.from_array(
[1]
),
remove_zero_sum_sublists(
::ListNode.from_array(
[1, 2, 3, -3, -2]
)
)
)
)
end
end