Remove create react app

.github/ISSUE_TEMPLATE/config.yml

@@ -1 +1 @@
-blank_issues_enabled: false
+blank_issues_enabled: false

code-challenges/README.md

@@ -1,4 +1,4 @@
-Participants will be provided a prompted code-challenge. Work on it for 20 minutes! Your code challenge block will be used to go over any questions you may have.  Every week you will [screen record](https://docs.google.com/document/d/1LWUXCqAlOBhyhp5Mg5bkB-78O64tPztU5miDOMQ_unM/edit?usp=sharing) a single code-challenge in addition to your [Yoodli](https://yoodli.ai/) core skills review. That’s two recordings each week! You will receive feedback at the beginning of the following week.
+Participants will be provided a prompted code-challenge. Work on it for 20 minutes! Your code challenge block will be used to go over any questions you may have. Every week you will [screen record](https://docs.google.com/document/d/1LWUXCqAlOBhyhp5Mg5bkB-78O64tPztU5miDOMQ_unM/edit?usp=sharing) a single code-challenge in addition to your [Yoodli](https://yoodli.ai/) core skills review. That’s two recordings each week! You will receive feedback at the beginning of the following week.
 
 🎗️ **Reminder:** any stated challenges in your code problems should be after-thoughts - you can begin to apply the challenge once you’ve already solved the main challenge objective(s).
 
@@ -7,20 +7,25 @@ Participants will be provided a prompted code-challenge. Work on it for 20 minut
 Lastly, for your core skills mock interviews, challenge yourself to not have scripted answers! Do NOT write your answers down and read them off. You can definitely go through the exercise of practicing answering questions, but then put those written answers away while you are interviewing. In most real world interviews, you won't always have the chance to write your answers out in advance of an interview. Challenge yourself to answer these questions in the moment so that you can really practice what it's like to organically collect your thoughts and think on the spot! That said, you can have your two employer questions written down. In fact, it is good practice to have a list of questions to ask the interviewer; you are thinking through which questions to ask, to develop your list!
 
 ### 💡 Mondays will be used to review feedback
-Mondays will be used to review the feedback of your recorded session from the previous week. Consider and rework your answers to incorporate any actionable changes. 
+
+Mondays will be used to review the feedback of your recorded session from the previous week. Consider and rework your answers to incorporate any actionable changes.
 
 ### 🧠 How to Solve Code Challenges
+
 Review the [lesson](https://github.com/Techtonica/curriculum/blob/main/solving-coding-challenges/solving-coding-challenges.md) on how to address problem-solving technical questions. Practice in your own time with this code challenge.
 
 ### 🎦 Recorded Interviews (Weeks 1 - 8)
+
 Each Wednesday you will record your code challenge and core skills interviews, and add it into your “Growth Feedback” sheet. That’s two recordings each week! You will receive feedback at the beginning of the following week.
 
 If you are using resources while on your recorded interview, be sure you are sharing your screen with the interviewer and including them in on your research - this is another part of including them in on your thought process.
 
 ### 💬 Mock Interviews & Optional Recorded Interviews (Weeks 9 - 18)
+
 In the coming weeks, you will focus on using less resources to problem solve, you won't always be able to use google or external resources when interviewing. If it is unclear to you at the time of interviewing, that is something that you should explicitly ask. A major part of these technical interviews, beyond knowing how to code and having methods memorized, is showing that you can communicate - so walk through your thought processes and share them with the interviewer.
 
 ## Resources:
+
 - 🌐 [Edabit](https://edabit.com/challenges)
 - 🌐 [codewars](https://www.codewars.com/)
 - 🤓 [Solving Code Challenges](https://github.com/Techtonica/curriculum/blob/main/solving-coding-challenges/solving-coding-challenges.md)

code-challenges/Week_10/Boolean-to-String-Conversion.js

@@ -5,4 +5,4 @@ Example:				Example:
 Input: boolean false		Input: boolean true
 Output: "false"			Output: “true”
 
-*/
+*/

code-challenges/Week_10/Climbing-Stairs.js

@@ -16,4 +16,4 @@ Explanation: There are 3 ways to the top.
 1. 1 step + 1 step + 1 step
 2. 1 step + 2 steps
 3. 2 steps + 1 step
-*/
+*/

code-challenges/Week_10/Largest-Swap.js

@@ -14,4 +14,4 @@ Example 2:
 Input : 432
 Output : 432
 Explanation:Here, no swap is required. The given number is already the largest.
-*/
+*/

code-challenges/Week_10/Nested-Array.js

@@ -12,4 +12,4 @@ canNest([9, 9, 8], [8, 9]) ➞ false
 
 canNest([1, 2, 3, 4], [2, 3]) ➞ false
 
-*/
+*/

code-challenges/Week_11/Find-the-Missing-Number.js

@@ -7,4 +7,4 @@ missingNum([1, 2, 3, 4, 6, 7, 8, 9, 10]) ➞ 5
 missingNum([7, 2, 3, 6, 5, 9, 1, 4, 8]) ➞ 10
 missingNum([10, 5, 1, 2, 4, 6, 8, 3, 9]) ➞ 7
 
-*/
+*/

code-challenges/Week_11/How-Many-Vowels.js

@@ -1,7 +1,7 @@
 // Given a string, count the total number of vowels (a, e, i, o, u) in it.
 
 // Example 1: 					Example 2:
-// Input: ”abc de”			    Input: ”geeksforgeeks portal”	
+// Input: ”abc de”			    Input: ”geeksforgeeks portal”
 // Output: 2					Output: 7
 
 // Challenge: Think about how you can you solve this recursively after solving the problem.
@@ -22,39 +22,39 @@ RECURSIVELY
 
 */
 
-function countVowels(str){
-    // check if the input is a string is a 
-    if (typeof str !== 'string'){
-        return "Input must be a string";
+function countVowels(str) {
+  // check if the input is a string is a
+  if (typeof str !== "string") {
+    return "Input must be a string";
+  }
+  // - define a set of vowels that we should count, lower/uppercase
+  const vowels = "aeiouAEIOU";
+  // init counter
+  let count = 0;
+  // - iterate through each character in the string provided
+  for (let char of str) {
+    // - check if each character is in fact a vowel based on vowels given
+    if (vowels.includes(char)) {
+      // - increment counter for each vowel found
+      count++;
     }
-    // - define a set of vowels that we should count, lower/uppercase
-    const vowels ='aeiouAEIOU';
-    // init counter
-    let count = 0;
-    // - iterate through each character in the string provided
-    for (let char of str){
-        // - check if each character is in fact a vowel based on vowels given
-        if (vowels.includes(char)){
-            // - increment counter for each vowel found
-            count++;
-        }
-    }
-    // - return total count
-    return count;
+  }
+  // - return total count
+  return count;
 }
 
 // console.log(countVowels('abc de')); //  2
 // console.log(countVowels('geeksforgeeks portal')); // 7
 
-function countVowelsRecursive(str){
-// - base case: empty string length
-    if(str.length === 0) return 0;
-// - check if the first character is a vowel
-    const vowels ='aeiouAEIOU';
-    const isVowel = vowels.includes(str[0]);
-// - recursively call the rest of the string
-    return (isVowel ? 1 : 0) + countVowelsRecursive(str.slice(1));
+function countVowelsRecursive(str) {
+  // - base case: empty string length
+  if (str.length === 0) return 0;
+  // - check if the first character is a vowel
+  const vowels = "aeiouAEIOU";
+  const isVowel = vowels.includes(str[0]);
+  // - recursively call the rest of the string
+  return (isVowel ? 1 : 0) + countVowelsRecursive(str.slice(1));
 }
 
-console.log(countVowelsRecursive('abc de')); //  2
-console.log(countVowelsRecursive('geeksforgeeks portal')); // 7
+console.log(countVowelsRecursive("abc de")); //  2
+console.log(countVowelsRecursive("geeksforgeeks portal")); // 7

code-challenges/Week_11/Remove-Vowel-from-a-String.js

@@ -1,13 +1,12 @@
 // Given an array arr[] of size N-1 with integers in the range of [1, N], the task is to find the missing number from the first N integers. There are no duplicates in the list.
 
-// Example 1:							
-// Input: arr[] =						 
-// {1, 2, 4, 6, 3, 7, 8}, N = 8			
-// Output: 5							
-// Explanation: The missing number between 1 to 8 is 5	
+// Example 1:
+// Input: arr[] =
+// {1, 2, 4, 6, 3, 7, 8}, N = 8
+// Output: 5
+// Explanation: The missing number between 1 to 8 is 5
 
-// Example 2: 
+// Example 2:
 // Input: arr[] = {1, 2, 3, 5}, N = 5
 // Output: 4
 // Explanation: The missing number between 1 to 5 is 4
-

code-challenges/Week_12/Find-the-Time.js

@@ -10,4 +10,4 @@ Output: 12:00
 Example 2
 Input: Their daughter was born at 03:00am at 55 Melbourne Dr
 Output: 03:00
-*/
+*/

code-challenges/Week_12/Trick-or-Treat.js

@@ -6,4 +6,4 @@ timeForTrickOrTreat(new Date(2013, 9, 31)) ➞ true
 timeForTrickorTreat(new Date(2013, 0, 23)) ➞ false
 timeForTrickorTreat(new Date(3000, 9, 31)) ➞ true
 
-*/
+*/

code-challenges/Week_12/Valid-Palindrome.js

@@ -17,4 +17,4 @@ Output: true
 Explanation: s is an empty string "" after removing non-alphanumeric characters.
 Since an empty string reads the same forward and backward, it is a palindrome.
 
-*/
+*/

code-challenges/Week_13/Find-Lucky-Integer-in-Array.js

@@ -16,4 +16,4 @@ Example 3:
 Input: arr = [2,2,2,3,3]
 Output: -1
 Explanation: There are no lucky numbers in the array.
-*/
+*/

code-challenges/Week_13/Longest-Palindrome-Substring.js

@@ -9,4 +9,4 @@ Explanation: "aba" is also a valid answer.
 Example 2:
 Input: s = "cbbd"
 Output: "bb"
-*/
+*/

code-challenges/Week_13/Palindrome-Regex.js

@@ -9,4 +9,4 @@ Output: False
 Example 2: 
 Input: “0_0 (: /-\ :) 0–0”
 Output: true
-*/
+*/

code-challenges/Week_13/Sort-by-String-Length.js

@@ -7,4 +7,4 @@ sortByLength(["apple", "pie", "shortcake"]) ➞ ["pie", "apple", "shortcake"]
 sortByLength(["may", "april", "september", "august"]) ➞ ["may", "april", "august", "september"]
 sortByLength([]) ➞ []
 
-*/
+*/

code-challenges/Week_14/Converting-Objects-to-Arrays.js

@@ -12,4 +12,4 @@ Input: let myObj = {
 };
 Output: ["name", "address", "age"]
 
-*/
+*/

code-challenges/Week_14/String-Cleaning.js

@@ -5,4 +5,4 @@ Example 1			  Example 2			    Example 3
 Input: '! !'          Input:'123456789'	    Input: 'This looks5 grea8t!'
 Output: '! !'		  Output: ''			Output: 'This looks great!'	
 
-*/
+*/

code-challenges/Week_14/Switching-Between-Pencils.js

@@ -14,4 +14,4 @@ colorPatternTimes(["Red", "Yellow", "Green", "Blue"]) ➞ 11
 
 colorPatternTimes(["Blue", "Blue", "Blue", "Red", "Red", "Red"]) ➞ 13 
 
-*/
+*/

code-challenges/Week_15/Check-Same-Case.js

@@ -7,4 +7,4 @@ Examples
 'B' and 'g' returns 0	    	'0' and '?' returns -1
 
 
-*/
+*/

code-challenges/Week_15/Remove-Trailing-and-Leading-Zeroes.js

@@ -15,4 +15,4 @@ removeLeadingTrailing("03.1400") ➞ "3.14"
 
 removeLeadingTrailing("30") ➞ "30"
 
-*/
+*/

code-challenges/Week_15/Short-Long-Short.js

@@ -7,4 +7,4 @@ Input:  ("1", "22")		  Input: ("22", "1")
 Output: "1221"		    	Output: "1221"
 
 
-*/
+*/

code-challenges/Week_16/Format-Number-with-Commas-Separating-Thousands.js

@@ -7,4 +7,4 @@ formatNum(1000) ➞ "1,000"
 formatNum(100000) ➞ "100,000"
 formatNum(20) ➞ "20"
 
-*/
+*/

code-challenges/Week_16/Online-Shopping.js

@@ -9,4 +9,4 @@ freeShipping({ "Flatscreen TV": 399.99 }) ➞ true
 
 freeShipping({ "Monopoly": 11.99, "Secret Hitler": 35.99, "Bananagrams": 13.99 }) ➞ true
 
-*/
+*/

code-challenges/Week_16/Return-the-Middle-Characters-of-a-String.js

@@ -9,4 +9,4 @@ getMiddle("middle") ➞ "dd"
 getMiddle("A") ➞ "A"
 
 
-*/
+*/

code-challenges/Week_17/Assign-Person-to-Occupation.js

@@ -18,4 +18,4 @@ assignPersonToJob(names, jobs) ➞ {
 }
 
 
-*/
+*/

code-challenges/Week_17/Is-the-Word-an-Isogram.js

@@ -8,4 +8,4 @@ isIsogram("PasSword") ➞ false // Not case sensitive.
 isIsogram("Consecutive") ➞ false
 
 
-*/
+*/

code-challenges/Week_17/Lowercase-and-Uppercase-Map.js

@@ -8,4 +8,4 @@ mapping(["a", "b", "c"]) ➞ { "a": "A", "b": "B", "c": "C" }
 mapping(["a", "v", "y", "z"]) ➞ { "a": "A", "v": "V", "y": "Y", "z": "Z" }
 
 
-*/
+*/

code-challenges/Week_18/Zip-It-If-You-Can.js

@@ -12,4 +12,4 @@ zipIt(["Ana", "Amy", "Lisa"], ["Bob", "Josh"])
 zipIt(["Ana", "Amy", "Lisa"], ["Bob", "Josh", "Tim"])
  ➞ [["Ana", "Bob"], ["Amy", "Josh"],["Lisa", "Tim"]]
 
-*/
+*/

code-challenges/Week_2/array_search.js

@@ -8,4 +8,4 @@ console.log(findLastIndex([10, 20, 30, 40, 50], 25));  // Output: -1
 console.log(findLastIndex([5, 10, 15, 20, 10, 25], 10));  // Output: 4
 console.log(findLastIndex([1, 2, 3, 4, 5], 6));  // Output: 4
 
-*/
+*/

code-challenges/Week_2/search_and_replace.js

@@ -14,20 +14,11 @@ myReplace("Let us get back to more Coding", "Coding", "algorithms") should retur
 
 */
 
-
-
-
-
-
-
-
-
-
-
-
 console.log(myReplace("Let us go to the store", "store", "mall")); // "Let us go to the mall."
 console.log(myReplace("He is Sleeping on the couch", "Sleeping", "sitting")); // "He is Sitting on the couch."
 console.log(myReplace("I think we should look up there", "up", "Down")); // "I think we should look down there."
 console.log(myReplace("This has a spellngi error", "spellngi", "spelling")); // "This has a spelling error."
 console.log(myReplace("His name is Tom", "Tom", "john")); // "His name is John."
-console.log(myReplace("Let us get back to more Coding", "Coding", "algorithms")); // "Let us get back to more Algorithms."
+console.log(
+  myReplace("Let us get back to more Coding", "Coding", "algorithms")
+); // "Let us get back to more Algorithms."

code-challenges/Week_2/string_manipulation.js

@@ -9,4 +9,4 @@ console.log(findTargetIndex("programming", "abc"));  // Output: -1
 console.log(findTargetIndex("javascript", "script"));  // Output: 4
 console.log(findTargetIndex("challenge", "len"));  // Output: -1
 
-*/
+*/

code-challenges/Week_3/Display_User_Name_in_Greeting.js

@@ -10,20 +10,14 @@ You may also need some of the following (but not required):
 */
 
 // Do not remove the below line
-const prompt = require("prompt-sync")(); 
+const prompt = require("prompt-sync")();
 // Do not remove the above line
 
 function askForNameAndRepeat() {
-
-    // Convert the repeat count to an integer if it's not already
-
-    // Check if the repeat count is a number and greater than zero
-
-    // Create an array filled with the user's name, repeated the desired number of times
-
-    // Use concat to combine the repeated names into one string
-
-
+  // Convert the repeat count to an integer if it's not already
+  // Check if the repeat count is a number and greater than zero
+  // Create an array filled with the user's name, repeated the desired number of times
+  // Use concat to combine the repeated names into one string
 }
 
-askForNameAndRepeat();
+askForNameAndRepeat();

code-challenges/Week_3/HackerRank_Loops.js

@@ -3,10 +3,8 @@
 // Problem 1: Print Numbers from 1 to N
 // Task: Print numbers from 1 to N.
 
-
 // Problem 2: Print Even Numbers from N to 1
 // Task: Print even numbers from N to 1.
 
-
 // Problem 3: Count Down and Up with Jump
 // Task: Count down from N to 1 with a jump of J, and count up from 1 to N with a jump of J.

code-challenges/Week_4/Filter_and_Reduce.js

@@ -34,4 +34,4 @@ const coffeeShops = [
 ];
 
 
-*/
+*/