adyngom-gist

function dec2bin(dec) {
  return (dec >>> 0).toString(2);
}

function solution (N) {
  var nope = 0;
  
  if(!N) return nope;
  
  var bin = dec2bin(N), clone = [], longest = 0, size;

adyngom-gist

function equilibrium(a) {
  var size = (!!a) ? a.length : 0;
  if (size <= 0) {
    return -1;
  }
  var set = [],
  sum = 0,
  lsum = 0,
  rsum = 0;
  

adyngom-gist

var Utils = {
  memo: {},
  fibonacci: function (n) {
    var that = this, val;
    if (n in that.memo) {
      return that.memo[n];
    }
    else {
      if(n === 0 || n === 1) {
        val = n;