GitHub

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. A ...

In one operation: choose an index i such that 0 <= i < nums.length, increase your score by nums [i], and replace nums [i] with ceil (nums [i] You are given a 0-indexed string s of even length n. The ...