augusto-altman

// Given a length and the constraints, ie, length 4, numbers 1, uppercase 2, lowercase 1.
// Find the kth password that matches these constraints from lexical ordering standpoint.
// So in the case of k=4; the first four passwords on this lexical ordering would be
// 1AAa->1AAb->1AAc->1AAd and that last password is your answer.
// Just to highlight the lexical ordering a little more;
// note the last password possible here would be zZZ9).

function charToDecimal(char) {
    const asciiRepresentation = char.charCodeAt(0);
    const firstSymbolSetSize = "9".charCodeAt(0) - "0".charCodeAt(0) + 1;

augusto-altman

//Problem link: https://codility.com/programmers/challenges/alpha2010/
//Max score: 100% - Total time: 1 hr 02 mins

// -----------------------------------------------------------------------------------
// -----------------------------------------------------------------------------------
// -----------------------------------------------------------------------------------
//First solution - Score: 84%
//Link: https://codility.com/demo/results/trainingS8K2BU-VRE/
//Time: 17 mins

augusto-altman

var romanMap = [
  {
    I: 'I',
    V: 'V',
    X: 'X'
  }, {
    I: 'X',
    V: 'L',
    X: 'C'
  }, {

augusto-altman

function magicEval(code){
    var script = document.createElement("script");
    script.src = URL.createObjectURL(new Blob([code], {type: 'text/javascript'}));
    script.type = "text/javascript";
    document.getElementsByTagName('head')[0].appendChild(script);
}

augusto-altman

if (!Function.prototype.bind) {
  Function.prototype.bind = function (oThis) {
    if (typeof this !== "function") {
      // closest thing possible to the ECMAScript 5
      // internal IsCallable function
      throw new TypeError("Function.prototype.bind - what is trying to be bound is not callable");
    }

    var aArgs = Array.prototype.slice.call(arguments, 1), 
        fToBind = this,