Find count of subarrays having sum in a given range in less than O(n^2).

Revision en1, by code_fille, 2015-10-16 23:03:29

Given an array of integers and a range find the count of subarrays whose sum lies in the given range. Do so in less than O(n^2) complexity.

Tags subarray

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English code_fille 2015-10-16 23:03:29 211 Initial revision (published)