CareerCup

public static int GetNumberOfWays(int[] a, int k)
        {
            int ways = 0, wr = 0, wl = 0, zc = 0, best = 0;
            while (wr < a.Length)
            {
                if (zc <= k)
                {
                    if (a[wr] == 0)
                        zc++;
                    wr++;
                }
                if (zc > k)
                {
                    if (a[wl] == 0)
                        zc--;
                    wl++;
                }
                if (wr - wl == best && zc==k)
                    ways++;
                else if (wr - wl > best && zc==k)
                {
                    best = wr - wl;
                    ways = 1;
                }
                
            }
            return ways;

}

public static int NumberOfMaxOccurences(int[] input, int k) {
		
		int flippedZeroCount = 0;
		int maxLengthFound = 0;
		int maxCount = 0;
		int leftPos = 0;
		int rightPos = 0;
		
		if(input.length == 0){
			return 0;
		}
		if(input.length == 1){
			if(flippedZeroCount == 0){
				return input[0]==1?1:0;
			}
			if(flippedZeroCount == 1){
				return input[0]==1?0:1;
			}
		}
		
		while(rightPos<input.length){
			
			if(input[rightPos] == 0 ){
				flippedZeroCount++;
			}
			
			
			if(flippedZeroCount == k){
				while(rightPos<input.length-1 && input[rightPos+1] == 1){
					rightPos++;
				}
				if(rightPos-leftPos+1 > maxLengthFound){
					maxLengthFound = rightPos-leftPos + 1;
					maxCount = 1;
				}else if(rightPos-leftPos + 1 == maxLengthFound){
					maxCount++;
				}
			}
			
			if(input[leftPos++] == 0 ){
				flippedZeroCount--;
			}
			
			rightPos++;
		}
		return maxCount;
		
	}