Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 17.8 MB (28.05%)

Author: jimit105

1927-maximum-ascending-subarray-sum/README.md

@@ -0,0 +1,38 @@
+<p>Given an array of positive integers <code>nums</code>, return the <em>maximum possible sum of an <strong>ascending</strong> subarray in </em><code>nums</code>.</p>
+
+<p>A subarray is defined as a contiguous sequence of numbers in an array.</p>
+
+<p>A subarray <code>[nums<sub>l</sub>, nums<sub>l+1</sub>, ..., nums<sub>r-1</sub>, nums<sub>r</sub>]</code> is <strong>ascending</strong> if for all <code>i</code> where <code>l &lt;= i &lt; r</code>, <code>nums<sub>i </sub> &lt; nums<sub>i+1</sub></code>. Note that a subarray of size <code>1</code> is <strong>ascending</strong>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [10,20,30,5,10,50]
+<strong>Output:</strong> 65
+<strong>Explanation: </strong>[5,10,50] is the ascending subarray with the maximum sum of 65.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [10,20,30,40,50]
+<strong>Output:</strong> 150
+<strong>Explanation: </strong>[10,20,30,40,50] is the ascending subarray with the maximum sum of 150.
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [12,17,15,13,10,11,12]
+<strong>Output:</strong> 33
+<strong>Explanation: </strong>[10,11,12] is the ascending subarray with the maximum sum of 33.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
+</ul>

1927-maximum-ascending-subarray-sum/solution.py

@@ -0,0 +1,20 @@
+# Approach 2: Linear Scan
+
+# Time: O(n)
+# Space: O(1)
+
+class Solution:
+    def maxAscendingSum(self, nums: List[int]) -> int:
+        max_sum = 0
+        curr_subarray_sum = nums[0]
+
+        for curr_idx in range(1, len(nums)):
+            if nums[curr_idx] <= nums[curr_idx - 1]:
+                # If the current element is not greater than the previous one, update maxSum
+                max_sum = max(max_sum, curr_subarray_sum)
+                curr_subarray_sum = 0
+            curr_subarray_sum += nums[curr_idx]
+
+        # Final check after the loop ends to account for the last ascending subarray
+        return max(max_sum, curr_subarray_sum)
+