2025-02-04 v. 8.4.0: added "1288. Remove Covered Intervals"

Author: fartem

README.md

@@ -672,6 +672,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 1248. Count Number of Nice Subarrays                             | [Link](https://leetcode.com/problems/count-number-of-nice-subarrays/)                              | [Link](./lib/medium/1248_count_number_of_nice_subarrays.rb)                             | [Link](./test/medium/test_1248_count_number_of_nice_subarrays.rb)                             |
 | 1249. Minimum Remove to Make Valid Parentheses                   | [Link](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/)                    | [Link](./lib/medium/1249_minimum_remove_to_make_valid_parentheses.rb)                   | [Link](./test/medium/test_1249_minimum_remove_to_make_valid_parentheses.rb)                   |
 | 1261. Find Elements in a Contaminated Binary Tree                | [Link](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/)                 | [Link](./lib/medium/1261_find_elements_in_a_contaminated_binary_tree.rb)                | [Link](./test/medium/test_1261_find_elements_in_a_contaminated_binary_tree.rb)                |
+| 1288. Remove Covered Intervals                                   | [Link](https://leetcode.com/problems/remove-covered-intervals/)                                    | [Link](./lib/medium/1288_remove_covered_intervals.rb)                                   | [Link](./test/medium/test_1288_remove_covered_intervals.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.3.9'
+  s.version = '8.4.0'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/1288_remove_covered_intervals.rb

@@ -0,0 +1,20 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/remove-covered-intervals/
+# @param {Integer[][]} intervals
+# @return {Integer}
+def remove_covered_intervals(intervals)
+  intervals.sort! { |a, b| a[0] == b[0] ? b[1] <=> a[1] : a[0] <=> b[0] }
+
+  result = 0
+  curr = 0
+  intervals.each do |interval|
+    next unless curr < interval[1]
+
+    curr = interval[1]
+
+    result += 1
+  end
+
+  result
+end

test/medium/test_1288_remove_covered_intervals.rb

@@ -0,0 +1,32 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/medium/1288_remove_covered_intervals'
+require 'minitest/autorun'
+
+class RemoveCoveredIntervalsTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      2,
+      remove_covered_intervals(
+        [
+          [1, 4],
+          [3, 6],
+          [2, 8]
+        ]
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      1,
+      remove_covered_intervals(
+        [
+          [1, 4],
+          [2, 3]
+        ]
+      )
+    )
+  end
+end