This Gist solves the question: "Given a list of integers, determine how many of them are divisible by 11. If you encounter an integer in the list that is greater than or equal to 111, return 0 regardless of how many numbers are divisible by 11".

DivisibleAlgo.js

function countDivisibleBy11(list) {
    let count = 0;
    for (let i = 0; i < list.length; i++) {
        if (list[i] >= 111) {
            return 0;
        }
        if (list[i] % 11 === 0) {
            count++;
        }
    }
    return count;
}