Total number of subarrays with sum atmost k

Revision en1, by shivam565, 2022-10-23 19:58:08

How to find total number of subarray with sum atmost k.

Constrains :
-1e4 <= a[i] <= 1e4
1 <= n <= 1e5

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English shivam565 2022-10-23 19:59:46 2 Tiny change: 'm atmost k.\n<br>\n\n' -> 'm atmost k?\n<br>\n\n'
en2 English shivam565 2022-10-23 19:59:17 1 Tiny change: 'f subarray with sum ' -> 'f subarrays with sum '
en1 English shivam565 2022-10-23 19:58:08 170 Initial revision (published)