Update concept exercises to pass the linter

.prettierrc

@@ -1,5 +1,6 @@
 {
   "semi": true,
   "singleQuote": true,
-  "endOfLine": "lf"
+  "endOfLine": "lf",
+  "arrowParens": "always"
 }

concepts/array-analysis/introduction.md

@@ -1,7 +1,5 @@
 # Introduction
 
-TODO: the content below is copied from the exercise introduction and probably needs rewriting to a proper concept introduction
-
 In JavaScript, an array is a list-like structure with no fixed length which can hold any type of primitives or objects, or even mixed types. The array elements can be accessed by their index. Arrays are also given a bunch of built-in methods. Some of these built-in methods can analyse the contents of the array. Many of the built-in functions that analyse the contents of an array, take a [`predicate`][predicate_in_programming] as argument.
 
 The built-in functions are meant to be used _instead of a `for` loop_ or the built-in `Array#forEach()`:

concepts/array-destructuring/introduction.md

@@ -1,7 +1,5 @@
 # Introduction
 
-TODO: the content below is copied from the exercise introduction and probably needs rewriting to a proper concept introduction
-
 Javascript's array destructuring syntax is a concise way to extract values from an array and assign them to distinct variables.
 
 In this example, each value in the `numberOfMoons` array is assigned to its corresponding planet:

concepts/arrays/introduction.md

@@ -1,7 +1,5 @@
 # Introduction
 
-TODO: the content below is copied from the exercise introduction and probably needs rewriting to a proper concept introduction
-
 In Javascript, an array is a list-like structure with no fixed length which can hold any type of primitives or ojects, even mixed types. The array elements can be accesed by their index.
 
 Example of an array declaration and accessing an element by index:

concepts/basics/introduction.md

@@ -1,7 +1,5 @@
 # Introduction
 
-TODO: the content below is copied from the exercise introduction and probably needs rewriting to a proper concept introduction
-
 JavaScript is a dynamic language, supporting object-oriented, imperative, and declarative (e.g. functional programming) styles.
 
 There are a few primary ways to assign values to names in JavaScript - using variables or constants. On Exercism, variables are always written in [camelCase][wiki-camel-case]; constants are written in [SCREAMING_SNAKE_CASE][wiki-snake-case].

concepts/booleans/introduction.md

@@ -1,5 +1,3 @@
 # Introduction
 
-TODO: the content below is copied from the exercise introduction and probably needs rewriting to a proper concept introduction
-
 A boolean represents one of two values: `true` or `false`. Logical operators (`!`, `&&`, `||`) are typically used with boolean values and they return a boolean value.

concepts/closures/introduction.md

@@ -1,7 +1,5 @@
 # Introduction
 
-TODO: the content below is copied from the exercise introduction and probably needs rewriting to a proper concept introduction
-
 **Closures** are a programming pattern in JavaScript which allows variables from an outer [lexical scope][wiki-lexical-scope] to be used inside of a nested block of code. JavaScript supports closures transparently, and they are often used without knowing what they are.
 
 ```javascript

concepts/numbers/introduction.md

@@ -1,7 +1,5 @@
 # Introduction
 
-TODO: the content below is copied from the exercise introduction and probably needs rewriting to a proper concept introduction
-
 There are two different types of numbers in JavaScript:
 
 - `number`: a numeric data type in the double-precision 64-bit floating point

concepts/promises/introduction.md

@@ -1,7 +1,5 @@
 # Introduction
 
-TODO: the content below is copied from the exercise introduction and probably needs rewriting to a proper concept introduction
-
 The `Promise` object represents the eventual completion (or failure) of an
 asynchronous operation, and its resulting value.
 

concepts/recursion/introduction.md

@@ -1,3 +1,3 @@
 # Introduction
 
-TODO: the content below is copied from the exercise introduction and probably needs rewriting to a proper concept introduction
+TODO: add introduction for recursion concept

concepts/rest-elements/introduction.md

@@ -1,15 +1,3 @@
 # Introduction
 
-TODO: the content below is copied from the exercise introduction and probably needs rewriting to a proper concept introduction
-
-Javascript's array destructuring syntax is a concise way to extract values from an array and assign them to distinct variables.
-
-In this example, each value in the `numberOfMoons` array is assigned to its corresponding planet:
-
-```javascript
-const numberOfMoons = [0, 2, 14];
-const [venus, mars, neptune] = numberOfMoons;
-
-neptune;
-// => 14
-```
+TODO: add introduction for rest-elements concept

concepts/spread-elements/introduction.md

@@ -0,0 +1,3 @@
+# Introduction
+
+TODO: add introduction for spread-elements concept

concepts/spread-operator/introduction.md

@@ -1,15 +1,3 @@
 # Introduction
 
-TODO: the content below is copied from the exercise introduction and probably needs rewriting to a proper concept introduction
-
-Javascript's array destructuring syntax is a concise way to extract values from an array and assign them to distinct variables.
-
-In this example, each value in the `numberOfMoons` array is assigned to its corresponding planet:
-
-```javascript
-const numberOfMoons = [0, 2, 14];
-const [venus, mars, neptune] = numberOfMoons;
-
-neptune;
-// => 14
-```
+TODO: add introduction for spread-operator concept

concepts/strings/introduction.md

@@ -1,7 +1,5 @@
 # Introduction
 
-TODO: the content below is copied from the exercise introduction and probably needs rewriting to a proper concept introduction
-
 Strings are useful for holding data that can be represented in text form.
 There are two ways to access an individual character in a string.
 

exercises/concept/array-loops/.meta/config.json

@@ -11,10 +11,10 @@
       "exercism_username": "SleeplessByte"
     }
   ],
-  "forked_from": [],
   "files": {
-    "solution": [],
-    "test": [],
+    "solution": ["array-loops.js"],
+    "test": ["array-loops.spec.js"],
     "exemplar": [".meta/exemplar.js"]
-  }
+  },
+  "forked_from": []
 }

exercises/concept/basics/.meta/config.json

@@ -5,10 +5,10 @@
       "exercism_username": "SleeplessByte"
     }
   ],
-  "forked_from": ["ruby/basics"],
   "files": {
     "solution": ["basics.js"],
     "test": ["basics.spec.js"],
-    "exemplar": []
-  }
+    "exemplar": [".meta/examplar.js"]
+  },
+  "forked_from": ["ruby/basics"]
 }

exercises/concept/booleans/.meta/config.json

@@ -1,4 +1,10 @@
 {
+  "authors": [
+    {
+      "github_username": "ovidiu141",
+      "exercism_username": "ovidiu141"
+    }
+  ],
   "contributors": [
     {
       "github_username": "rishiosaur",
@@ -9,15 +15,10 @@
       "exercism_username": "SleeplessByte"
     }
   ],
-  "authors": [
-    {
-      "github_username": "ovidiu141",
-      "exercism_username": "ovidiu141"
-    }
-  ],
   "files": {
     "solution": ["booleans.js"],
     "test": ["booleans.spec.js"],
-    "exemplar": []
-  }
+    "exemplar": [".meta/exemplar.js"]
+  },
+  "forked_from": []
 }

exercises/concept/closures/.meta/config.json

@@ -5,9 +5,16 @@
       "exercism_username": "neenjaw"
     }
   ],
+  "contributors": [
+    {
+      "github_username": "SleeplessByte",
+      "exercism_username": "SleeplessByte"
+    }
+  ],
   "files": {
     "solution": ["closures.js"],
     "test": ["closures.spec.js"],
-    "exemplar": []
-  }
+    "exemplar": [".meta/exemplar.js"]
+  },
+  "forked_from": []
 }

exercises/concept/elyses-analytic-enchantments/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "contributors": [],
   "authors": [
     {
       "github_username": "peterchu999",
@@ -10,9 +9,11 @@
       "exercism_username": "SleeplessByte"
     }
   ],
+  "contributors": [],
   "files": {
     "solution": ["enchantments.js"],
     "test": ["enchantments.spec.js"],
     "exemplar": [".meta/exemplar.js"]
-  }
+  },
+  "forked_from": []
 }

exercises/concept/elyses-destructured-enchantments/.meta/config.json

@@ -15,5 +15,6 @@
     "solution": ["enchantments.js"],
     "test": ["enchantments.spec.js"],
     "exemplar": [".meta/exemplar.js"]
-  }
+  },
+  "forked_from": []
 }

exercises/concept/elyses-enchantments/.meta/config.json

@@ -1,4 +1,10 @@
 {
+  "authors": [
+    {
+      "github_username": "ovidiu141",
+      "exercism_username": "ovidiu141"
+    }
+  ],
   "contributors": [
     {
       "github_username": "peterchu999",
@@ -9,16 +15,10 @@
       "exercism_username": "SleeplessByte"
     }
   ],
-  "authors": [
-    {
-      "github_username": "ovidiu141",
-      "exercism_username": "ovidiu141"
-    }
-  ],
-  "forked_from": ["go/basic-slices"],
   "files": {
     "solution": ["enchantments.js"],
     "test": ["enchantments.spec.js"],
     "exemplar": [".meta/exemplar.js"]
-  }
+  },
+  "forked_from": ["go/basic-slices"]
 }

exercises/concept/elyses-transformative-enchantments/.meta/config.json

@@ -1,14 +1,20 @@
 {
-  "contributors": [],
   "authors": [
     {
       "github_username": "yyyc514",
       "exercism_username": "ajoshguy"
     }
   ],
+  "contributors": [
+    {
+      "github_username": "SleeplessByte",
+      "exercism_username": "SleeplessByte"
+    }
+  ],
   "files": {
     "solution": ["enchantments.js"],
     "test": ["enchantments.spec.js"],
-    "exemplar": ["exemplar.js"]
-  }
+    "exemplar": [".meta/exemplar.js"]
+  },
+  "forked_from": []
 }

exercises/concept/fruit-picker/.meta/config.json

@@ -14,6 +14,6 @@
   "files": {
     "solution": ["fruit-picker.js"],
     "test": ["fruit-picker.spec.js"],
-    "exemplar": []
+    "exemplar": [".meta/exemplar.js"]
   }
 }

exercises/concept/fruit-picker/.meta/env.d.ts

@@ -0,0 +1,4 @@
+/// <reference path="../global.d.ts" />
+
+// This file purely exist so that exemplar.js may live in this folder, without
+// that causing syntax errors.

exercises/concept/fruit-picker/exemplar.js → exercises/concept/fruit-picker/.meta/exemplar.js

@@ -1,6 +1,6 @@
 // @ts-check
 
-import { checkStatus, checkInventory } from './grocer';
+import { checkStatus, checkInventory } from '../grocer';
 
 /**
  * Returns the service status as a boolean value

exercises/concept/fruit-picker/fruit-picker.js

@@ -1,4 +1,13 @@
+/// <reference path="./global.d.ts" />
+//
 // @ts-check
+//
+// The lines above enable type checking for this file. Various IDEs interpret
+// the @ts-check and reference directives. Together, they give you helpful
+// autocompletion when implementing this exercise. You don't need to understand
+// them in order to use it.
+//
+// In your own projects, files, and code, you can play with @ts-check as well.
 
 import { checkStatus, checkInventory } from './grocer';
 

exercises/concept/lucky-numbers/.docs/instructions.md

@@ -1,38 +1,35 @@
 # Instructions
 
-In this exercise you'll be writing code to understand the concepts of type conversion that you might encounter in your everyday code
-
-Given two arrays made up of digits, write a function that turns the digits into numbers and then sums the numbers.
-
 ## Tasks
 
 ## 1. Find the sum of two arrays
 
-Implement a function to calculate the sum of two array element given the array of two numbers:
+Given two arrays made up of digits, write a function that interprets the arrays as numbers and sums them:
 
 ```javascript
+// 123 becomes [1, 2, 3]
+//   7 becomes [0, 0, 7]
 twoSum([1, 2, 3], [0, 0, 7]);
 //=> 130
 ```
 
-The result should be a number and the array element only contains as integer
-
 ## 2. Determine if the number is lucky
 
-After the calculator the owner would like to know the sum that he got is a lucky number or not. A number is said to be lucky if it is a palindrome.
+In this exercise a number is said to be lucky if it is a palindrome.
 
 Implement a function to determine whether the number is lucky.
 
 ```javascript
 luckyNumber(1441);
 //=>  true
+
 luckyNumber(123);
 //=> false
 ```
 
 ## 3. Dashify a number
 
-Implement a function that interpolates a dash between each number, converting it to a string.
+Implement a function that takes a number and places a dash between each digit
 
 ```javascript
 dashify(1466);