From 6643b612f34d8d8244099341f7bfa42d2504345f Mon Sep 17 00:00:00 2001
From: afterthebleep <afterthebleep@gmail.com>
Date: Tue, 21 Mar 2017 19:56:29 -0700
Subject: [PATCH 01/11] completed challenges 1-3

---
 README.md           |  2 +-
 src/fizzBuzz.js     | 15 +++++++++++++++
 src/isPalindrome.js | 12 ++++++++++++
 src/makeChange.js   | 17 ++++++++++++++++-
 4 files changed, 44 insertions(+), 2 deletions(-)
 create mode 100644 src/fizzBuzz.js
 create mode 100644 src/isPalindrome.js

diff --git a/README.md b/README.md
index 783e9c5..2daf9dc 100644
--- a/README.md
+++ b/README.md
@@ -1,4 +1,4 @@
-# Core Algorithms
+# Core Algorithms  #teamName premium-partridge  #Aisha Ortiz and Thomas Dunn
 
 Tests and implementations for algorithms commonly used in job interviews. See the full list in the [algorithms.md](algorithms.md) file.
 
diff --git a/src/fizzBuzz.js b/src/fizzBuzz.js
new file mode 100644
index 0000000..6476a08
--- /dev/null
+++ b/src/fizzBuzz.js
@@ -0,0 +1,15 @@
+let list = new Array(100);
+
+  for (let i = 0; i < 100; i++) {
+      list[i] = i + 1; // $$c populates the array. +1 is necessary because arrays are 0 index based and you want to store 1 - 100 in it, NOT 0-99.{
+
+        //list[i] is equal to an index in the array
+             if (list[i] % 5 === 0 && list[i] % 3 === 0) { // populate multiples of both five && three with "FIZZBUZZ"
+               list[i] = "FizzBuzz"
+             } else if (list[i] % 5 === 0) { // populate multiples of five with "BUZZ"
+                 list[i] = "Buzz"
+               } else if (list[i] % 3 === 0) {  // populate multiples of three with "FIZZ"
+                  list[i] = "Fizz"
+                 }
+  }
+console.log(list);
diff --git a/src/isPalindrome.js b/src/isPalindrome.js
new file mode 100644
index 0000000..68f8e93
--- /dev/null
+++ b/src/isPalindrome.js
@@ -0,0 +1,12 @@
+function isPalindrome(str) {
+  var regString = str.toLowerCase().replace(/[^0-9a-z]/gi, '').split('');
+
+  for (var i = 0; i < regString.length/2; i++) {
+    if (regString[i] !== regString[regString.length -1 -i]) {
+      return false;
+    }
+  }
+  return true;
+}
+
+console.log();
diff --git a/src/makeChange.js b/src/makeChange.js
index 59d89b1..ac76168 100644
--- a/src/makeChange.js
+++ b/src/makeChange.js
@@ -1,3 +1,18 @@
 export default function makeChange({price, amountGiven}) {
-  // your code here
+      // your code here
+let coins = {quarters: 25, dimes: 10, nickels: 5, pennies: 1 }
+let changeDue = amountGiven - price
+
+    for(let key in coins) {
+        let numberOfCoins = Math.floor(changeDue / coins[key])
+        /*takes the changeDue divides it by coin section of quarters (25) resulting in a
+        decimal of 1.64, then Math.floor round down to the nearest integer which is
+        1 (<= the given number) and assigns it to the variable numberOfCoins.
+          */
+        changeDue -= coins[keys] * numberOfCoins
+
+        coins[key] = numberOfCoins
+
+    }
+    return coins;
 }

From 3eb1bdfafa69ee33f14e887ecc047855d75e58eb Mon Sep 17 00:00:00 2001
From: aisha 'ai' ortiz <afterthebleep@gmail.com>
Date: Wed, 22 Mar 2017 09:40:14 -0700
Subject: [PATCH 02/11] Delete isPalindrome.js

---
 src/isPalindrome.js | 12 ------------
 1 file changed, 12 deletions(-)
 delete mode 100644 src/isPalindrome.js

diff --git a/src/isPalindrome.js b/src/isPalindrome.js
deleted file mode 100644
index 68f8e93..0000000
--- a/src/isPalindrome.js
+++ /dev/null
@@ -1,12 +0,0 @@
-function isPalindrome(str) {
-  var regString = str.toLowerCase().replace(/[^0-9a-z]/gi, '').split('');
-
-  for (var i = 0; i < regString.length/2; i++) {
-    if (regString[i] !== regString[regString.length -1 -i]) {
-      return false;
-    }
-  }
-  return true;
-}
-
-console.log();

From 358d6eb03c3e3112d4d400782a0d06756a2486a4 Mon Sep 17 00:00:00 2001
From: afterthebleep <afterthebleep@gmail.com>
Date: Thu, 23 Mar 2017 13:57:40 -0700
Subject: [PATCH 03/11] completed makeCHanges exercise. all test passing.

---
 src/makeChange.js | 17 ++++++++++++++++-
 1 file changed, 16 insertions(+), 1 deletion(-)

diff --git a/src/makeChange.js b/src/makeChange.js
index 59d89b1..ac76168 100644
--- a/src/makeChange.js
+++ b/src/makeChange.js
@@ -1,3 +1,18 @@
 export default function makeChange({price, amountGiven}) {
-  // your code here
+      // your code here
+let coins = {quarters: 25, dimes: 10, nickels: 5, pennies: 1 }
+let changeDue = amountGiven - price
+
+    for(let key in coins) {
+        let numberOfCoins = Math.floor(changeDue / coins[key])
+        /*takes the changeDue divides it by coin section of quarters (25) resulting in a
+        decimal of 1.64, then Math.floor round down to the nearest integer which is
+        1 (<= the given number) and assigns it to the variable numberOfCoins.
+          */
+        changeDue -= coins[keys] * numberOfCoins
+
+        coins[key] = numberOfCoins
+
+    }
+    return coins;
 }

From d47c1ea379167c8b4376c1241ff3799c8ce983fb Mon Sep 17 00:00:00 2001
From: afterthebleep <afterthebleep@gmail.com>
Date: Thu, 23 Mar 2017 14:10:24 -0700
Subject: [PATCH 04/11] completed fizzBuzz exercise. all test passing

---
 src/fizzBuzz.js | 14 ++++++++++++++
 1 file changed, 14 insertions(+)
 create mode 100644 src/fizzBuzz.js

diff --git a/src/fizzBuzz.js b/src/fizzBuzz.js
new file mode 100644
index 0000000..0e820cb
--- /dev/null
+++ b/src/fizzBuzz.js
@@ -0,0 +1,14 @@
+let list = new Array(100);
+
+  for (let i = 0; i < 100; i++) {
+      list[i] = i + 1; // $$c populates the array. +1 is necessary because arrays are 0 index based and you want to store 1 - 100 in it, NOT 0-99.{
+
+        //list[i] is equal to an index in the array
+             if (list[i] % 5 === 0 && list[i] % 3 === 0) { // populate multiples of both five && three with "FIZZBUZZ"
+               list[i] = "FizzBuzz"
+             } else if (list[i] % 5 === 0) { // populate multiples of five with "BUZZ"
+                 list[i] = "Buzz"
+               } else if (list[i] % 3 === 0) {  // populate multiples of three with "FIZZ"
+                  list[i] = "Fizz"
+                 }
+  }

From 967f3b647f8961b24bcfaaf2fa2fd2768b342ddf Mon Sep 17 00:00:00 2001
From: afterthebleep <afterthebleep@gmail.com>
Date: Thu, 23 Mar 2017 14:20:14 -0700
Subject: [PATCH 05/11] completed isPalindrome. all tests passing.

---
 src/isPalindrome.js | 23 +++++++++++++++++++++++
 1 file changed, 23 insertions(+)
 create mode 100644 src/isPalindrome.js

diff --git a/src/isPalindrome.js b/src/isPalindrome.js
new file mode 100644
index 0000000..9cd205e
--- /dev/null
+++ b/src/isPalindrome.js
@@ -0,0 +1,23 @@
+
+function isPalindrome(str) {
+
+  str = str.replace(/[^0-9a-z]/gi, "").toLowerCase();
+  let palindrome = str.split("").reverse().join("");
+    if (str === palindrome) {
+      return true;
+    } else {
+      return false;
+      }
+}
+
+/*console.log(
+
+  isPalindrome('radar')
+   => true
+
+  isPalindrome('bananas')
+   => false
+
+  isPalindrome('A man, a plan, a canal: Panama')
+   => true
+   isPalindrome("A man, a plan, a canal: Panama")); */

From e99480a1dffe10f25d683237b5399c74f9adadf3 Mon Sep 17 00:00:00 2001
From: tdunn1248 <rover@Thomass-MacBook-Pro.local>
Date: Thu, 23 Mar 2017 14:45:30 -0700
Subject: [PATCH 06/11] completed fibonacci sequence. all test passsed

---
 src/fibonacci.js | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 create mode 100644 src/fibonacci.js

diff --git a/src/fibonacci.js b/src/fibonacci.js
new file mode 100644
index 0000000..e69de29

From ad223fff9e039037353b6a05a0fda416bc891c2d Mon Sep 17 00:00:00 2001
From: tdunn1248 <rover@Thomass-MacBook-Pro.local>
Date: Thu, 23 Mar 2017 16:46:56 -0700
Subject: [PATCH 07/11] adds testing

---
 algorithmTest1Week3.html  | 10 ++++++++++
 core-algorithms           |  1 +
 src/fibonacci.js          | 15 +++++++++++++++
 src/isPalindrome.js       | 14 ++++++++++++++
 test/fizzBuzzTests.js     |  0
 test/isPalindrome_test.js | 20 ++++++++++++++++++++
 6 files changed, 60 insertions(+)
 create mode 100644 algorithmTest1Week3.html
 create mode 160000 core-algorithms
 create mode 100644 src/fibonacci.js
 create mode 100644 src/isPalindrome.js
 create mode 100644 test/fizzBuzzTests.js
 create mode 100644 test/isPalindrome_test.js

diff --git a/algorithmTest1Week3.html b/algorithmTest1Week3.html
new file mode 100644
index 0000000..2d1d662
--- /dev/null
+++ b/algorithmTest1Week3.html
@@ -0,0 +1,10 @@
+<!DOCTYPE html>
+<html>
+  <head>
+
+  </head>
+
+  <body>
+  <script src="src/makeChange.js"/>
+  </body>
+</html>
diff --git a/core-algorithms b/core-algorithms
new file mode 160000
index 0000000..2713bcd
--- /dev/null
+++ b/core-algorithms
@@ -0,0 +1 @@
+Subproject commit 2713bcd06f1c9789caed80e4bb3e7bd15237b493
diff --git a/src/fibonacci.js b/src/fibonacci.js
new file mode 100644
index 0000000..5b8cb39
--- /dev/null
+++ b/src/fibonacci.js
@@ -0,0 +1,15 @@
+
+
+function assembleFibonacci(nth) {
+  let a = 0, b = 1, f = 1;
+  let fibonacciArray = [a,b];
+      for (let i = 2; i < nth; i++) {
+        f = a + b;
+        a = b;
+        b = f;
+        fibonacciArray.push(f);
+       }
+   return fibonacciArray;
+}
+
+console.log(assembleFibonacci(10));
diff --git a/src/isPalindrome.js b/src/isPalindrome.js
new file mode 100644
index 0000000..ed2cad2
--- /dev/null
+++ b/src/isPalindrome.js
@@ -0,0 +1,14 @@
+export default function isPalindrome(givenWord) {
+  givenWord = givenWord.toLowerCase().replace(/[^0-9a-z]/gi, "");
+  let reverseWord = givenWord.split("").reverse().join("");
+  return givenWord === reverseWord;
+
+}
+console.log(isPalindrome("A man, a plan, a canal: Panama"));
+
+/* if (givenWord === reverseWord) {
+  return true
+} else  {
+  return false
+}
+*/
diff --git a/test/fizzBuzzTests.js b/test/fizzBuzzTests.js
new file mode 100644
index 0000000..e69de29
diff --git a/test/isPalindrome_test.js b/test/isPalindrome_test.js
new file mode 100644
index 0000000..051abe3
--- /dev/null
+++ b/test/isPalindrome_test.js
@@ -0,0 +1,20 @@
+import { expect } from 'chai'
+import isPalindrome from '../src/isPalindrome'
+
+describe.only('isPalindrome()', function(){
+
+  it('should be a function', function(){
+    expect(isPalindrome).to.be.a('function')
+  })
+
+  it('returns true if the input is a Palindrome', function(){
+    expect(isPalindrome('racecar')).to.equal(true)
+  })
+  it('returns true if the input is a Palindrome', function(){
+    expect(isPalindrome('trevor')).to.equal(false)
+  })
+  it('returns true if the input is a Palindrome', function(){
+    expect(isPalindrome('A man, a plan, a canal: Panama')).to.equal(true)
+  })
+
+})

From bc11c0c5326a4fa0098c8e03e50789e4a4a350f2 Mon Sep 17 00:00:00 2001
From: tdunn1248 <rover@Thomass-MacBook-Pro.local>
Date: Thu, 23 Mar 2017 16:56:24 -0700
Subject: [PATCH 08/11] readds factorial and test

---
 src/factorial.js          | 12 ++++++++++++
 src/makeChange.js         |  4 ++--
 test/factorial_test.js    | 16 ++++++++++++++++
 test/isPalindrome_test.js |  2 +-
 4 files changed, 31 insertions(+), 3 deletions(-)
 create mode 100644 src/factorial.js
 create mode 100644 test/factorial_test.js

diff --git a/src/factorial.js b/src/factorial.js
new file mode 100644
index 0000000..f56c52a
--- /dev/null
+++ b/src/factorial.js
@@ -0,0 +1,12 @@
+function factorialize(num) {
+  let inputValue = num;
+  let factorial = 1;
+    for (let x = num; x >= 1; x--) {
+      factorial *= x;
+    }
+  return factorial;
+}
+
+console.log(factorialize(5));
+
+factorialArray.reduce(function(a,b){return a*b})
diff --git a/src/makeChange.js b/src/makeChange.js
index ac76168..efacf24 100644
--- a/src/makeChange.js
+++ b/src/makeChange.js
@@ -1,7 +1,7 @@
 export default function makeChange({price, amountGiven}) {
       // your code here
 let coins = {quarters: 25, dimes: 10, nickels: 5, pennies: 1 }
-let changeDue = amountGiven - price
+let changeDue = amountGiven - price;
 
     for(let key in coins) {
         let numberOfCoins = Math.floor(changeDue / coins[key])
@@ -9,7 +9,7 @@ let changeDue = amountGiven - price
         decimal of 1.64, then Math.floor round down to the nearest integer which is
         1 (<= the given number) and assigns it to the variable numberOfCoins.
           */
-        changeDue -= coins[keys] * numberOfCoins
+        changeDue -= coins[key] * numberOfCoins
 
         coins[key] = numberOfCoins
 
diff --git a/test/factorial_test.js b/test/factorial_test.js
new file mode 100644
index 0000000..d52c963
--- /dev/null
+++ b/test/factorial_test.js
@@ -0,0 +1,16 @@
+import { expect } from 'chai'
+import factorialize from '../src/factorial'
+
+describe('factorial()', function(){
+
+  it('should be a function', function(){
+    expect(factorial).to.be.a('function')
+  })
+
+  it('returns the outout of the factorial)', function(){
+    expect(factorialize(5)).to.equal(120)g
+    expect(factorialize(12)).to.equal(479001600)
+    expect(factorialize(8)).to.equal(40320)
+
+  })
+})
diff --git a/test/isPalindrome_test.js b/test/isPalindrome_test.js
index 051abe3..a4f30c2 100644
--- a/test/isPalindrome_test.js
+++ b/test/isPalindrome_test.js
@@ -1,7 +1,7 @@
 import { expect } from 'chai'
 import isPalindrome from '../src/isPalindrome'
 
-describe.only('isPalindrome()', function(){
+describe('isPalindrome()', function(){
 
   it('should be a function', function(){
     expect(isPalindrome).to.be.a('function')

From fc61e13fbfe1435b7a4dc7ce472ec59420994a0b Mon Sep 17 00:00:00 2001
From: tdunn1248 <rover@Thomass-MacBook-Pro.local>
Date: Fri, 24 Mar 2017 12:35:34 -0700
Subject: [PATCH 09/11] Completed Collatz Conjecture

---
 algorithms.md            |  2 +-
 src/collatzConjecture.js | 23 +++++++++++++++++++++++
 src/factorial.js         | 12 ++++++++++++
 src/fibonacci.js         | 12 ++++++++++++
 test/factorial_test.js   | 16 ++++++++++++++++
 5 files changed, 64 insertions(+), 1 deletion(-)
 create mode 100644 src/collatzConjecture.js
 create mode 100644 src/factorial.js
 create mode 100644 test/factorial_test.js

diff --git a/algorithms.md b/algorithms.md
index 93d5faa..68d86c5 100644
--- a/algorithms.md
+++ b/algorithms.md
@@ -61,7 +61,7 @@ Return the factorial of a number.
 factorial(5)
 // => 120
 ```
-
+fac
 #### fibonacci
 
 Return an array of Fibonacci numbers to the _nth_ position.
diff --git a/src/collatzConjecture.js b/src/collatzConjecture.js
new file mode 100644
index 0000000..629590a
--- /dev/null
+++ b/src/collatzConjecture.js
@@ -0,0 +1,23 @@
+function assembleCollatz(num) {
+  let collatzArray = [num];
+
+  while ( collatzArray[collatzArray.length-1] !== 1) {
+    let lastNumber = collatzArray[collatzArray.length-1];
+
+    if (lastNumber % 2 === 0) {
+      collatzArray.push(lastNumber / 2)
+    } else {
+      collatzArray.push((3 * lastNumber) + 1)
+    }
+  }
+  return collatzArray;
+}
+console.log(assembleCollatz(7));
+
+//initalize function (num)
+// create empty arraySequence
+ // while (the last number of arraySequence is not 1)
+  //   if num is even
+  //    push num / 2 to the array
+  //    else if push 3num + 1 to arraySequence
+ // return sequence
diff --git a/src/factorial.js b/src/factorial.js
new file mode 100644
index 0000000..f56c52a
--- /dev/null
+++ b/src/factorial.js
@@ -0,0 +1,12 @@
+function factorialize(num) {
+  let inputValue = num;
+  let factorial = 1;
+    for (let x = num; x >= 1; x--) {
+      factorial *= x;
+    }
+  return factorial;
+}
+
+console.log(factorialize(5));
+
+factorialArray.reduce(function(a,b){return a*b})
diff --git a/src/fibonacci.js b/src/fibonacci.js
index e69de29..dd500eb 100644
--- a/src/fibonacci.js
+++ b/src/fibonacci.js
@@ -0,0 +1,12 @@
+function assembleFibonacci(nth) {
+  let a = 0, b = 1, f = 1;
+  let fibonacciArray = [a,b];
+      for (let i = 2; i < nth; i++) {
+        f = a + b;
+        a = b;
+        b = f;
+        fibonacciArray.push(f);
+       }
+   return fibonacciArray;
+}
+console.log(assembleFibonacci(10));
diff --git a/test/factorial_test.js b/test/factorial_test.js
new file mode 100644
index 0000000..d52c963
--- /dev/null
+++ b/test/factorial_test.js
@@ -0,0 +1,16 @@
+import { expect } from 'chai'
+import factorialize from '../src/factorial'
+
+describe('factorial()', function(){
+
+  it('should be a function', function(){
+    expect(factorial).to.be.a('function')
+  })
+
+  it('returns the outout of the factorial)', function(){
+    expect(factorialize(5)).to.equal(120)g
+    expect(factorialize(12)).to.equal(479001600)
+    expect(factorialize(8)).to.equal(40320)
+
+  })
+})

From 1b3347d31b7ceb39e32f3e2ec259ac717e6d1fda Mon Sep 17 00:00:00 2001
From: afterthebleep <afterthebleep@gmail.com>
Date: Fri, 24 Mar 2017 15:49:25 -0700
Subject: [PATCH 10/11] completed setUnion. all test pass. also updated all
 files with export and package json up-to-date

---
 package.json             | 6 ++++++
 src/collatzConjecture.js | 2 +-
 src/factorial.js         | 2 +-
 src/fibonacci.js         | 2 +-
 src/fizzBuzz.js          | 3 +--
 src/isPalindrome.js      | 4 ++--
 src/setUnion.js          | 8 ++++++++
 7 files changed, 20 insertions(+), 7 deletions(-)
 create mode 100644 src/setUnion.js

diff --git a/package.json b/package.json
index 71f93c5..35d1917 100644
--- a/package.json
+++ b/package.json
@@ -3,6 +3,12 @@
   "description": "Tests and implementations for algorithms commonly used in job interviews.",
   "private": false,
   "version": "0.0.0",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/aishao/core-algorithms"
+  },
+  "author": "Aisha , Thomas",
+  "license": "MIT",
   "devDependencies": {
     "babel-cli": "^6.18.0",
     "babel-preset-env": "^1.1.4",
diff --git a/src/collatzConjecture.js b/src/collatzConjecture.js
index 629590a..0365c43 100644
--- a/src/collatzConjecture.js
+++ b/src/collatzConjecture.js
@@ -1,4 +1,4 @@
-function assembleCollatz(num) {
+export default function assembleCollatz(num) {
   let collatzArray = [num];
 
   while ( collatzArray[collatzArray.length-1] !== 1) {
diff --git a/src/factorial.js b/src/factorial.js
index f56c52a..03c3cd0 100644
--- a/src/factorial.js
+++ b/src/factorial.js
@@ -1,4 +1,4 @@
-function factorialize(num) {
+export default function factorialize(num) {
   let inputValue = num;
   let factorial = 1;
     for (let x = num; x >= 1; x--) {
diff --git a/src/fibonacci.js b/src/fibonacci.js
index b8cc961..03935c0 100644
--- a/src/fibonacci.js
+++ b/src/fibonacci.js
@@ -1,5 +1,5 @@
 
-function assembleFibonacci(nth) {
+export default function assembleFibonacci(nth) {
   let a = 0, b = 1, f = 1;
   let fibonacciArray = [a,b];
       for (let i = 2; i < nth; i++) {
diff --git a/src/fizzBuzz.js b/src/fizzBuzz.js
index f8a7de4..cbdfa7b 100644
--- a/src/fizzBuzz.js
+++ b/src/fizzBuzz.js
@@ -1,4 +1,4 @@
-let list = new Array(100);
+export default let list = new Array(100);
 
   for (let i = 0; i < 100; i++) {
       list[i] = i + 1; // $$c populates the array. +1 is necessary because arrays are 0 index based and you want to store 1 - 100 in it, NOT 0-99.{
@@ -12,4 +12,3 @@ let list = new Array(100);
                   list[i] = "Fizz"
                  }
   }
-
diff --git a/src/isPalindrome.js b/src/isPalindrome.js
index e854e0d..328ed3c 100644
--- a/src/isPalindrome.js
+++ b/src/isPalindrome.js
@@ -1,5 +1,5 @@
 
-function isPalindrome(str) {
+export default function isPalindrome(str) {
 
   str = str.replace(/[^0-9a-z]/gi, "").toLowerCase();
   let palindrome = str.split("").reverse().join("");
@@ -20,4 +20,4 @@ function isPalindrome(str) {
 
   isPalindrome('A man, a plan, a canal: Panama')
    => true
-   isPalindrome("A man, a plan, a canal: Panama")); */
\ No newline at end of file
+   isPalindrome("A man, a plan, a canal: Panama")); */
diff --git a/src/setUnion.js b/src/setUnion.js
new file mode 100644
index 0000000..fb4218f
--- /dev/null
+++ b/src/setUnion.js
@@ -0,0 +1,8 @@
+function returnUnion() {
+
+  let myArray = [1, 2, 3, 4, 2, 4, 6, 8];
+
+  return [...new Set(myArray)]; // .. Es6 version of .unique method
+
+}
+console.log(returnUnion());

From 3c0a5f610c59222f4a9a70742d16aadf92200616 Mon Sep 17 00:00:00 2001
From: afterthebleep <afterthebleep@gmail.com>
Date: Fri, 24 Mar 2017 16:37:12 -0700
Subject: [PATCH 11/11] updated test for setUnion and made corrections to fail
 test exercises.

---
 src/factorial.js       |  4 ----
 src/setUnion.js        |  6 ++----
 test/factorial_test.js |  2 +-
 test/setUnion.js       | 18 ++++++++++++++++++
 4 files changed, 21 insertions(+), 9 deletions(-)
 create mode 100644 test/setUnion.js

diff --git a/src/factorial.js b/src/factorial.js
index 03c3cd0..e76df74 100644
--- a/src/factorial.js
+++ b/src/factorial.js
@@ -6,7 +6,3 @@ export default function factorialize(num) {
     }
   return factorial;
 }
-
-console.log(factorialize(5));
-
-factorialArray.reduce(function(a,b){return a*b})
diff --git a/src/setUnion.js b/src/setUnion.js
index fb4218f..3718376 100644
--- a/src/setUnion.js
+++ b/src/setUnion.js
@@ -1,8 +1,6 @@
-function returnUnion() {
-
-  let myArray = [1, 2, 3, 4, 2, 4, 6, 8];
+export default function setUnion(myArray) {
 
   return [...new Set(myArray)]; // .. Es6 version of .unique method
 
 }
-console.log(returnUnion());
+console.log(setUnion());
diff --git a/test/factorial_test.js b/test/factorial_test.js
index d52c963..69e0fa8 100644
--- a/test/factorial_test.js
+++ b/test/factorial_test.js
@@ -8,7 +8,7 @@ describe('factorial()', function(){
   })
 
   it('returns the outout of the factorial)', function(){
-    expect(factorialize(5)).to.equal(120)g
+    expect(factorialize(5)).to.equal(120)
     expect(factorialize(12)).to.equal(479001600)
     expect(factorialize(8)).to.equal(40320)
 
diff --git a/test/setUnion.js b/test/setUnion.js
new file mode 100644
index 0000000..cc0bc8d
--- /dev/null
+++ b/test/setUnion.js
@@ -0,0 +1,18 @@
+import { expect } from 'chai'
+import setUnion from '../src/setUnion'
+
+describe.only('setUnion()', function(){
+
+  it('should be a function', function(){
+    expect(setUnion).to.be.a('function')
+  })
+
+  it('returns an array', function(){
+    expect(setUnion([1, 2, 3])).to.deep.equal([1, 2, 3])
+  })
+
+  it ('seeks one of a kind in the array', function(){
+    expect(setUnion([1, 2, 3, 4, 2, 4, 6, 8,])).to.deep.equal([1, 2, 3, 4, 6, 8])
+  })
+  
+})