nirajkrz

// Bonfire: Symmetric Difference
// Author: @nirajkrz
// Challenge: http://www.freecodecamp.com/challenges/bonfire-symmetric-difference
// Learn to Code at Free Code Camp (www.freecodecamp.com)

function sym() {

  // Convert the argument object into a proper array
  var args = Array.prototype.slice.call(arguments);

nirajkrz

// Bonfire: Validate US Telephone Numbers
// Author: @nirajkrz
// Challenge: http://www.freecodecamp.com/challenges/bonfire-validate-us-telephone-numbers
// Learn to Code at Free Code Camp (www.freecodecamp.com)

function telephoneCheck(str) {
  // Good luck!
  var re = /^(?:(?:\+?1\s*(?:[.-]\s*)?)?(?:\(\s*([2-9]1[02-9]|[2-9][02-8]1|[2-9][02-8][02-9])\s*\)|([2-9]1[02-9]|[2-9][02-8]1|[2-9][02-8][02-9]))\s*(?:[.-]\s*)?)?([2-9]1[02-9]|[2-9][02-9]1|[2-9][02-9]{2})\s*(?:[.-]\s*)?([0-9]{4})$/;

  return re.test(str);

nirajkrz

// Bonfire: Arguments Optional
// Author: @nirajkrz
// Challenge: http://www.freecodecamp.com/challenges/bonfire-arguments-optional
// Learn to Code at Free Code Camp (www.freecodecamp.com)

function add() {
  
  
  // Function to check if a number is actually a number
  // and return undefined otherwise.

nirajkrz

// Bonfire: Binary Agents
// Author: @nirajkrz
// Challenge: http://www.freecodecamp.com/challenges/bonfire-binary-agents
// Learn to Code at Free Code Camp (www.freecodecamp.com)

//Return an English translated sentence of the passed binary string.



function binaryAgent(str) {

nirajkrz

// Bonfire: Steamroller
// Author: @nirajkrz
// Challenge: http://www.freecodecamp.com/challenges/bonfire-steamroller
// Learn to Code at Free Code Camp (www.freecodecamp.com)

//Flatten a nested array. You must account for varying levels of nesting.

function steamroller(arr) {
  // I'm a steamroller, baby
    var flattenedArray = [];

nirajkrz

// Bonfire: Drop it
// Author: @nirajkrz
// Challenge: http://www.freecodecamp.com/challenges/bonfire-drop-it
// Learn to Code at Free Code Camp (www.freecodecamp.com)

//Drop the elements of an array (first argument), starting from the front, until the predicate (second argument) returns true.

function drop(arr, func) {
  // Drop them elements.
  var lol = arr.length;

nirajkrz

// Bonfire: Finders Keepers
// Author: @nirajkrz
// Challenge: http://www.freecodecamp.com/challenges/bonfire-finders-keepers
// Learn to Code at Free Code Camp (www.freecodecamp.com)

//Create a function that looks through an array (first argument) and returns the first element in the array that passes a truth test (second argument).

function find(arr, func) {
  var num;

nirajkrz

// Bonfire: Smallest Common Multiple
// Author: @nirajkrz
// Challenge: http://www.freecodecamp.com/challenges/bonfire-smallest-common-multiple
// Learn to Code at Free Code Camp (www.freecodecamp.com)

function smallestCommons(arr) {
  arr.sort(function(a, b) {
    return b - a;
  });

nirajkrz

// Bonfire: Sum All Primes
// Author: @nirajkrz
// Challenge: http://www.freecodecamp.com/challenges/bonfire-sum-all-primes
// Learn to Code at Free Code Camp (www.freecodecamp.com)

//Sum all the prime numbers up to and including the provided number.
function sumPrimes(num) {
  var res = 0;

  // FUnction to get the primes up to max in an array

nirajkrz

// Bonfire: Sum All Odd Fibonacci Numbers
// Author: @nirajkrz
// Challenge: http://www.freecodecamp.com/challenges/bonfire-sum-all-odd-fibonacci-numbers
// Learn to Code at Free Code Camp (www.freecodecamp.com)

//Return the sum of all odd Fibonacci numbers up to and including the passed number if it is a Fibonacci number.
function sumFibs(num) {
  var prevNumber = 0;
    var currNumber = 1;
    var result = 0;