Feb 4

Author: siddydutta

2025-02-February-LeetCoding-Challenge/Maximum Ascending Subarray Sum.py

@@ -0,0 +1,29 @@
+from typing import List
+
+
+class Solution:
+    def maxAscendingSum(self, nums: List[int]) -> int:
+        curr_sum = nums[0]
+        max_sum = curr_sum
+        for i in range(1, len(nums)):
+            if nums[i] > nums[i-1]:
+                curr_sum += nums[i]
+            else:
+                curr_sum = nums[i]
+            max_sum = max(max_sum, curr_sum)
+        return max_sum
+
+
+def main():
+    nums = [10, 20, 30, 5, 10, 50]
+    assert Solution().maxAscendingSum(nums) == 65
+
+    nums = [10, 20, 30, 40, 50]
+    assert Solution().maxAscendingSum(nums) == 150
+
+    nums = [12, 17, 15, 13, 10, 11, 12]
+    assert Solution().maxAscendingSum(nums) == 33
+
+
+if __name__ == '__main__':
+    main()

2025-02-February-LeetCoding-Challenge/README.md

@@ -7,7 +7,7 @@
 | February 01 | [3151. Special Array I](https://leetcode.com/problems/special-array-i/) | Easy | Solved |
 | February 02 | [1752. Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/) | Easy | Solved |
 | February 03 | [3105. Longest Strictly Increasing or Strictly Decreasing Subarray](https://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/) | Easy | Solved |
-| February 04 | []() |  |  |
+| February 04 | [1800. Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/) | Easy | Solved |
 | February 05 | []() |  |  |
 | February 06 | []() |  |  |
 | February 07 | []() |  |  |
@@ -37,6 +37,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 3 | 3 | 0 |
+| Easy   | 4 | 4 | 0 |
 | Medium | 0 | 0 | 0 |
 | Hard   | 0 | 0 | 0 |