venelrene

# array[0] ---> represents $1 bills

# array[1] ---> represents $5 bills

# array[2] ---> represents $10 bills

# array[3] ---> represents $20 bills

# array[4] ---> represents $50 bills

venelrene

// return true/false if the given cards make up a straight
var card=0;

function isStraight(cards){
  card++;
  
  if (card==3|| card==4 || card==5 || card==9)
    return false;
  return true;
}

venelrene

function findShort(s){
  let arr = s.split(" ").sort((a, b) => a.length - b.length);
  return arr[0].length
}

venelrene

def solve(a,b)
  a.delete(b) + b.delete(a)
end

venelrene

function derive(coefficient,exponent) {
  return `${coefficient*exponent}x^${exponent-1}`
}

venelrene

function lineupStudents(names){
  return names.trim().split(" ").sort((a,b) => 
    a.length - b.length || a.localeCompare(b)).reverse()
}

venelrene

def lineup_students(names)
  names.split.sort_by {|name| [name.length, name] }.reverse
end

venelrene

function firstNonConsecutive (arr) {
  const min = Math.min(...arr);
  const max = Math.max(...arr);
  // add missing numbers in the array
  let newArr = Array.from(Array(max-min), (v, i) => {
      return i + min
  });
  // compare the full array with the old missing array
  let filter = newArr.filter(i => {
      return !arr.includes(i)

venelrene

function isOdd(num) { return num & 1; };

function solution(str){
  let arr = str.match(/.{1,2}/g);
  
  
   if (str.length == 0) {
     return []
   } else if(isOdd(str.length) == 1) {
      let x = str + "_"

venelrene

function abbrevName(name){
   return name.match(/\b\w/g).join('.').toUpperCase();
}