From c9415765f5c8265076d7a74bbf0ca132dc0e8d1a Mon Sep 17 00:00:00 2001 From: Amit S Sahu <Amit.123854@stu.upes.ac.in> Date: Sun, 13 Oct 2024 10:10:15 +0530 Subject: [PATCH] Create README - LeetHub --- .../README.md | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 0632-smallest-range-covering-elements-from-k-lists/README.md diff --git a/0632-smallest-range-covering-elements-from-k-lists/README.md b/0632-smallest-range-covering-elements-from-k-lists/README.md new file mode 100644 index 0000000..c287b0d --- /dev/null +++ b/0632-smallest-range-covering-elements-from-k-lists/README.md @@ -0,0 +1,33 @@ +<h2><a href="https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists">632. Smallest Range Covering Elements from K Lists</a></h2><h3>Hard</h3><hr><p>You have <code>k</code> lists of sorted integers in <strong>non-decreasing order</strong>. Find the <b>smallest</b> range that includes at least one number from each of the <code>k</code> lists.</p> + +<p>We define the range <code>[a, b]</code> is smaller than range <code>[c, d]</code> if <code>b - a < d - c</code> <strong>or</strong> <code>a < c</code> if <code>b - a == d - c</code>.</p> + +<p> </p> +<p><strong class="example">Example 1:</strong></p> + +<pre> +<strong>Input:</strong> nums = [[4,10,15,24,26],[0,9,12,20],[5,18,22,30]] +<strong>Output:</strong> [20,24] +<strong>Explanation: </strong> +List 1: [4, 10, 15, 24,26], 24 is in range [20,24]. +List 2: [0, 9, 12, 20], 20 is in range [20,24]. +List 3: [5, 18, 22, 30], 22 is in range [20,24]. +</pre> + +<p><strong class="example">Example 2:</strong></p> + +<pre> +<strong>Input:</strong> nums = [[1,2,3],[1,2,3],[1,2,3]] +<strong>Output:</strong> [1,1] +</pre> + +<p> </p> +<p><strong>Constraints:</strong></p> + +<ul> + <li><code>nums.length == k</code></li> + <li><code>1 <= k <= 3500</code></li> + <li><code>1 <= nums[i].length <= 50</code></li> + <li><code>-10<sup>5</sup> <= nums[i][j] <= 10<sup>5</sup></code></li> + <li><code>nums[i]</code> is sorted in <strong>non-decreasing</strong> order.</li> +</ul>