Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Add leetcode question Shortest Subarray with Sum at Least K #2453

Open
Nikitajain2606 opened this issue Oct 1, 2021 · 1 comment
Open

Add leetcode question Shortest Subarray with Sum at Least K #2453

Nikitajain2606 opened this issue Oct 1, 2021 · 1 comment

Comments

@Nikitajain2606
Copy link

Nikitajain2606 commented Oct 1, 2021 •
edited
Loading

AIM-

Given an integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1

Programming language

  • C++
@Nikitajain2606
Copy link
Author

hey @Ayush7614 assign this issue to me for hacktoberfest

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@Nikitajain2606