Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Letter Queue (Estructura de Cola) :) solution in Clear category for [old] Letter Queue by coria.luis
"use strict";
function letterQueue(commands){
var len = commands.length;
var queue = [];
var x, p = undefined;
var res = '';
for (var i = 0; i < len; i++) {
if (commands[i].substr(0,4) == 'PUSH') {
x = commands[i].substr(5,1);
queue.push(x);
//console.log(queue);
}
if (commands[i] == 'POP') {
p = queue.length;
if (p > 0) {
queue.shift();
}
}
}
p = queue.length;
for (var i = 0; i < p; i++) {
res = res + queue[i];
}
//console.log(res);
return res;
}
var assert = require('assert');
if (!global.is_checking) {
assert.equal(letterQueue(["PUSH A", "POP", "POP", "PUSH Z", "PUSH D", "PUSH O", "POP", "PUSH T"]), "DOT", "dot example");
assert.equal(letterQueue(["POP", "POP"]), "", "Pop, Pop, empty");
assert.equal(letterQueue(["PUSH H", "PUSH I"]), "HI", "Hi!");
assert.equal(letterQueue([]), "", "Nothing");
console.log("Coding complete? Click 'Check' to review your tests and earn cool rewards!");
}
Aug. 1, 2017