Counting Subarrays #InterviewBit || Intuition + Code+ Example

Problem Description

Given an array A of N non-negative numbers and you are also given non-negative number B.

You need to find the number of subarrays in A having sum less than B. We may assume that there is no overflow.

[viralustrends]

Toughest part in this question is adding size of array to count, else its similar to sliding window problems,

[anshumantripathy]

Thanks a lot, this week's contest's 3rd question - (#2762) had a similar approach. I was not able to understand the " i - j +1 " part. But Thanks to you, now I got it.

[hitheshpk]

nice explanation.The way you developed the optimised solution is nice.

[nehasht]

I like the way you have explained it ❤️❤️❤️❤️ it's very easy now

[nidhishparekh]

The question hasn't mentioned "contiguous sub-arrays so if A={1, 3, 5, 2, 6} and B = 5, you aren't considering the case of {1, 2}. Please explain. Thanks

[vikashsharma]

Kaash ...Mam aap meri classmate hoti...to .Mai Apple me pahuch jata....

[yadavswapnilnagnath]

Hey, great tutorial, can you explain line 19 in more details ? TIA