Question

How to find the shortest identical consecutive subarray in an array with JavaScript

Answer 1

function shortest_identical_consecutive_subarray(arr) {
    if (arr.length === 0) return [];

    let bestStart = 0;
    let bestLen = arr.length;

    let currentStart = 0;
    let currentLen = 1;

    for (let i = 1; i < arr.length; i++) {
        if (arr[i] === arr[i - 1]) {
            currentLen++;
        } else {
            if (currentLen < bestLen) {
                bestLen = currentLen;
                bestStart = currentStart;
            }
            currentStart = i;
            currentLen = 1;
        }
    }

    if (currentLen < bestLen) {
        bestLen = currentLen;
        bestStart = currentStart;
    }

    return arr.slice(bestStart, bestStart + bestLen);
}


// ------------------------------------------------------------
// MAIN PROGRAM
// ------------------------------------------------------------

const arr = [
    3,3,3,
    7,7,7,7,7,
    2,2,
    5,5,5,5,
    9,9,9,9,9,9
];

const resultArr = shortest_identical_consecutive_subarray(arr);

process.stdout.write("Array result: ");
for (const x of resultArr) {
    process.stdout.write(x + " ");
}



/*
run:

Array result: 2 2 

*/

 

70+ SQL courses for beginners and professionals