Merge pull request #5 from learn-co-curriculum/gracie-patch

fixes linter rules for week 1

Author: graciemcguire

.vscode/settings.json

@@ -0,0 +1,3 @@
+{
+  "cSpell.words": ["pseudocode", "Pseudocode"]
+}

00-welcome/01-algorithmic-problem-solving/README.md

@@ -104,7 +104,8 @@ Don’t optimize your code for time or space complexity (e.g. how long it takes
 run or how much memory it’s using) unless you absolutely need to. There are
 three major situations that call for optimization:
 
-- The solution is hanging on certain test cases, and therefore cannot pass since it’s taking too long
+- The solution is hanging on certain test cases, and therefore cannot pass since
+  it’s taking too long
 - You were asked to do so
 - You think it would be fun to try
 

01-week-1--starter-algorithms/00-day-1--reverse-a-string/README.md

@@ -1,8 +1,10 @@
 # Day 1: Reverse a String
 
-For this task, you'll need to reverse a string. Your method will receive one argument, a string, and be expected to output that string with its letters in reverse order.
+For this task, you'll need to reverse a string. Your method will receive one
+argument, a string, and be expected to output that string with its letters in
+reverse order.
 
-```
+```js
 Input: "hi"
 Output: "ih"
 
@@ -14,9 +16,10 @@ Output: "ybabtac"
 
 Please solve the problem using iteration.
 
-Use the language of your choosing. We've included starter files for some languages where you can pseudocode, explain your solution and code.
+Use the language of your choosing. We've included starter files for some
+languages where you can pseudocode, explain your solution and code.
 
-## Before you start coding:
+## Before you start coding
 
 1. Rewrite the problem in your own words
 2. Validate that you understand the problem

01-week-1--starter-algorithms/01-day-2--find-first-duplicate/README.md

@@ -1,16 +1,18 @@
 # Day 2: Find First Duplicate
 
-Given an Array, find the first duplicate value that occurs. If there are no duplicates, return -1.
+Given an Array, find the first duplicate value that occurs. If there are no
+duplicates, return -1.
 
-```
+```js
 Input: [2, 1, 3, 3, 2]
 Output: 3
 
 Input: [1, 2, 3, 4]
 Output: -1
 ```
 
-Use the language of your choosing. We've included starter files for some languages where you can pseudocode, explain your solution and code.
+Use the language of your choosing. We've included starter files for some
+languages where you can pseudocode, explain your solution and code.
 
 ## Before you start coding:
 

01-week-1--starter-algorithms/02-day-3--fibonacci-series/README.md

@@ -1,6 +1,9 @@
 # Day 3: Fibonacci Series
 
-Find the nth element in the Fibonacci series. The Fibonacci sequence starts with a 0 followed by a 1. After that, every value is the sum of the two values preceding it. Here are the first seven values as an example: 0, 1, 1, 2, 3, 5, 8.
+Find the nth element in the Fibonacci series. The Fibonacci sequence starts with
+a 0 followed by a 1. After that, every value is the sum of the two values
+preceding it. Here are the first seven values as an example: 0, 1, 1, 2, 3, 5,
+8.
 
 ```
 Input: 0
@@ -15,7 +18,8 @@ Output: 55
 
 Note that we are using zero-indexing for the series.
 
-Use the language of your choosing. We've included starter files for some languages where you can pseudocode, explain your solution and code.
+Use the language of your choosing. We've included starter files for some
+languages where you can pseudocode, explain your solution and code.
 
 ## Before you start coding:
 

01-week-1--starter-algorithms/03-day-4--selection-sort/README.md

@@ -1,15 +1,19 @@
 # Day 4: Selection Sort
 
-Sort an Array of numbers using selection sort. The selection sort algorithm sorts an array by repeatedly finding the minimum element (lowest value) in the input Array, and then putting it at the correct location in the sorted Array.
+Sort an Array of numbers using selection sort. The selection sort algorithm
+sorts an array by repeatedly finding the minimum element (lowest value) in the
+input Array, and then putting it at the correct location in the sorted Array.
 
-```
+```js
 Input: [3, -1, 5, 2]
 Output: [-1, 2, 3, 5]
 ```
 
-**Benchmarking**
+## Benchmarking
 
-For this task, we are also asking you to calculate the average runtime of your solution. In other words, you run it a bunch of times and then divide the total time it took for the solution to run by the number of times it ran.
+For this task, we are also asking you to calculate the average runtime of your
+solution. In other words, you run it a bunch of times and then divide the total
+time it took for the solution to run by the number of times it ran.
 
 Here is the pseudocode for creating your own basic benchmarking procedure:
 
@@ -25,7 +29,8 @@ average runtime = (current time - start time) / 2000
 
 We have provided you with the long input to use for benchmarking.
 
-Use the language of your choosing. We've included starter files for some languages where you can pseudocode, explain your solution and code.
+Use the language of your choosing. We've included starter files for some
+languages where you can pseudocode, explain your solution and code.
 
 ## Before you start coding:
 

01-week-1--starter-algorithms/04-day-5--find-shortest-string/README.md

@@ -1,8 +1,10 @@
 # Day 5: Find Shortest String
 
-Given an Array of strings, return the shortest string. If there is more than one string of that length, return the string that comes first in the list. The Array will have a minimum length of 1.
+Given an Array of strings, return the shortest string. If there is more than one
+string of that length, return the string that comes first in the list. The Array
+will have a minimum length of 1.
 
-```
+```js
 Input: ['aaa', 'a', 'bb', 'ccc']
 Output: 'a'
 
@@ -13,9 +15,11 @@ Input: ['flower', 'juniper', 'lily', 'dandelion']
 Output: 'lily'
 ```
 
-**Benchmarking**
+## Benchmarking
 
-For this task, we are also asking you to calculate the average runtime of your solution. In other words, you run it a bunch of times and then divide the total time it took for the solution to run by the number of times it ran.
+For this task, we are also asking you to calculate the average runtime of your
+solution. In other words, you run it a bunch of times and then divide the total
+time it took for the solution to run by the number of times it ran.
 
 Here is the pseudocode for creating your own basic benchmarking procedure:
 
@@ -29,9 +33,10 @@ loop 1000 times:
 average runtime = (current time - start time) / 2000
 ```
 
-Use the language of your choosing. We've included starter files for some languages where you can pseudocode, explain your solution and code.
+Use the language of your choosing. We've included starter files for some
+languages where you can pseudocode, explain your solution and code.
 
-## Before you start coding:
+## Before you start coding
 
 1. Rewrite the problem in your own words
 2. Validate that you understand the problem