Skip to content

Latest commit

 

History

History

0209. Minimum Size Subarray Sum

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
README.md
README.md
 
 
Solution.java
Solution.java
 
 
Solution.kt
Solution.kt
 
 
Solution.py
Solution.py
 
 
solution.cpp
solution.cpp
 
 

README.md

209. Minimum Size Subarray Sum

Topics

Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.

For example, given the array [2,3,1,2,4,3] and s = 7,

the subarray [4,3] has the minimal length under the problem constraint.