HackerRank

warmup.js

// Solution for:
// Simple Array Sum
// A Very Big Sum
function main() {
    var n = parseInt(readLine());
    arr = readLine().split(' ');
    console.log(arr.map(Number).slice(0, n).reduce( (a, b) => a + b ));
}

// Staircase
function main() {
    var n = parseInt(readLine());

    for (var i = 0; i < n; i++) {
        var level = '';
        for (var y = n - 1; 0 <= y ; y--) {
            if (y > i) {
                level += ' ';
            } else {
                level += '#';
            }
        }
        console.log(level);
    }
}


// Pangrams
function processData(input) {
    input = input.toLowerCase().split('');
    
    var chars = new Array();
    
    input.forEach(function (char) {
        if (char != ' ' && chars.indexOf(char) == -1) {
            chars.push(char);
        }
    });
    
    if(chars.length == 26) {
        console.log('pangram');
    } else {
        console.log('not pangram');
    }
}