| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 151 |
Netflix Onsite Interview Question
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 the component must be less than the threshold (sum(a[i]...a[j])*(j-i+1) < threshold).
How we can solve this question optimally?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en6 |
|
gXa | 2021-06-28 09:27:17 | 48 | Tiny change: '\nOutput\n~~~~~\nO' -> '\nOutput\n\n~~~~~\nO' | |
| en5 |
|
gXa | 2021-06-28 09:25:06 | 98 | ||
| en4 |
|
gXa | 2021-06-28 09:16:54 | 130 | ||
| en3 |
|
gXa | 2021-06-28 08:51:03 | 39 | ||
| en2 |
|
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 |
|
gXa | 2021-06-28 08:48:56 | 276 | Initial revision (published) |
