feat(work): add new LeetCode solutions for median, largest rectangle, and simplify path

work/1/Hard/Array/4.median-of-two-sorted-arrays.py

@@ -0,0 +1,46 @@
+"""
+4. Median of Two Sorted Arrays
+Difficulty: Hard
+https://leetcode.com/problems/median-of-two-sorted-arrays/
+
+──────────────────────────────────────────────────
+
+Given two sorted arrays nums1 and nums2 of size m and n respectively,
+return the median of the two sorted arrays.
+
+The overall run time complexity should be O(log (m+n)).
+
+ 
+
+Example 1:
+
+Input: nums1 = [1,3], nums2 = [2]
+Output: 2.00000
+Explanation: merged array = [1,2,3] and median is 2.
+
+Example 2:
+
+Input: nums1 = [1,2], nums2 = [3,4]
+Output: 2.50000
+Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.
+
+ 
+
+Constraints:
+
+	• nums1.length == m
+
+	• nums2.length == n
+
+	• 0 <= m <= 1000
+
+	• 0 <= n <= 1000
+
+	• 1 <= m + n <= 2000
+
+	• -10^6 <= nums1[i], nums2[i] <= 10^6
+"""
+
+class Solution:
+    def findMedianSortedArrays(self, nums1: list[int], nums2: list[int]) -> float:
+        

work/1/Hard/Array/84.largest-rectangle-in-histogram.py

@@ -0,0 +1,38 @@
+"""
+84. Largest Rectangle in Histogram
+Difficulty: Hard
+https://leetcode.com/problems/largest-rectangle-in-histogram/
+
+──────────────────────────────────────────────────
+
+Given an array of integers heights representing the histogram's bar
+height where the width of each bar is 1, return the area of the
+largest rectangle in the histogram.
+
+ 
+
+Example 1:
+
+Input: heights = [2,1,5,6,2,3]
+Output: 10
+Explanation: The above is a histogram where width of each bar is 1.
+The largest rectangle is shown in the red area, which has an area =
+10 units.
+
+Example 2:
+
+Input: heights = [2,4]
+Output: 4
+
+ 
+
+Constraints:
+
+	• 1 <= heights.length <= 10^5
+
+	• 0 <= heights[i] <= 10^4
+"""
+
+class Solution:
+    def largestRectangleArea(self, heights: list[int]) -> int:
+