Javascript Program to Count rotations divisible by 8

// Javascript program to count all
// rotations divisible by 8

// Function to count of all
// rotations divisible by 8
function countRotationsDivBy8(n) {
    let len = n.length;
    let count = 0;

    // For single digit number
    if (len == 1) {
        let oneDigit = n[0] - '0';

        if (oneDigit % 8 == 0)
            return 1;

        return 0;
    }

    // For two-digit numbers
    // (considering all pairs)
    if (len == 2) {

        // first pair
        let first = (n[0] - '0') * 10 +
            (n[1] - '0');

        // second pair
        let second = (n[1] - '0') * 10 +
            (n[0] - '0');

        if (first % 8 == 0)
            count++;
        if (second % 8 == 0)
            count++;

        return count;
    }

    // Considering all
    // three-digit sequences
    let threeDigit;
    for (let i = 0; i < (len - 2); i++) {
        threeDigit = (n[i] - '0') * 100 +
            (n[i + 1] - '0') * 10 +
            (n[i + 2] - '0');

        if (threeDigit % 8 == 0)
            count++;
    }

    // Considering the number
    // formed by the last digit
    // and the first two digits
    threeDigit = (n[len - 1] - '0') * 100 +
        (n[0] - '0') * 10 +
        (n[1] - '0');

    if (threeDigit % 8 == 0)
        count++;

    // Considering the number
    // formed by the last two
    // digits and the first digit
    threeDigit = (n[len - 2] - '0') * 100 +
        (n[len - 1] - '0') * 10 +
        (n[0] - '0');

    if (threeDigit % 8 == 0)
        count++;

    // Required count
    // of rotations
    return count;
}

// Driver Code
let n = "43262488612";

console.log("Rotations: " + countRotationsDivBy8(n));