Loading Company...
This is a verified interview question from Google. Candidates reporting seeing this problem in recent Online Assessments (OAs) and onsite rounds. Mastering "Maximum Count Above Threshold in a Window - Google OA IIIT Allahabad" covers key patterns like Arrays.
"You are given an array A of size N, an integer K (1 ≤ K ≤ N), and a threshold G. Among all subarrays of length K, find the maximum number of elements strictly greater than G. ### Problem ### Input - First line: N K G - Second line: N space-separated integers A[i] ### Output - Print a single integer: the maximum count."
Join thousands of developers practicing for Google.