Complete binary agents algorithm

Author: ahcode0919

src/fcc-intermediate-algorithms/binary_agents.js

@@ -0,0 +1,5 @@
+export function binaryAgents(str) {
+  let binaryArray = str.split(" ");
+  let stringArray = binaryArray.map(val => String.fromCharCode(parseInt(val, 2)));
+  return stringArray.join("");
+}

src/fcc-intermediate-algorithms/fcc-intermediate-algorithms.md

@@ -19,6 +19,7 @@ From the Freecodecamp Javascript Certification Intermediate Algorithms module
 - [Sum All Primes](#sum-all-primes)
 - [Smallest Common Multiple](#smallest-common-multiple)
 - [Drop It](#drop-it)
+- [Binary Agents](#binary-agents)
 
 #### Sum All Numbers In a Range
 
@@ -365,3 +366,17 @@ export function steamrollArray(arr) {
   }, []);
 }
 ```
+
+#### Binary Agents
+
+Return an English translated sentence of the passed binary string.
+
+The binary string will be space separated.
+
+```javascript
+export function binaryAgents(str) {
+  let binaryArray = str.split(" ");
+  let stringArray = binaryArray.map(val => String.fromCharCode(parseInt(val, 2)));
+  return stringArray.join("");
+}
+```

tests/fcc-intermediate-algorithms/binary_agents.test.js

@@ -0,0 +1,6 @@
+import { binaryAgents } from "../../src/fcc-intermediate-algorithms/binary_agents";
+
+test('should convert binary to english', () => {
+  const binary = "01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111";
+  expect(binaryAgents(binary)).toBe("Aren't bonfires fun!?");
+});