Shortest Subarray with Sum at Least K (LeetCode 862)
HardLeetCode 862 · Variable Size Window · Google, Amazon +6 · 35:37Shortest Subarray with Sum at Least K · Already Studied Concept · Leetcode 862My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 862 Shortest Subarray with Sum at Least K by codestorywithMIK: Sliding Window, Hard. Topics: Array, Binary Search, Queue, Sliding Window. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue
- Patterns
- Variable Size Window
- Chapter
- Sliding Window
- Duration
- 35:37
Related problems
- Minimum Size Subarray Sum (LeetCode 209)
- Minimum Window Substring (LeetCode 76)
- Contains Duplicate II (Sliding Window) -(Airbnb, Palantir Technologies): Explanation ➕ Live Coding (LeetCode 219)
- Maximum Number of Vowels in a Substring of Given Length (LeetCode 1456)
- K Radius Subarray Averages (LeetCode 2090)
- Longest Subarray of 1's After Deleting One Element (LeetCode 1493)
- Maximize the Confusion of an Exam (LeetCode 2024)
- Count Complete Substrings (LeetCode 2953)