added a problem with solution on sliding window. #8566
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,45 @@ | ||
| def minsubarraysum(target: int, nums: List[int]) -> int: | ||
| """ | ||
| Returns the length of the shortest contiguous subarray | ||
| in nums whose sum is at least target. | ||
|
|
||
| Args: | ||
| target (int): The minimum sum that the subarray should have. | ||
| nums (List[int]): The array to search for subarrays in. | ||
|
|
||
| Returns: | ||
| int: The length of the shortest contiguous subarray | ||
| in nums whose sum is at least target. If no such subarray exists, returns 0. | ||
|
|
||
| Examples: | ||
| >>> minsubarraysum(7, [2, 3, 1, 2, 4, 3]) | ||
| 2 | ||
| >>> minsubarraysum(4, [1, 4, 4]) | ||
| 1 | ||
| >>> minsubarraysum(11, [1, 1, 1, 1, 1, 1, 1, 1]) | ||
| 0 | ||
| """ | ||
|
|
||
| n = len(nums) | ||
| if(n == 0): | ||
|
There was a problem hiding this comment. An error occured while parsing the file: Traceback (most recent call last):
File "/opt/render/project/src/algorithms_keeper/parser/python_parser.py", line 145, in parse
reports = lint_file(
^^^^^^^^^^
libcst._exceptions.ParserSyntaxError: Syntax Error @ 24:5.
parser error: error at 23:4: expected one of (, *, +, -, ..., AWAIT, DEDENT, False, NAME, NUMBER, None, True, [, break, continue, lambda, match, not, pass, ~
if(n == 0):
^ |
||
| return 0 | ||
|
|
||
| left = 0 | ||
| right = 0 | ||
| curr_sum = 0 | ||
| min_len = float("inf") | ||
|
|
||
| while right < n: | ||
| curr_sum += nums[right] | ||
| while curr_sum >= target: | ||
| min_len = min(min_len, right - left + 1) | ||
| curr_sum -= nums[left] | ||
| left += 1 | ||
| right += 1 | ||
|
|
||
| return min_len if min_len != float("inf") else 0 | ||
|
|
||
|
|
||
| nums = [2, 3, 1, 2, 4, 3] | ||
| target = 7 | ||
| print(minsubarraysum(target, nums)) | ||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Could you add a couple more doctests with different numbers and perhaps negative numbers as well
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Yeah I will do it sooner
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@CaedenPH, done....