Run prettier

Author: JakeSidSmith

README.md

@@ -4,10 +4,10 @@ A [code golf](https://en.wikipedia.org/wiki/Code_golf) game server for JavaScrip
 
 ## Running
 
-+ Clone the repo
-+ Install dependencies via `npm install`
-+ Set the `CG_ADMIN_PASSWORD` environment variable to secure access the the `/admin` page (see package.json `start` script)
-+ Start the server locally via `npm start`
+- Clone the repo
+- Install dependencies via `npm install`
+- Set the `CG_ADMIN_PASSWORD` environment variable to secure access the the `/admin` page (see package.json `start` script)
+- Start the server locally via `npm start`
 
 ## URLs
 
@@ -39,7 +39,7 @@ Players must write a script containing their solution. The solution must be a si
 
 ```js
 const play = (input) => {
-  return "your answer";
+  return 'your answer';
 };
 
 module.exports = play;

challenges/es5-3-narcissistic-number-generator/challenge.json

@@ -1,15 +1,6 @@
 {
   "title": "Narcissistic Number Generator",
-  "input": [
-    5,
-    400
-  ],
-  "output": [
-    407,
-    1634,
-    8208,
-    9474,
-    54748
-  ],
+  "input": [5, 400],
+  "output": [407, 1634, 8208, 9474, 54748],
   "description": "Generate the next X narcissistic numbers larger than the number Y, where your play function is called with the array [X, Y]. Return your answer in an array."
-}
+}

challenges/es5-4-never-gonna-give-you-up/challenge.json

@@ -3,4 +3,4 @@
   "input": null,
   "output": "We're no strangers to love\nYou know the rules and so do I\nA full commitment's what I'm thinking of\nYou wouldn't get this from any other guy\nI just wanna tell you how I'm feeling\nGotta make you understand\n\nNever gonna give you up\nNever gonna let you down\nNever gonna run around and desert you\nNever gonna make you cry\nNever gonna say goodbye\nNever gonna tell a lie and hurt you\n\nWe've known each other for so long\nYour heart's been aching but\nYou're too shy to say it\nInside we both know what's been going on\nWe know the game and we're gonna play it\nAnd if you ask me how I'm feeling\nDon't tell me you're too blind to see\n\nNever gonna give you up\nNever gonna let you down\nNever gonna run around and desert you\nNever gonna make you cry\nNever gonna say goodbye\nNever gonna tell a lie and hurt you\n\nNever gonna give you up\nNever gonna let you down\nNever gonna run around and desert you\nNever gonna make you cry\nNever gonna say goodbye\nNever gonna tell a lie and hurt you\n\n(Ooh, give you up)\n(Ooh, give you up)\n(Ooh)\nNever gonna give, never gonna give\n(Give you up)\n(Ooh)\nNever gonna give, never gonna give\n(Give you up)\n\nWe've know each other for so long\nYour heart's been aching but\nYou're too shy to say it\nInside we both know what's been going on\nWe know the game and we're gonna play it\n\nI just wanna tell you how I'm feeling\nGotta make you understand\n\nNever gonna give you up\nNever gonna let you down\nNever gonna run around and desert you\nNever gonna make you cry\nNever gonna say goodbye\nNever gonna tell a lie and hurt you\n\nNever gonna give you up\nNever gonna let you down\nNever gonna run around and desert you\nNever gonna make you cry\nNever gonna say goodbye\nNever gonna tell a lie and hurt you\n\nNever gonna give you up\nNever gonna let you down\nNever gonna run around and desert you\nNever gonna make you cry\nNever gonna say goodbye\nNever gonna tell a lie and hurt you",
   "description": "Write the shortest program that returns the entire lyrics of \"NeverGonnaGiveYouUp\" by Rick Astley. Your output must match exactly the format here: http://pastebin.com/raw.php?i=wwvdjvEj"
-}
+}

challenges/es5-5-caesar-cipher/challenge.json

@@ -3,4 +3,4 @@
   "input": "aabbbxXxyyzzzz",
   "output": "nnoookKkllmmmm",
   "description": "Implement a ROT13 cipher that preserves case. Only a-zA-Z characters need to be considered. Your play function will be called with a string, return a ROT13 version of the string."
-}
+}

challenges/es6-1-palindromes/challenge.json

@@ -1164,4 +1164,4 @@
   ],
   "output": 1074,
   "description": "Your play function will be called with an array containing words. You must return the total number of words contained within the array that are valid palindromes (https://en.wikipedia.org/wiki/Palindrome)."
-}
+}

challenges/es6-2-word-count/challenge.json

@@ -6,4 +6,4 @@
   ],
   "output": 540,
   "description": "Your play function will be called with an array [x,y], where x is a block of text to search, and y is the word to search for within x. Return the number of times the word y was found within the text x. The algorithm should be case insensitive."
-}
+}

challenges/es6-3-deduplication/challenge.json

@@ -1,44 +1,12 @@
 {
   "title": "ES6 Deduplication",
   "input": [
-    350,
-    10,
-    8807,
-    2584,
-    6454,
-    9911,
-    17711,
-    4754,
-    3835,
-    4481,
-    17711,
-    210,
-    25000,
-    1,
-    4481,
-    12,
-    6454,
-    4481,
-    4754,
-    1
+    350, 10, 8807, 2584, 6454, 9911, 17711, 4754, 3835, 4481, 17711, 210, 25000,
+    1, 4481, 12, 6454, 4481, 4754, 1
   ],
   "output": [
-    350,
-    10,
-    8807,
-    2584,
-    6454,
-    9911,
-    17711,
-    4754,
-    3835,
-    4481,
-    17711,
-    210,
-    25000,
-    1,
-    12,
-    1
+    350, 10, 8807, 2584, 6454, 9911, 17711, 4754, 3835, 4481, 17711, 210, 25000,
+    1, 12, 1
   ],
   "description": "Your play function will be called with an array of numbers. Return a new array with duplicates removed, maintaining the original order. Oh, but we like duplicates that are Fibonacci numbers, so don't remove them."
-}
+}

challenges/es6-4-ascii-art/challenge.json

@@ -3,4 +3,4 @@
   "input": null,
   "output": "................................................................\n................................................................\n................................................................\n................................................................\n................................................................\n................................................................\n................................................................\n................................................................\n........################################################........\n........#..............................................#........\n........#..............................................#........\n........#..............................................#........\n........#...################........################...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...#..............#........#..............#...#........\n........#...################........################...#........\n........#..............................................#........\n........#..............................................#........\n........#..............................................#........\n........#..............................................#........\n........#..............................................#........\n........#..............................................#........\n........#..............................................#........\n........#..............................................#........\n........#..............................................#........\n........#..............................................#........\n........#..............................................#........\n........#..............................................#........\n........#...########################################...#........\n........#...#......................................#...#........\n........#...#......................................#...#........\n........#...#......................................#...#........\n........#...#......................................#...#........\n........#...#......................................#...#........\n........#...#......................................#...#........\n........#...#......................................#...#........\n........#...#......................................#...#........\n........#...#......................................#...#........\n........#...#......................................#...#........\n........#...########################################...#........\n........#..............................................#........\n........#..............................................#........\n........#..............................................#........\n........################################################........\n................................................................\n................................................................\n................................................................\n................................................................\n................................................................\n................................................................\n................................................................\n................................................................",
   "description": "Your play function will be called with no input. Generate the following ASCII art and return it as a string, exactly as shown here: http://pastebin.com/raw.php?i=YsPK5Vdm"
-}
+}

jest.config.js

@@ -1,4 +1,4 @@
 module.exports = {
   preset: 'ts-jest',
   testEnvironment: 'node',
-};
+};

public/css/app.css

@@ -23,7 +23,8 @@ label span {
   color: #aaa;
 }
 
-input[type='text'], textarea {
+input[type='text'],
+textarea {
   color: #555;
   padding: 8px;
   border: solid 1px #ccc;
@@ -177,7 +178,7 @@ code {
 
 .bs-callout-danger {
   background-color: #fcf2f2;
-  border-color: #dFb5b4;
+  border-color: #dfb5b4;
 }
 
 .bs-callout-warning {
@@ -202,4 +203,4 @@ code {
 .challenge-example {
   font-family: Courier, monospace;
   font-size: inherit;
-}
+}

src/challenges/c0-hello-world/index.ts

@@ -1,9 +1,9 @@
-import type { Challenge } from "..";
-import solution from "./solution";
+import type { Challenge } from '..';
+import solution from './solution';
 
 const challenge: Challenge = {
-  input: "",
-  title: "Hello World",
+  input: '',
+  title: 'Hello World',
   output: solution(),
   description: `Write a function that returns "Hello, World!".`,
   example: `⟶ "Hello, World!"`,

src/challenges/c1-number-reader/index.ts

@@ -1,11 +1,11 @@
-import type { Challenge } from "..";
-import solution from "./solution";
+import type { Challenge } from '..';
+import solution from './solution';
 
 const input = 877209536;
 
 const challenge: Challenge = {
   input,
-  title: "Number Reader",
+  title: 'Number Reader',
   output: solution(input),
   description: `Write a function that takes a number and converts it to the equivalant string.`,
   example: `12341 ⟶ "one two three four one"`,

src/challenges/c10-array-flatten/index.ts

@@ -1,15 +1,15 @@
-import type { Challenge } from "..";
-import solution from "./solution";
+import type { Challenge } from '..';
+import solution from './solution';
 
 const input = [
   [1, 2, 3, 4, 5],
-  ["unu", "du", "tri", "kvar", "kvin"],
-  ["v", "w", "x", "y", "z"],
+  ['unu', 'du', 'tri', 'kvar', 'kvin'],
+  ['v', 'w', 'x', 'y', 'z'],
 ];
 
 const challenge: Challenge = {
   input,
-  title: "Array Flatten",
+  title: 'Array Flatten',
   output: solution(input),
   description: `Write a function that takes an array of three other arrays and returns a single, flattened array. The second array's values should remain in the middle, but the first and third should be swapped.`,
   example: `[[4, 5, 6], ["a", "b", "c"], [1, 2, 3]] ⟶ [1, 2, 3, "a", "b", "c", 4, 5, 6]`,

src/challenges/c11-word-count/index.ts

@@ -1,11 +1,12 @@
-import type { Challenge } from "..";
-import solution from "./solution";
+import type { Challenge } from '..';
+import solution from './solution';
 
-const input = "A purely       peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending. We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone .";
+const input =
+  "A purely       peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending. We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone .";
 
 const challenge: Challenge = {
   input,
-  title: "Word Count",
+  title: 'Word Count',
   output: solution(input),
   description: `Write a function that takes a string of text and returns the word count. A valid word is anything not made up of only of spaces or punctuation.`,
   example: `"You know what would make a great coffee table book? A coffee table book about coffee tables! Get it?" ⟶ 19, "Hello world ." ⟶ 2`,

src/challenges/c12-remainder/index.ts

@@ -1,11 +1,11 @@
-import type { Challenge } from "..";
-import solution from "./solution";
+import type { Challenge } from '..';
+import solution from './solution';
 
 const input = [7362, 392];
 
 const challenge: Challenge = {
   input,
-  title: "Remainder",
+  title: 'Remainder',
   output: solution(input),
   description: `Write a function that takes an array of two numbers – the first the dividend, the second the divisor – and returns the remainder.`,
   example: `[10, 2] ⟶ 0, [25, 4] ⟶ 1, [12, 7] ⟶ 5`,

src/challenges/c2-sort-the-numbers/index.ts

@@ -1,30 +1,16 @@
 import { Challenge } from '..';
 import solution from './solution';
 
-const input = [
-  10,
-  1,
-  150,
-  34,
-  300,
-  250,
-  12,
-  22,
-  23,
-  65,
-  33,
-  16,
-  1,
-  2,
-];
+const input = [10, 1, 150, 34, 300, 250, 12, 22, 23, 65, 33, 16, 1, 2];
 
 const challenge: Challenge = {
   input,
-  title: "Sort The Numbers",
+  title: 'Sort The Numbers',
   output: solution(input),
-  description: "Write a function that takes an array of numbers and returns a sorted array in ascending order.",
+  description:
+    'Write a function that takes an array of numbers and returns a sorted array in ascending order.',
   example: `[3, 5, 2, 4, 1] ⟶ [1, 2, 3, 4, 5]`,
-  rules: ["no-sort"],
+  rules: ['no-sort'],
 };
 
 export = challenge;

src/challenges/c3-number-to-words/index.ts

@@ -1,11 +1,11 @@
-import { Challenge } from "..";
-import solution from "./solution";
+import { Challenge } from '..';
+import solution from './solution';
 
 const input = 743243892;
 
 const challenge: Challenge = {
   input,
-  title: "Number To Words",
+  title: 'Number To Words',
   output: solution(input),
   description: `Write a function that takes a number and converts it to words.`,
   example: `2 ⟶ "two", 301 ⟶ "three hundred one", 12341 ⟶ "twelve thousand three hundred forty one", 1290489 ⟶ "one million two hundred ninety thousand four hundred eighty nine"`,

src/challenges/c4-roman-numerals/index.ts

@@ -1,11 +1,11 @@
-import { Challenge } from "..";
-import solution from "./solution";
+import { Challenge } from '..';
+import solution from './solution';
 
 const input = 2476;
 
 const challenge: Challenge = {
   input,
-  title: "Roman Numerals",
+  title: 'Roman Numerals',
   output: solution(input),
   description: `Write a function that converts numbers to roman numerals.`,
   example: `23 ⟶ "XXIII", 2743 ⟶ "MMDCCXLIII"`,

src/challenges/c5-add/index.ts

@@ -1,15 +1,16 @@
-import { Challenge } from "..";
-import solution from "./solution";
+import { Challenge } from '..';
+import solution from './solution';
 
 const input: [number, number] = [64722, 87549];
 
 const challenge: Challenge = {
   input,
-  title: "Add",
+  title: 'Add',
   output: solution(input),
-  description: "Write a function to add two numbers without using the plus operator. The function will be called with an array of two numbers and should return the sum.",
+  description:
+    'Write a function to add two numbers without using the plus operator. The function will be called with an array of two numbers and should return the sum.',
   example: `[3, 4] ⟶ 7, [100, 200] ⟶ 300`,
-  rules: ["no-add", "no-eval"],
+  rules: ['no-add', 'no-eval'],
 };
 
 export = challenge;