junojo

const addBinary = (a, b) => (a + b).toString(2);

console.log(addBinary(1, 5))

const convertToBinary = (number) => {
  return number.toString(2);
}

junojo

function century(year) {
  let centuryCount = 0;
  while (year > 0){
    console.log(year);
    year = year - 100;
    centuryCount = centuryCount + 1;
  }
  return centuryCount;
}

junojo

function isTriangle(a,b,c)
{
  var arr = [a,b,c].sort(function(a, b) {
    return a - b;
  });
  return arr[0] + arr[1] > arr[2] ? true : false;
}

junojo

function list(names){
  let str = '';
  if (names.length !== 0) {
    let last = names.pop();
    str = names.map( (val, i, arr) => {
      if (i !== arr[arr.length - 1]) {
        return val.name;
      }
    }).join(', ')
     

junojo

function towerBuilder(nFloors) {

  let solution = [];
  for(let i=0; i < nFloors; i++){
	solution.push(" ".repeat((nFloors - i) - 1) + "*".repeat((i*2) + 1) + " ".repeat((nFloors - i) - 1));
  }
  return solution;
}

junojo

Write a method that takes an array of consecutive (increasing) letters as input and that returns the missing letter in the array.

You will always get an valid array. And it will be always exactly one letter be missing. The length of the array will always be at least 2. The array will always contain letters in only one case.

Example:

['a','b','c','d','f'] -> 'e'
['O','Q','R','S'] -> 'P'

junojo

Find the missing letter

Write a method that takes an array of consecutive (increasing) letters as input and that returns the missing letter in the array.

You will always get an valid array. And it will be always exactly one letter be missing. The length of the array will always be at least 2. The array will always contain letters in only one case.

Example:

junojo

Nathan loves cycling.

Because Nathan knows it is important to stay hydrated, he drinks 0.5 litres of water per hour of cycling.

You get given the time in hours and you need to return the number of litres Nathan will drink, rounded to the smallest value.

For example:

time = 3 ----> litres = 1

junojo

Number of people in the bus There is a bus moving in the city, and it takes and drop some people in each bus stop.

You are provided with a list (or array) of integer arrays (or tuples). Each integer array has two items which represent number of people get into bus (The first item) and number of people get off the bus (The second item) in a bus stop.

Your task is to return number of people who are still in the bus after the last bus station (after the last array). Even though it is the last bus stop, the bus is not empty and some people are still in the bus, and they are probably sleeping there :D

Take a look on the test cases.

Please keep in mind that the test cases ensure that the number of people in the bus is always >= 0. So the return integer can't be negative.

junojo

Given a string of words, you need to find the highest scoring word.

Each letter of a word scores points according to its position in the alphabet: a = 1, b = 2, c = 3 etc.

You need to return the highest scoring word as a string.

If two words score the same, return the word that appears earliest in the original string.

All letters will be lowercase and all inputs will be valid.