style: lint ignore and .md files

challenges/camel-case/README.md

@@ -6,7 +6,7 @@ Created by [@Divlo](https://github.com/Divlo) on 5 July 2020.
 
 Write a simple camelCase function for strings. All words (except the first) must have their first letter capitalized without spaces.
 
-**Note :** camelCase is the practice of writing phrases such that each word or abbreviation in the middle of the phrase begins with a capital letter, with no intervening spaces or punctuation. 
+**Note :** camelCase is the practice of writing phrases such that each word or abbreviation in the middle of the phrase begins with a capital letter, with no intervening spaces or punctuation.
 
 ## Examples :
 

challenges/fibonacci-suite/README.md

@@ -4,7 +4,7 @@ Created by [@Divlo](https://github.com/Divlo) on 5 July 2020.
 
 ## Instructions :
 
-The function should return an array of fibonacci numbers. The function takes a `number` as an argument to decide how many number of elements to produce. 
+The function should return an array of fibonacci numbers. The function takes a `number` as an argument to decide how many number of elements to produce.
 
 **Note :** The Fibonacci Sequence is the series of numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... Each subsequent number is the sum of the previous two.
 

challenges/pairwise/README.md

@@ -10,9 +10,9 @@ You may use multiple pairs that have the same numeric elements but different ind
 
 For example `pairwise([7, 9, 11, 13, 15], 20)` returns `6`. The pairs that sum to 20 are `[7, 13]` and `[9, 11]`. We can then write out the array with their indices and values.
 
-| Index | 0 | 1 | 2  | 3  | 4  |
-|-------|---|---|----|----|----|
-| Value | 7 | 9 | 11 | 13 | 15 |
+| Index | 0   | 1   | 2   | 3   | 4   |
+| ----- | --- | --- | --- | --- | --- |
+| Value | 7   | 9   | 11  | 13  | 15  |
 
 Below we'll take their corresponding indices and add them.
 

challenges/reverse-polish-notation/README.md

@@ -6,13 +6,13 @@ Created by [@Divlo](https://github.com/Divlo) on 29 September 2020.
 
 Your job is to create a calculator which evaluates expressions in Reverse Polish notation (a mathematical notation in which operators follow their operands. It does not need any parentheses as long as each operator has a fixed number of operands).
 
-For example expression 5 1 2 + 4 * + 3 - (which is equivalent to 5 + ((1 + 2) * 4) - 3 in normal notation) should evaluate to 14.
+For example expression 5 1 2 + 4 _ + 3 - (which is equivalent to 5 + ((1 + 2) _ 4) - 3 in normal notation) should evaluate to 14.
 
 For your convenience, the input is formatted such that a space is provided between every token.
 
 Empty expression should evaluate to 0.
 
-Valid operations are +, -, *, /.
+Valid operations are +, -, \*, /.
 
 You may assume that there won't be exceptional situations (like stack underflow or division by zero).