Mobile coding works. A laptop is faster for long sessions.
Problem
Given an array and integer S, find the minimal length of a contiguous subarray with sum ≥ S. If none exists, print 0.
Input format
Input
input.txt
- The first line contains N and S (1 ≤ N ≤ 100). - The second line contains N integers.
Output format
Output
output.txt
- The minimal length, or 0.
Example
input
5 11 1 2 3 4 5
output
3
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
5 11 1 2 3 4 5
Expected output
3
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc