| # | 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 |
Maximum Sum Sub-array — Partial Sums Approach (With Implementation)
Solving another classic: the Maximum sum sub-array problem.
I am amazed to find out how many of you guys have solved this question, but only so few know the approach using partial sums.
This video is for you!
Also, throwback to those amazing times I was shooting my "Bible of Coding Interviews and Competitive Programming" on the whiteboard from student dorm room.
More to come, Andy
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en1 |
|
RomeoFantastik | 2020-01-20 19:21:01 | 514 | Initial revision (published) |
