LeetCode Question

#862 Shortest Subarray with Sum at Least K

SWE coding Hard

Question Details

LeetCode #862: Shortest Subarray with Sum at Least K. Difficulty: Hard. Topics: Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue. Asked at Google in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Heap (Priority Queue) Monotonic Queue Prefix Sum Arrays Binary Search Heap Queue Sliding Window

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview

← All Google questions Google Software Engineer Questions → All Array, Binary-Search, Queue, Sliding-Window, Heap, Prefix-Sum, Monotonic-Queue Questions →