Question

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

Answer 1

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

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

    let currentStart: number = 0;
    let currentLen: number = 1;

    for (let i: number = 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: number[] = [
    3,3,3,
    7,7,7,7,7,
    2,2,
    5,5,5,5,
    9,9,9,9,9,9
];

const resultArr: number[] = shortest_identical_consecutive_subarray(arr);

let output: string = "Array result: ";
for (const x of resultArr) {
    output += x + " "; 
}
console.log(output); 
 
  
  
/*
run:
  
"Array result: 2 2 " 
  
*/

 

70+ SQL courses for beginners and professionals