Netflix Onsite Interview Question

Revision en1, by gXa, 2021-06-28 08:48:56

An array is given, and an index present in it.

A window must be chosen such that it includes the index, has this component maximized — sum(a[i]...a[j])*(j-i+1), but less than the threshold.

How we can solve this question optimally?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en6 English gXa 2021-06-28 09:27:17 48 Tiny change: '\nOutput\n~~~~~\nO' -> '\nOutput\n\n~~~~~\nO'
en5 English gXa 2021-06-28 09:25:06 98
en4 English gXa 2021-06-28 09:16:54 130
en3 English gXa 2021-06-28 08:51:03 39
en2 English gXa 2021-06-28 08:50:24 22 Tiny change: 'i+1), but less than' -> 'i+1), but the component must be less than'
en1 English gXa 2021-06-28 08:48:56 276 Initial revision (published)