docs: add Merge k Sorted Lists in the main problem list

Author: bujosa

src/hard/median_of_two_sorted_arrays.rs

@@ -8,13 +8,13 @@ pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
 
     let half = (nums1.len() + nums2.len() + 1) / 2;
     let (m, n) = (nums1.len(), nums2.len());
-    let (mut low, mut high) = (0, m);
+    let (mut left, mut right) = (0, m);
 
-    while low <= high {
-        let partition_x = (low + high) / 2;
-        let partition_y =  half - partition_x;
+    while left <= right {
+        let partition_x = (left + right) / 2;
+        let partition_y = half - partition_x;
 
-        // Partition_x is always greater than 0
+        // Partition_x is for m, Partition_y is for n
         let max_x = if partition_x == 0 {
             i32::MIN
         } else {
@@ -27,7 +27,6 @@ pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
             nums1[partition_x]
         };
 
-        // Partition_y is always greater than 0
         let max_y = if partition_y == 0 {
             i32::MIN
         } else {
@@ -40,12 +39,13 @@ pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
             nums2[partition_y]
         };
 
+        // Three conditions
         if max_x <= min_y && max_y <= min_x {
             return calculate_median(max_x, max_y, min_x, min_y, m, n);
         } else if max_x > min_y {
-            high = partition_x - 1;
+            right = partition_x - 1;
         } else {
-            low = partition_x + 1;
+            left = partition_x + 1;
         }
     }
     0.0

src/readme.md

@@ -69,6 +69,7 @@
   - [x] [981. Time based key-value store](../src/medium/time_based_key_value_store.rs) -> [Problem Description](../src/medium/readme.md#981-time-based-key-value-store)
 - [Hard](../src/hard)
   - [x] [4. Median of two sorted arrays](../src/hard/median_of_two_sorted_arrays.rs) -> [Problem Description](../src/hard/readme.md#4-median-of-two-sorted-arrays)
+  - [ ] [23. Merge k sorted lists](../src/hard/merge_k_sorted_lists.rs) -> [Problem Description](../src/hard/readme.md#23-merge-k-sorted-lists)
   - [x] [42. Trapping rain water](../src/hard/trapping_rain_water.rs) -> [Problem Description](../src/hard/readme.md#42-trapping-rain-water)
   - [x] [76. Minimum window substring](../src/hard/minimum_window_substring.rs) -> [Problem Description](../src/hard/readme.md#76-minimum-window-substring)
   - [x] [84. Largest rectangle in histogram](../src/hard/largest_rectangle_in_histogram.rs) -> [Problem Description](../src/hard/readme.md#84-largest-rectangle-in-histogram)

theory/categories/3.linked_list/readme.md

@@ -36,11 +36,11 @@
 - [x] [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](../../../src/medium/add_two_numbers.rs)
 - [x] [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | Medium | [Solution](../../../src/medium/find_the_duplicate_number.rs) | [Problem Description](../../../src/medium/readme.md#287-find-the-duplicate-number)
 - [x] [LRU Cache](https://leetcode.com/problems/lru-cache/) | Medium | [Solution](../../../src/medium/lru_cache.rs) | [Problem Description](../../../src/medium/readme.md#146-lru-cache)
-- [ ] [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](../../../src/hard/merge_k_sorted_lists.rs)
+- [ ] [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](../../../src/hard/merge_k_sorted_lists.rs) | [Problem Description](../../../src/hard/readme.md#23-merge-k-sorted-lists)
 - [ ] [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | Hard | [Solution](../../../src/hard/reverse_nodes_in_k_group.rs)
 
 Category: `Linked List`
 Created on: 2023-08-22 01:00:00
-Last modified on: 2023-09-30 12:25:00
+Last modified on: 2023-10-05 21:23:00
 Status: In Progress
 Author: [David Bujosa](https://github.com/bujosa)