How to solve this problem?

Revision en3, by rahul_bhaiya_sabka_baap, 2018-08-01 20:55:59

Given an array of N numbers and a number K find the maximum subarray size such that the average of the elements of the subarray >= k

Tags arrays, #binary search

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English rahul_bhaiya_sabka_baap 2018-08-01 20:55:59 0 (published)
en2 English rahul_bhaiya_sabka_baap 2018-08-01 20:41:35 6 Tiny change: 'find the minimum sunarray size' -> 'find the maximum subarray size' (saved to drafts)
en1 English rahul_bhaiya_sabka_baap 2018-08-01 20:40:32 158 Initial revision (published)