Given a array and a number k, find all contigious array sequences that are divisible by k

KSubsequences.java

/*
*
* Given a array and a number k, find all contigious array sequences that are divisible by k
*
*
*
*/


public class KSubsequences {

    public static int ksub(int array[], int k) {
        int startWindow = 0;
        int sum = 0;
        int result = 0;
        int l = array.length;
        while(l != 0) {
            for(int i = startWindow; i < array.length; i++) {
                sum += array[i];
                if (sum % k == 0) {
                    result++;
                } 
            }
            sum = 0;
            startWindow++;
            l--;
        }
        return result;
    }

    public static void main(String args[]) {
        System.out.println("Beginning of the program");
        System.out.println(ksub(new int[]{5, 10, 11, 9, 5}, 5));
        System.out.println(ksub(new int[]{1, 2, 3, 4, 1}, 3));
    }
}