dragonza

function chunk(array, size) {
  if (!array) return [];
  const firstChunk = array.slice(0, size); // create the first chunk of the given array
  if (!firstChunk.length) {
    return array; // this is the base case to terminal the recursive
  }
  return [firstChunk].concat(chunk(array.slice(size, array.length), size)); 
}

/*

dragonza

function anagrams(stringA, stringB) {
  const aCharMap = charMap(stringA.replace(/[^\w]/g, '').toLowerCase());
  const bCharMap = charMap(stringB.replace(/[^\w]/g, '').toLowerCase());
  
  // return false immediately when the length of two char Map is not the same
  if (Object.keys(aCharMap).length !== Object.keys(bCharMap).length) {
    return false;
  }

   // comparison

dragonza

function anagrams(stringA, stringB) {
  return cleanString(stringA) === cleanString(stringB);
}

function cleanString(str) {
  return str.replace(/[^\w]/g, '').toLowerCase().split('').sort().join('');
}

dragonza

function capitalize(str) {
  const arr = str.split(' ');
  return arr.map(word => {
    return word[0].toUpperCase() + word.slice(1);
  }).join(' ');
}

dragonza

function capitalize(str) {
  let result = '';
  for (let word of str.split(' ')) {
    result += word[0].toUpperCase() + word.slice(1) + ' ';
  }
  return result.trim();
}

dragonza

function capitalize(str) {
  let result = str[0].toUpperCase();
  for (let i = 1; i < str.length; i++) {
    if (str[i - 1] === ' ') {
      result += str[i].toUpperCase();
    } else {
      result += str[i];
    }
  }