Jun 16

Author: siddydutta

2025-06-June-LeetCoding-Challenge/Maximum Difference Between Increasing Elements.py

@@ -0,0 +1,22 @@
+class Solution:
+    def maximumDifference(self, nums: list[int]) -> int:
+        min_so_far, max_diff = float('inf'), float('-inf')
+        for num in nums:
+            min_so_far = min(min_so_far, num)
+            max_diff = max(max_diff, num - min_so_far)
+        return max_diff if max_diff else -1
+
+
+def main():
+    nums = [7, 1, 5, 4]
+    assert Solution().maximumDifference(nums) == 4
+
+    nums = [9, 4, 3, 2]
+    assert Solution().maximumDifference(nums) == -1
+
+    nums = [1, 5, 2, 10]
+    assert Solution().maximumDifference(nums) == 9
+
+
+if __name__ == '__main__':
+    main()

2025-06-June-LeetCoding-Challenge/README.md

@@ -19,7 +19,7 @@
 | June 13 | [2616. Minimize the Maximum Difference of Pairs](https://leetcode.com/problems/minimize-the-maximum-difference-of-pairs/) | Medium | Solved |
 | June 14 | []() |  |  |
 | June 15 | []() |  |  |
-| June 16 | []() |  |  |
+| June 16 | [2016. Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/) | Easy | Solved |
 | June 17 | []() |  |  |
 | June 18 | []() |  |  |
 | June 19 | []() |  |  |
@@ -39,6 +39,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 2 | 2 | 0 |
+| Easy   | 3 | 3 | 0 |
 | Medium | 7 | 4 | 3 |
 | Hard   | 4 | 2 | 2 |