alysson-pina

/**
  * Calculate binary form of a given number n. 
  *
  * Recursive implementation to calculate binary number for a given number. 
  * Algorithm is O(log(N)) on both performance and memory consumption.
  *
  * @param  {number}   n   Number in base 10
  *
  * @return {string}   Binary representation of given number
  */

alysson-pina

/**
 * Exports function to flatten array of nested arrays into a single level array
 * @param {Array} array of arrays of integers (any depth)
 * @return {Array} array of integers (one level)
 */

const flatten = arr => arr.reduce( (acc, i) => `${acc + ' ' +  i}` ).replace(/,/g, ' ').split(' ').map( i => parseInt(i, 10) );

export default flatten;