Sliding Window - Shortest - Two Pointers / Sliding Window

https://algo.monster/problems/subarray_sum_shortest

We run the inner while loop as long as the window is valid, which is the condition (windowSum >= target). Won’t this give erroneous results for arrays where there is no sum that equals target?

Sum should be at least target. I misread the question. My bad.