Can we find the sum of all sub-arrays of an integer array in O -LRB- n -RRB- time ?
Given a sorted array , what are some good ways to find all its subsets whose sum is equal to a given value k in O -LRB- n -RRB- ?