Question: Find the n-upcount foa a given array.

NUpCountProblem.java

package com.hawa;

import lombok.extern.slf4j.Slf4j;

@Slf4j
/**
 * Define the n-upcount of an array to be the number of times the partial sum goes from less
 * than or equal to 'n' to greater than 'n' during the calculation of the sum of the elements of the array.
 */
public class NUpCountProblem {

    public static void main(String[] args) {
        int[] num = {2, 3, 1, -6, 8, -3, -1, 2};
        int nUpCount = printNUpCount(num, 5);
        log.info("The expected NUpCount is, {} ",nUpCount);
    }

    public static int printNUpCount(int[] a, int n){
        int partialSum = 0;
        int nUpCount = 0;
        for(int i=0; i<a.length; i++){
            partialSum = partialSum + a[i];
            if(partialSum > n){
                nUpCount = nUpCount + 1;
            }
        }
        log.info("nUpCount :: {}", nUpCount);
        return nUpCount;
    }
}