Question -
Given an array of unsorted integers and number N, find out number of continuous sub sequences where each sub sequence sum is N.

Example -
Input -
N = 6

[2,4,1,5,6]

Output = 3

Explanation - Possible sub sequences {6},{2,4},{1,5}

Similar Problem - https://leetcode.com/problems/subarray-sum-equals-k/