Leetcode 862. Shortest Subarray with Sum at Least K

Input: nums = [1], k = 1
Output: 1
Input: nums = [1,2], k = 4
Output: -1
Input: nums = [2,-1,2], k = 3
Output: 3

--

--

--

CS new grad, 6 years experience related to supply chain management. Located in Bay area

Love podcasts or audiobooks? Learn on the go with our new app.

Thoughts on Aging Software

Beginner friendly introduction into DevOps with Docker on Windows

a screenshot of docker compose file used by me

I’ll always have a strong passion in accounting and e-commerce

lucasdu.com | devlog #2

{UPDATE} PopStar!-stars crush Hack Free Resources Generator

Arctos Biweekly Report: Mar 21st — Apr 3rd

The Top 5 Myths About IT Staff Augmentation

Notice: System Upgrade Maintenance from 21:00 UTC+7 09/19

featured_image

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Gary Chiang

Gary Chiang

CS new grad, 6 years experience related to supply chain management. Located in Bay area

More from Medium

Leetcode 452. Minimum Number of Arrows to Burst Balloons

Count the number of islands 🏝

Leetcode Q521. Longest Uncommon Subsequence I (Q440)

Knight Probability in Chessboard Solution | LeetCode-688: Medium | JavaScript Implementation