Smallest Subarray with Sum Greater than or Equal to K (Target) | Sliding Window

Given an array of positive integers and a positive number k. Find the smallest contiguous subarray whose sum is either greater than or equal to k. If no subarray is found then return 0.
Smallest subarray sum java code - webrewrite.com/minimum-size-s...
LeetCode Solutions Java Code - • LeetCode Solutions | Java
Linked List Interview Questions - • Linked List | Intervie...
Binary Tree Interview Questions - • Binary Tree | Intervie...
Stack Interview Questions - • Stack | Interview Ques...
Coding Interview Books -
Cracking the coding interview - amzn.to/3h70jXy
Data structure and algorithms made easy - amzn.to/3jgMl7U
Contact Me through this Form - webrewrite.com/contact-us/
Website - webrewrite.com/
Join Membership - / @programmingtutorials1m

[@monke890]

finished all 55 questions thanks man! good revision for placements

[@ProgrammingTutorials1M]

Great

[@iWontFakeIt]

this won't work for arrays with negative elements