2025-03-07 v. 8.8.6: added "1834. Single-Threaded CPU"

Author: fartem

README.md

@@ -719,6 +719,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 1814. Count Nice Pairs in an Array                                                  | [Link](https://leetcode.com/problems/count-nice-pairs-in-an-array/)                                                  | [Link](./lib/medium/1814_count_nice_pairs_in_an_array.rb)                                                  | [Link](./test/medium/test_1814_count_nice_pairs_in_an_array.rb)                                                  |
 | 1823. Find the Winner of the Circular Game                                          | [Link](https://leetcode.com/problems/find-the-winner-of-the-circular-game/)                                          | [Link](./lib/medium/1823_find_the_winner_of_the_circular_game.rb)                                          | [Link](./test/medium/test_1823_find_the_winner_of_the_circular_game.rb)                                          |
 | 1829. Maximum XOR for Each Query                                                    | [Link](https://leetcode.com/problems/maximum-xor-for-each-query/)                                                    | [Link](./lib/medium/1829_maximum_xor_for_each_query.rb)                                                    | [Link](./test/medium/test_1829_maximum_xor_for_each_query.rb)                                                    |
+| 1834. Single-Threaded CPU                                                           | [Link](https://leetcode.com/problems/single-threaded-cpu/)                                                           | [Link](./lib/medium/1834_single_threaded_cpu.rb)                                                           | [Link](./test/medium/test_1834_single_threaded_cpu.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)                                                   |
 | 2429. Minimize XOR                                                                  | [Link](https://leetcode.com/problems/minimize-xor/)                                                                  | [Link](./lib/medium/2429_minimize_xor.rb)                                                                  | [Link](./test/medium/test_2429_minimize_xor.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.8.5'
+  s.version = '8.8.6'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/1834_single_threaded_cpu.rb

@@ -0,0 +1,89 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/single-threaded-cpu/
+# @param {Integer[][]} tasks
+# @return {Integer[]}
+def get_order(tasks)
+  sorted_tasks = tasks.each_with_index.map { |t, idx| [t[0], t[1], idx] }.sort_by { |et, _, _| et }
+
+  current_time = 0
+  result = []
+  i = 0
+  heap = []
+
+  while i < sorted_tasks.size || !heap.empty?
+    while i < sorted_tasks.size && sorted_tasks[i][0] <= current_time
+      insert_heap(heap, [sorted_tasks[i][1], sorted_tasks[i][2]])
+      i += 1
+    end
+
+    if heap.empty? && i < sorted_tasks.size
+      current_time = sorted_tasks[i][0]
+      while i < sorted_tasks.size && sorted_tasks[i][0] <= current_time
+        insert_heap(heap, [sorted_tasks[i][1], sorted_tasks[i][2]])
+        i += 1
+      end
+    end
+
+    next if heap.empty?
+
+    pt, idx = extract_min(heap)
+    result << idx
+    current_time += pt
+  end
+
+  result
+end
+
+private
+
+# @param {Integer[]} heap
+# @param {Integer} element
+# @return {Void}
+def insert_heap(heap, element)
+  heap << element
+  index = heap.size - 1
+
+  while index.positive?
+    parent = (index - 1) / 2
+
+    break unless compare(element, heap[parent])
+
+    heap[index], heap[parent] = heap[parent], heap[index]
+    index = parent
+  end
+end
+
+# @param {Integer[]} heap
+# @return {Integer}
+def extract_min(heap)
+  return if heap.empty?
+
+  min = heap[0]
+  last = heap.pop
+
+  unless heap.empty?
+    heap[0] = last
+    index = 0
+    loop do
+      left = 2 * index + 1
+      right = 2 * index + 2
+      smallest = index
+
+      smallest = left if left < heap.size && compare(heap[left], heap[smallest])
+      smallest = right if right < heap.size && compare(heap[right], heap[smallest])
+
+      break if smallest == index
+
+      heap[index], heap[smallest] = heap[smallest], heap[index]
+      index = smallest
+    end
+  end
+
+  min
+end
+
+# @param {Integer} a
+# @param {Integer} b
+# @return {Integer}
+def compare(a, b) = a[0] < b[0] || (a[0] == b[0] && a[1] < b[1])

test/medium/test_1834_single_threaded_cpu.rb

@@ -0,0 +1,36 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/medium/1834_single_threaded_cpu'
+require 'minitest/autorun'
+
+class SingleThreasedCPUTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      [0, 2, 3, 1],
+      get_order(
+        [
+          [1, 2],
+          [2, 4],
+          [3, 2],
+          [4, 1]
+        ]
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      [4, 3, 2, 0, 1],
+      get_order(
+        [
+          [7, 10],
+          [7, 12],
+          [7, 5],
+          [7, 4],
+          [7, 2]
+        ]
+      )
+    )
+  end
+end