chore: improve formatting

Author: jfmartinz

7kyu-1/findTheCapitals.js

@@ -1,21 +1,19 @@
 // Instructions
-// Write a function that takes a single string (word) as argument. 
+// Write a function that takes a single string (word) as argument.
 // The function must return an ordered list containing the indexes of all capital letters in the string.
 
 // Example (Input --> Output)
 // "CodEWaRs" --> [0,3,4,6]
 
 var capitals = function (word) {
-  
-    let result = []
-    
-      for(let i = 0; i < word.length; i++){
-        let letters = word[i]
-        if(/[A-Z]/.test(letters)){
-          let indexes = word.indexOf(letters);
-          result.push(indexes)
-        }
-      }
-      return result
-      
-    };
+  let result = [];
+
+  for (let i = 0; i < word.length; i++) {
+    let letters = word[i];
+    if (/[A-Z]/.test(letters)) {
+      let indexes = word.indexOf(letters);
+      result.push(indexes);
+    }
+  }
+  return result;
+};

7kyu-1/findTheStrayNumber.js

@@ -1,7 +1,7 @@
-// You are given an odd-length array of integers, 
+// You are given an odd-length array of integers,
 // in which all of them are the same, except for one single number.
 
-// Complete the method which accepts such an array, 
+// Complete the method which accepts such an array,
 // and returns that single different number.
 
 // The input array will always be valid! (odd-length >= 3)
@@ -11,21 +11,19 @@
 // [17, 17, 3, 17, 17, 17, 17] ==> 3
 
 function stray(numbers) {
-    let numCounts = {}; 
-    
-  
-    for (let num of numbers) {
-      if (numCounts[num]) {
-        numCounts[num] += 1;
-      } else {
-        numCounts[num] = 1;
-      }
+  let numCounts = {};
+
+  for (let num of numbers) {
+    if (numCounts[num]) {
+      numCounts[num] += 1;
+    } else {
+      numCounts[num] = 1;
     }
-    
-  
-    for (let num in numCounts) {
-      if (numCounts[num] === 1) {
-        return parseInt(num); 
-      }
+  }
+
+  for (let num in numCounts) {
+    if (numCounts[num] === 1) {
+      return parseInt(num);
     }
-  }
+  }
+}

7kyu-1/friendOrFoe.js

@@ -1,7 +1,7 @@
 // Make a program that filters a list of
 //  strings and returns a list with only your friends name in it.
 
-// If a name has exactly 4 letters in it, you can be sure 
+// If a name has exactly 4 letters in it, you can be sure
 // that it has to be a friend of yours! Otherwise, you can be sure he's not...
 
 // Ex: Input = ["Ryan", "Kieran", "Jason", "Yous"], Output = ["Ryan", "Yous"]
@@ -11,8 +11,6 @@
 // friend ["Ryan", "Kieran", "Mark"] `shouldBe` ["Ryan", "Mark"]
 // Note: keep the original order of the names in the output.
 
-function friend(friends){
-
-    return friends.filter(x => x.length === 4);
-    
-    }
+function friend(friends) {
+  return friends.filter((x) => x.length === 4);
+}

7kyu-1/geTheMiddleCharacter.js

@@ -1,5 +1,5 @@
 // You are going to be given a word. Your job is to return the middle character of the word.
-//  If the word's length is odd, return the middle character. If the word's length is even, 
+//  If the word's length is odd, return the middle character. If the word's length is even,
 //  return the middle 2 characters.
 
 // #Examples:
@@ -21,20 +21,18 @@
 
 // The middle character(s) of the word represented as a string.
 
-function getMiddle(s){
-
-    str = s;
-    let position;
-    let length;
-  
-    if(str.length % 2 == 0) {
-      position = str.length / 2 - 1;
-      length = 2;
-    } else {
-      position = str.length / 2;
-      length = 1;
-    }
-  
-    return str.substring(position, position + length)
-  
-  }
+function getMiddle(s) {
+  str = s;
+  let position;
+  let length;
+
+  if (str.length % 2 == 0) {
+    position = str.length / 2 - 1;
+    length = 2;
+  } else {
+    position = str.length / 2;
+    length = 1;
+  }
+
+  return str.substring(position, position + length);
+}

7kyu-1/moneyMoneyMoney.js

@@ -1,20 +1,19 @@
-// Mr. Scrooge has a sum of money 'P' that he wants to invest. 
-// Before he does, he wants to know how many years 'Y' this sum 'P' 
+// Mr. Scrooge has a sum of money 'P' that he wants to invest.
+// Before he does, he wants to know how many years 'Y' this sum 'P'
 // has to be kept in the bank in order for it to amount to a desired sum of money 'D'.
 
-// The sum is kept for 'Y' years in the bank where interest 'I' is paid yearly. 
+// The sum is kept for 'Y' years in the bank where interest 'I' is paid yearly.
 // After paying taxes 'T' for the year the new sum is re-invested.
 
 // Note to Tax: not the invested principal is taxed, but only the year's accrued interest
 
 // Example:
 
-//   Let P be the Principal = 1000.00      
-//   Let I be the Interest Rate = 0.05      
-//   Let T be the Tax Rate = 0.18      
+//   Let P be the Principal = 1000.00
+//   Let I be the Interest Rate = 0.05
+//   Let T be the Tax Rate = 0.18
 //   Let D be the Desired Sum = 1100.00
 
-
 // After 1st Year -->
 //   P = 1041.00
 // After 2nd Year -->
@@ -23,23 +22,22 @@
 //   P = 1128.30
 // Thus Mr. Scrooge has to wait for 3 years for the initial principal to amount to the desired sum.
 
-// Your task is to complete the method provided and return the number of years 'Y' 
+// Your task is to complete the method provided and return the number of years 'Y'
 // as a whole in order for Mr. Scrooge to get the desired sum.
 
-// Assumption: Assume that Desired Principal 'D' is always greater than the initial principal. 
-// However it is best to take into consideration that if Desired Principal 'D' is equal to Principal 
+// Assumption: Assume that Desired Principal 'D' is always greater than the initial principal.
+// However it is best to take into consideration that if Desired Principal 'D' is equal to Principal
 // 'P' this should return 0 Years.
 
 function calculateYears(principal, interestRate, taxRate, desiredSum) {
-    let years = 0;
-    
-    while (principal < desiredSum) {
-      const interest = principal * interestRate;
-      const taxes = interest * taxRate;
-      principal += interest - taxes;
-      years++;
-    }
-    
-    return years;
+  let years = 0;
+
+  while (principal < desiredSum) {
+    const interest = principal * interestRate;
+    const taxes = interest * taxRate;
+    principal += interest - taxes;
+    years++;
   }
 
+  return years;
+}

7kyu-1/numberOfPeopleInTheBus.js

@@ -1,10 +1,10 @@
 // There is a bus moving in the city which takes and drops some people at each bus stop.
 
-// You are provided with a list (or array) of integer pairs. Elements of each pair represent the number 
+// You are provided with a list (or array) of integer pairs. Elements of each pair represent the number
 // of people that get on the bus (the first item) and the number of people that get off the bus (the second item) at a bus stop.
 
 // Your task is to return the number of people who are still on the bus after the last bus stop (after the last array).
-//  Even though it is the last bus stop, the bus might not be empty and some people might still be inside the bus, 
+//  Even though it is the last bus stop, the bus might not be empty and some people might still be inside the bus,
 //  they are probably sleeping there :D
 
 // Take a look on the test cases.
@@ -19,22 +19,21 @@
 // assert.strictEqual(number([[3,0],[9,1],[4,8],[12,2],[6,1],[7,8]]),21);
 // assert.strictEqual(number([[0,0]]),0);
 
-var number = function(busStops){
-    let totalPeople = 0;
-    for (let i=0; i<busStops.length; i++) {
-        totalPeople += busStops[i][0];
-      totalPeople -= busStops[i][1];
-    }
-    return totalPeople;
+var number = function (busStops) {
+  let totalPeople = 0;
+  for (let i = 0; i < busStops.length; i++) {
+    totalPeople += busStops[i][0];
+    totalPeople -= busStops[i][1];
   }
+  return totalPeople;
+};
 
+// var number = function(busStops){
+//   let peopleOnBus = 0;
 
-  // var number = function(busStops){
-  //   let peopleOnBus = 0;
-  
-  //   for (const [on, off] of busStops) {
-  //     peopleOnBus += on - off;
-  //   }
-  
-  //   return Math.max(peopleOnBus, 0);
-  // }
+//   for (const [on, off] of busStops) {
+//     peopleOnBus += on - off;
+//   }
+
+//   return Math.max(peopleOnBus, 0);
+// }

7kyu-1/printerErrors.js

@@ -1,14 +1,14 @@
-// In a factory a printer prints labels for boxes. For one kind of boxes the printer 
+// In a factory a printer prints labels for boxes. For one kind of boxes the printer
 // has to use colors which, for the sake of simplicity, are named with letters from a to m.
 
 // The colors used by the printer are recorded in a control string. For example a "good"
-//  control string would be aaabbbbhaijjjm meaning that the printer used three times color a, 
+//  control string would be aaabbbbhaijjjm meaning that the printer used three times color a,
 //  four times color b, one time color h then one time color a...
 
-// Sometimes there are problems: lack of colors, technical malfunction and a "bad" 
+// Sometimes there are problems: lack of colors, technical malfunction and a "bad"
 // control string is produced e.g. aaaxbbbbyyhwawiwjjjwwm with letters not from a to m.
 
-// You have to write a function printer_error which given a string will return the 
+// You have to write a function printer_error which given a string will return the
 // error rate of the printer as a string representing a rational whose numerator is the number of errors
 //  and the denominator the length of the control string. Don't reduce this fraction to a simpler expression.
 
@@ -22,14 +22,14 @@
 // printer_error(s) => "8/22"
 
 function printerError(s) {
-    const validRange = /[a-m]/; 
-    let errorCount = 0;
-  
-    for (let i = 0; i < s.length; i++) {
-      if (!validRange.test(s[i])) {
-        errorCount++;
-      }
+  const validRange = /[a-m]/;
+  let errorCount = 0;
+
+  for (let i = 0; i < s.length; i++) {
+    if (!validRange.test(s[i])) {
+      errorCount++;
     }
-  
-    return `${errorCount}/${s.length}`;
-  }
+  }
+
+  return `${errorCount}/${s.length}`;
+}

7kyu-1/shortestWord.js

@@ -3,18 +3,16 @@
 // String will never be empty and you do not need to account for different data types.
 
 function findShort(s) {
+  const words = s.split(" ");
 
-    const words = s.split(' ');
-  
-    let shortestLength = Infinity;
-  
-  
-    for (const word of words) {
-      const wordLength = word.length;
-      if (wordLength < shortestLength) {
-        shortestLength = wordLength;
-      }
+  let shortestLength = Infinity;
+
+  for (const word of words) {
+    const wordLength = word.length;
+    if (wordLength < shortestLength) {
+      shortestLength = wordLength;
     }
-  
+  }
+
   return shortestLength;
-  }
+}

7kyu-1/smallEnough.js

@@ -1,10 +1,8 @@
-// You will be given an array and a limit value. You must check that all values in 
+// You will be given an array and a limit value. You must check that all values in
 // the array are below or equal to the limit value. If they are, return true. Else, return false.
 
 // You can assume all values in the array are numbers.
 
-function smallEnough(a, limit){
-  
-    return a.every((num) => num <= limit)
-    
-}
+function smallEnough(a, limit) {
+  return a.every((num) => num <= limit);
+}

7kyu-1/sortArrayByStringLength.js

@@ -1,4 +1,4 @@
-// Write a function that takes an array of strings as an argument and returns 
+// Write a function that takes an array of strings as an argument and returns
 // a sorted array containing the same strings, ordered from shortest to longest.
 
 // For example, if this array were passed as an argument:
@@ -12,6 +12,6 @@
 // All of the strings in the array passed to your function will be different lengths,
 //  so you will not have to decide how to order multiple strings of the same length.
 
-function sortByLength (array) {
-    return array.sort((a, b) => a.length - b.length);
- };
+function sortByLength(array) {
+  return array.sort((a, b) => a.length - b.length);
+}