| # | 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 |
Number of subarrays with sum exactly = k.
Given an array a[] = {1, 1 ,1 , -1} . you have to find all the subarrays of the given array whose sum is exactly = k.
There is an geeks_article for it but the explanation is not good and clear and also without proof .
Can anyone explain me how to solve this problem with some explanation !
Thanks !
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
a_journey | 2019-02-05 15:22:55 | 11 | Tiny change: ' 1 , -1 } \n\nAns =' -> ' 1 , -1 } and k = 1 \n\nAns =' | |
| en4 |
|
a_journey | 2019-02-05 15:20:39 | 81 | ||
| en3 |
|
a_journey | 2019-02-05 15:18:17 | 6 | ||
| en2 |
|
a_journey | 2019-02-05 15:17:44 | 4 | Tiny change: 'xactly =_ ****k.\n\n\nTh' -> 'xactly =_ k.\n\n\nTh' | |
| en1 |
|
a_journey | 2019-02-05 15:17:25 | 430 | Initial revision (published) |
