| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
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) |
