Available question text
Count how many contiguous subarrays of length k have an average ≥ threshold — equivalently, how many sliding windows have sum ≥ k×threshold. This is a linear-time sliding-window problem suitable for arrays up to about 1e5 in length.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source