dpalmasan / dpalmasan/code-challenges

Tamaño mínimo de subarray tal que la suma sea `>= K`

Open
#49 0 comments 0 reactions 0 assignees View on GitHub
arrays
Dominant language
Python
Stars
43
Forks
5
PR merge metrics
No merged PRs in 30d

Description

Given an array of positive integers nums and a positive integer target, return the minimal length of a contiguous subarray [numsl, numsl+1, ..., numsr-1, numsr] of which the sum is greater than or equal to target. If there is no such subarray, return 0 instead.

Contributor guide

No contributing guide indexed for this repository

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.