function solution(A) {
    let max = 1;
    let flag = false;
    // false => down, true => up

    let currentCount = 1;
    for (let i = 0; i < A.length - 1; i++) {
        if (currentCount == 1) {
            currentCount++;
            if (A[i + 1] > A[i])
                flag = true;
            else if (A[i + 1] < A[i])
                flag = false;
        } else {
            if ((flag && A[i + 1] > A[i]) || (!flag && A[i + 1] < A[i]))
                currentCount++;
            else {
                // Go back one index, to reset the turb.
                i--;
                currentCount = 1;
            }
        }
        flag = !flag;
        if (currentCount > max)
            max = currentCount;
    }

    return max;
}