Given a sequence of positive integers A and an integer T, return whether there is a continuous sequence of A that sums up to exactly T

ContiguousSequenceSum.java

/*   
Question: Given a sequence of positive integers A and an integer T, return whether there is a continuous sequence of A that sums up to exactly T 
*/



public class SequenceSum
{
  public static void main(String[] args)
  {
    int[] arr = {23, 5, 4, 7, 2, 11};
    
    boolean bool = findSum(arr, 9);
    
    System.out.print(bool);
  }
  
  public static boolean findSum (int[] A ,int T){
		int sum = 0 ;
		int j = 0;
		for (int i = 0 ; i < A.length ; ++i) {
			while (j < A.length &&  sum < T) {
				sum += A[j] ;
				j++;
			}			
			if (sum == T) {
				return true ;
			}
			sum -= A[i] ;
		}
						
		return false;
  }
}