From bb3fd3c8b388a894d0f913624af3f0acca1cbc32 Mon Sep 17 00:00:00 2001 From: Uros Cirkovic Date: Mon, 30 Oct 2023 13:26:08 +0100 Subject: [PATCH 1/6] feat: update instructions --- README.md | 210 ++++++++++++++++++++++++------------------------------ 1 file changed, 95 insertions(+), 115 deletions(-) diff --git a/README.md b/README.md index ab9fadd9a..ee66fad2c 100644 --- a/README.md +++ b/README.md @@ -11,15 +11,13 @@ Upon completion of this exercise, you will be able to: - - Run predefined tests in Jasmine to verify that the program meets the technical requirements. + - Run predefined tests in Jasmine to check that JavaScript program meets the technical requirements. - Identify expected code behavior by reading and understanding test results and errors. - - Declare and invoke functions using function declaration, function expression, and arrow function syntax. - - Use the `return` keyword to return a value from a function. - - Pass primitive values as arguments to functions. - - Pass arrays to functions as arguments. - - Access items stored in arrays using the indexes, - - Add, remove and check for items in an array using the index and array methods (`unshift`, `push`, `splice`, `shift`, `pop`, `indexOf`, and `includes`). - - Iterate over arrays using the `for` and `forEach` loops. + - Create and invoke functions in JavaScript. + - Pass arrays and primitive values as arguments to functions. + - Use the `return` keyword to return a value from a function. + - Access, add, remove, and check for items in an array using the index and array methods (`unshift`, `push`, `splice`, `shift`, `pop`, `indexOf`, and `includes`). + - Use conditional statements and loops in a function.
@@ -31,6 +29,8 @@ Array manipulation is a common task in programming. Whether you are calculating a total for a shopping cart, grabbing only the first names from a list of people, or moving a piece on a chessboard, you are probably modifying or manipulating an array somewhere in the code.
+ + ## Requirements - Fork this repo @@ -46,7 +46,9 @@ git commit -m "Solved lab" git push origin master ``` -- Create a Pull Request so that your TAs can check your work. +- Create a Pull Request and submit your assignment. + + ## Automated Testing Introduction @@ -56,14 +58,18 @@ Automated software testing is the process of programmatically executing an appli Testing should be viewed as a continuous process, not a discrete operation or single activity in the development lifecycle. Designing tests at the beginning of the product lifecycle can mitigate common issues that arise when developing complex code bases. -Having a strong *test suite* can provide you the ease of mind since you will be able to confidently improve upon your work while knowing that your not breaking a previously developed feature. +Having a strong *test suite* can provide you with ease of mind since you will be able to confidently improve upon your work while knowing that your not breaking a previously developed feature.
+ + ### Testing labs -This LAB and some labs you will work on during the bootcamp are equipped with unit tests to provide automated feedback on your lab progress. +This lab and some labs you will work on during the bootcamp are equipped with unit tests to provide automated feedback on your lab progress.
+ + ### Testing with Jasmine Jasmine is an automated testing framework for JavaScript. It is designed to be used in Behavior-driven Development (**BDD**) programming, focusing more on the business value than the technical details. @@ -71,6 +77,8 @@ Jasmine is an automated testing framework for JavaScript. It is designed to be u We have already included Jasmine in the project you just forked, so let's see how to use it to implement our code.
+ + ### Usage Before starting coding, we will explain the project structure we have provided you: @@ -78,27 +86,44 @@ Before starting coding, we will explain the project structure we have provided y ``` lab-js-functions-and-arrays ├── README.md + │ ├── SpecRunner.html - ├── jasmine + │ + ├── jasmine/ │ └── ... - ├── src + │ + ├── src/ │ └── functions-and-arrays.js - └── tests + │ + └── tests/ └── functions-and-arrays.spec.js ``` -We will be working with the `src/functions-and-arrays.js`. You can find all the files in the `jasmine` folder needed to use Jasmine. All these files are already linked with the `SpecRunner.html` file. +All the needed Jasmine testing library files from the `jasmine/` folder are already linked with `SpecRunner.html` and everything is set up for you to start coding. + +
+ + + +You should write your code and do all the work in the `src/functions-and-arrays.js` file. + +If you want to check the tests, they are located in the `tests/` folder in the file `tests/functions-and-arrays.spec.js` file. + + -If you want to check the tests, they are in the `tests/functions-and-arrays.spec.js` file. +
#### Run tests -Running automated tests with Jasmine is super easy. All you need to do is open the `SpecRunner.html` file in your browser. You will find something similar to this: +Running automated tests with Jasmine is super easy. All you need to do is open the `SpecRunner.html` file in your browserusing the [Live Server](https://marketplace.visualstudio.com/items?itemName=ritwickdey.LiveServer) VSCode extension. You should see something similar to this: + + [![image](https://user-images.githubusercontent.com/23629340/33389609-c2f3965c-d533-11e7-9a03-e0a89314dd98.png)](https://user-images.githubusercontent.com/23629340/33389609-c2f3965c-d533-11e7-9a03-e0a89314dd98.png) + #### Pass the tests You should write your code on the `src/functions-and-arrays.js` file. While following the instructions for each iteration, you should check every test and ensure it's *passing*, before moving on. @@ -111,33 +136,39 @@ To see the output of your JavaScript code, open the [Console in the Developer To **Important:** Note that **you don't need to execute the functions yourself**; the tests will automatically load and execute the functions on each test run. All you need to do is declare the functions, ensure they handle the parameters passed and return what is indicated in the iteration instructions and the test description. We provide you with a sample array for some iterations, so you can do some **manual** testing if you wish. +
+ + + ## Instructions While following the instructions for each iteration, carefully read the instructions and test descriptions to understand the task requirements fully. Do not rush. It would be best if you took your time to read every iteration carefully.
-### Iteration #1: Find the maximum +### Iteration 1 | Find the Maximum Implement the function `maxOfTwoNumbers` that takes two numbers as arguments and returns the bigger number.
-### Iteration #2: Find the longest word + + +### Iteration 2 | Find the Longest Word Implement the function `findLongestWord` that takes as an argument an array of words and returns the longest one. If there are 2 with the same length, it should return the first occurrence. You can use the following array to test your solution: ```javascript -const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot']; +const words = ["mystery", "brother", "aviator", "crocodile", "pearl", "orchard", "crackpot"]; ```
-### Iteration #3: Calculate the sum -#### Iteration #3.1: Sum numbers + +### Iteration 3 | Sum Numbers Calculating a sum can be as simple as iterating over an array and adding each of the elements together. @@ -151,31 +182,9 @@ const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
-#### Bonus - Iteration #3.2: A generic `sum()` function - -In iteration 3, you created a function that returns the sum of an array of numbers. But what if we want to calculate the sum of the length of words in an array? What if it also includes _boolean_ values? To achieve this, we must create a function allowing this flexibility. -You should implement the function `sum()` in this iteration. The function should take an array of mixed values - numbers, strings, and booleans. The function should add all the string lengths, numeric values, and numeric values of booleans to the total sum and return the sum. - -You can use the following array to test your solution: - -```javascript -const mixedArr = [6, 12, 'miami', 1, true, 'barca', '200', 'lisboa', 8, 10]; - -// should return: 57 -``` - -Note: Your function should only accept an array with numbers, strings, or booleans. If the array contains any other data type, such as an object, you should [throw an error](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/throw). In JavaScript, the syntax for throwing an error is as follows: -```javascript -throw new Error("Error message goes here"); -``` - -When specifying the error message, you should be specific and descriptive in explaining the error. - -
- -### Iteration #4: Calculate the average +### Iteration 4 | Numbers Average Calculating an average is a prevalent task. So let's practice it a bit. @@ -186,107 +195,89 @@ Calculating an average is a prevalent task. So let's practice it a bit.
-#### Iteration #4.1: Array of numbers + Implement the function `averageNumbers` that expects an array of numbers and returns the average of the numbers. You can use the following array to test your solution: ```javascript -const numbers = [2, 6, 9, 10, 7, 4, 1, 9]; +const numbers2 = [2, 6, 9, 10, 7, 4, 1, 9]; ```
-#### Iteration #4.2: Array of strings -Implement the function named `averageWordLength` that receives as a single argument an array of words and returns the average length of the words: -You can use the following array to test your solution: +### Iteration 5 | Find Element -```javascript -const words = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace']; -``` +Let's create a simple array search. +Declare a function named `doesWordExist` that will take in an *array of words* as one argument and a *word to search* for as the other. Return `true` if the word exists in the array; otherwise, return `false`.
-#### Bonus - Iteration #4.3: A generic `avg()` function +The function should return `null` if an empty array is passed as an argument. -Create function `avg(arr)` that receives any mixed array and calculates the average. For example, consider an array filled with numbers and/or strings and/or booleans as a mixed array. -The non-numerical values should be counted as follows: -- Booleans: `true` counts as `1` and `false` counts as `0`. -- Strings: use the string `length` as the numeric value. +You can use the following array to test your solution: ```javascript -const mixedArr = [6, 12, 'miami', 1, true, 'barca', '200', 'lisboa', 8, 10]; - -// should return: 5.7 +const words2 = ["machine", "subset", "trouble", "starting", "matter", "eating", "truth", "disobedience"]; ```
-### Iteration #5: Unique arrays -Take the following array, remove the duplicates, and return a new array. You are more than likely going to want to check out the Array methods [`indexOf`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf) and [`includes`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/includes). - -Do this in the form of a function `uniquifyArray` that receives an array of words as an argument. +### Bonus: Iteration 6 | Count Repetition +Declare a function named `howManyTimes` that will take in an *array of words* as the first argument and a *word to search* for as the second argument. The function should return the number of times the word appears in the array. You can use the following array to test your solution: ```javascript -const words = [ - 'crab', - 'poison', - 'contagious', - 'simple', - 'bring', - 'sharp', - 'playground', - 'poison', - 'communion', - 'simple', - 'bring' +const repeatedWords = [ + "machine", + "matter", + "subset", + "trouble", + "starting", + "matter", + "eating", + "matter", + "truth", + "disobedience", + "matter" ]; ```
-### Iteration #6: Find elements -Let's create a simple array search. -Declare a function named `doesWordExist` that will take in an array of words as one argument and a *word to search* for as the other. Return `true` if the word exists in the array; otherwise, return `false`. +### Bonus: Iteration 7 | Unique Arrays -You can use the following array to test your solution: - -```javascript -const words = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience']; -``` +Take the following array, remove the duplicates, and return a new array. You are more than likely going to want to check out the Array methods [`indexOf`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf) and [`includes`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/includes). -
+Do this in the form of a function `uniquifyArray` that receives an array of words as an argument. -### Iteration #7: Count repetition -Declare a function named `howManyTimes` that will take in an array of words as the first argument and a word to search for as the second argument. The function will return the number of times that word appears in the array. You can use the following array to test your solution: ```javascript -const words = [ - 'machine', - 'matter', - 'subset', - 'trouble', - 'starting', - 'matter', - 'eating', - 'matter', - 'truth', - 'disobedience', - 'matter' +const duplicateWords = [ + "crab", + "poison", + "contagious", + "simple", + "bring", + "sharp", + "playground", + "poison", + "communion", + "simple", + "bring" ]; ``` @@ -294,11 +285,7 @@ const words = [ -### Bonus - Iteration #8 - - - -#### Bonus - Iteration #8.1: Product of adjacent numbers +### Bonus: Iteration 8 | Product of Adjacent Numbers Given multiple arrays, find the greatest product of four adjacent numbers. @@ -347,14 +334,6 @@ const matrix = [
- - -#### Bonus - Iteration #8.2: Product of diagonals - -Following the logic you've used in iteration #8.1, declare a function called `greatestProductOfDiagonals(matrix)`. It takes a matrix as a parameter and returns the greatest product of any four values laid out diagonally, in either direction. - -
- **Happy coding!** :heart:
@@ -537,10 +516,11 @@ Following the logic you've used in iteration #8.1, declare a function called `gr
- How can I compare the length of each word in an array in JavaScript? + How can I compare the length of each string in an array in JavaScript?
- To compare the length of each word in an array in JavaScript, you can use a loop to iterate through the array and compare the length of each element using the `.length` property. + + To compare the length of each string in an array in JavaScript, you can use a loop to iterate through the array and compare the length of each string using the `.length` property. Here is an example of how you loop over an array: From fa0fc81f23f6da90112bee1a26702aaa69efe397 Mon Sep 17 00:00:00 2001 From: Uros Cirkovic Date: Mon, 30 Oct 2023 13:26:20 +0100 Subject: [PATCH 2/6] feat: update tests --- tests/functions-and-arrays.spec.js | 508 +++++++++++++---------------- 1 file changed, 234 insertions(+), 274 deletions(-) diff --git a/tests/functions-and-arrays.spec.js b/tests/functions-and-arrays.spec.js index 21ec1130c..f055e2480 100644 --- a/tests/functions-and-arrays.spec.js +++ b/tests/functions-and-arrays.spec.js @@ -12,318 +12,278 @@ const shuffle = (currentArray) => { return array; }; - - -describe('Find the maximum', () => { - it('should declare a function named maxOfTwoNumbers', () => { - expect(typeof maxOfTwoNumbers).toBe('function'); - }); - - it('should return greater of two arguments - if the first argument greater', () => { - expect(maxOfTwoNumbers(2, 1)).toBe(2); - expect(maxOfTwoNumbers(5, -7)).toBe(5); - }); - - it('should return greater of two arguments - if the second argument greater', () => { - expect(maxOfTwoNumbers(1, 3)).toBe(3); - expect(maxOfTwoNumbers(-5, 3)).toBe(3); - }); - - it('should return either arguments - if both arguments are equal', () => { - expect(maxOfTwoNumbers(4, 4)).toBe(4); +describe("Iteration 1 | Find the maximum", () => { + describe("function maxOfTwoNumbers()", () => { + it("should be defined as a function", () => { + expect(typeof maxOfTwoNumbers).toBe("function"); + }); + + it("should return greater of two arguments - if the first argument greater", () => { + expect(maxOfTwoNumbers(2, 1)).toBe(2); + expect(maxOfTwoNumbers(5, -7)).toBe(5); + }); + + it("should return greater of two arguments - if the second argument greater", () => { + expect(maxOfTwoNumbers(1, 3)).toBe(3); + expect(maxOfTwoNumbers(-5, 3)).toBe(3); + }); + + it("should return either arguments - if both arguments are equal", () => { + expect(maxOfTwoNumbers(4, 4)).toBe(4); + }); }); }); -describe('Find the longest word', () => { - it('should declare a function named findLongestWord', () => { - expect(typeof findLongestWord).toBe('function'); - }); - - it('should return null when called with an empty array', () => { - expect(findLongestWord([])).toBe(null); - }); - - it('should return the word when called with a single-word array', () => { - expect(findLongestWord(['foo'])).toBe('foo'); - }); - - it('should return the first occurrence of the word when longest have multiple occurrences ', () => { - expect(findLongestWord(['foo', 'bar'])).toBe('foo'); - expect(findLongestWord(['bar', 'foo'])).toBe('bar'); - }); - it('should return the longest occurrence when it has multiple words', () => { - let words = ['a', 'zab', '12abc', '$$abcd', 'abcde', 'ironhack']; - for (let i = 0; i < 10; i++) { - words = shuffle(words); - expect(findLongestWord(words)).toBe('ironhack'); - } - }); -}); +describe("Iteration 2 | Find the Longest Word", () => { + describe("function findLongestWord()", () => { + it("should be defined as a function", () => { + expect(typeof findLongestWord).toBe("function"); + }); -describe('Calculate the sum of array of numbers', () => { - it('should declare a function named sumNumbers', () => { - expect(typeof sumNumbers).toBe('function'); - }); + it("should return the longest word when called with an array of words", () => { + let words = ["a", "zab", "12abc", "$$abcd", "abcde", "ironhack"]; + for (let i = 0; i < 10; i++) { + words = shuffle(words); + expect(findLongestWord(words)).toBe("ironhack"); + } + }); - it('should return zero if receives an empty array when called', () => { - expect(sumNumbers([])).toBe(0); - }); + it("should return 0 when called with an empty array", () => { + expect(findLongestWord([])).toBe(0); + }); - it('should return the sum with one number array', () => { - expect(sumNumbers([4])).toBe(4); - }); - - it('should return zero if all elements are zero', () => { - expect(sumNumbers([0, 0, 0, 0, 0])).toBe(0); - }); - - it('should return the sum when passed array of numbers', () => { - expect(sumNumbers([10, 5, 4, 32, 8])).toBe(59); - }); -}); - -describe('Bonus: Calculate the sum', () => { - it('should declare a function named sum', () => { - expect(typeof sum).toBe('function'); - }); - - it('should return zero if receives an empty array when called', () => { - expect(sum([])).toBe(0); - }); - - it('should return the sum with one number array', () => { - expect(sum([4])).toBe(4); - }); - - it('should return zero if all elements are zero', () => { - expect(sum([0, 0, 0, 0, 0])).toBe(0); - }); - - it('should return the sum when passed array of numbers', () => { - expect(sum([10, 5, 4, 32, 8])).toBe(59); - }); - - it('should return the sum when passed array of strings', () => { - expect(sum(['ana', 'marco', 'nicolas', 'tania', 'ptwd'])).toBe(24); - }); - - it('should return the sum when passed array of mixed strings and numbers - ', () => { - expect(sum([6, 12, 'miami', 1, 'barca', '200', 'lisboa', 8, 10])).toBe(56); - }); + it("should return the first word when called with a single-word array", () => { + expect(findLongestWord(["foo"])).toBe("foo"); + }); - it('should return the sum when passed array of mixed strings, numbers and booleans - ', () => { - // false is counted as 0 - expect(sum([6, 12, 'miami', 1, 'barca', '200', 'lisboa', 8, false])).toBe(46); - // true is counted as 1 - expect(sum([6, 12, 'miami', 1, 'barca', '200', 'lisboa', 8, true])).toBe(47); - }); + it("should return the first occuring longest word when there are multiple words with the same length", () => { + expect(findLongestWord(["foo", "bar"])).toBe("foo"); + expect(findLongestWord(["bar", "foo"])).toBe("bar"); + }); - it('should throw an error when unsupported data type (object or array) present in the array', () => { - expect(() => sum([6, 12, 'miami', 1, 'barca', '200', 'lisboa', 8, [], {}])).toThrow(); }); - }); -describe('Calculate the average of an array of numbers', () => { - it('should declare a function named averageNumbers', () => { - expect(typeof averageNumbers).toBe('function'); - }); - it('should return null if receives an empty array when called', () => { - expect(averageNumbers([])).toBe(null); - }); +describe("Iteration 3 | Sum Numbers", () => { + describe("function sumNumbers()", () => { + it("should be defined as a function", () => { + expect(typeof sumNumbers).toBe("function"); + }); - it('should return the average of a one-element array', () => { - expect(averageNumbers([9])).toBe(9); - }); + it("should return the sum when passed an array of numbers", () => { + expect(sumNumbers([10, 5, 4, 32, 8])).toBe(59); + }); - it('should return the average even with negative values', () => { - expect(averageNumbers([9, -3, -4, 6])).toBe(2); - }); + it("should return 0 when called with an empty array", () => { + expect(sumNumbers([])).toBe(0); + }); - it('should return the average of the array', () => { - expect(averageNumbers([9, 10, 82, 92, 32, 102, 58])).toBe(55); + it("should return the first number when called with a single-element array", () => { + expect(sumNumbers([4])).toBe(4); + }); }); - }); -describe('Calculate the average of an array of strings', () => { - it('should declare a function named averageWordLength', () => { - expect(typeof averageWordLength).toBe('function'); - }); - - it('should return null if receives an empty array when called', () => { - expect(averageWordLength([])).toBe(null); - }); - - it('should return the average of a one-element array', () => { - expect(averageWordLength(['ironhack'])).toBe(8); - }); - it('should return the average of a the array', () => { - expect( - averageWordLength(['Ironhack', 'Madrid', 'Barcelona', 'Paris', 'Miami', 'Mexico', 'Berlin', 'Programmers']) - ).toBe(7); - }); -}); +describe("Iteration 4 | Numbers Average", () => { + describe("function averageNumbers()", () => { + it("should be defined as a function", () => { + expect(typeof averageNumbers).toBe("function"); + }); -describe('Bonus: Calculate the average of a mixed elements array', () => { - it('should declare a function named avg', () => { - expect(typeof avg).toBe('function'); - }); + it("should return the average number when passed an array of numbers", () => { + expect(averageNumbers([9, 10, 82, 92, 32, 102, 58])).toBe(55); + }); - it('should return null if receives an empty array when called', () => { - expect(avg([])).toBe(null); - }); + it("should return 0 if receives an empty array when called", () => { + expect(averageNumbers([])).toBe(0); + }); - it('should return the average of the array', () => { - // false is counted as 0 - expect(avg([6, 12, 'miami', 1, 'barca', '200', 'lisboa', 8, false])).toBe(46/9); - // true is counted as 1 - expect(avg([6, 12, 'miami', 1, 'barca', '200', 'lisboa', 8, true])).toBe(47/9); + it("should return the average when called with a single-element array", () => { + expect(averageNumbers([9])).toBe(9); + }); }); }); -describe('Unique array', () => { - it('should declare a function named uniquifyArray', () => { - expect(typeof uniquifyArray).toBe('function'); - }); - - it('should return null if receives an empty array when called', () => { - expect(uniquifyArray([])).toEqual(null); - }); - - it('should return the correct uniqified array when an array of the same elements passed as argument', () => { - expect(uniquifyArray(['Ironhack', 'Ironhack', 'Ironhack'])).toEqual(['Ironhack']); - }); - it('should return the same array when no element is repeated', () => { - expect(uniquifyArray(['Cat', 'Dog', 'Cow'])).toEqual(['Cat', 'Dog', 'Cow']); - }); - - it('should return the uniquified array', () => { - expect( - uniquifyArray(['iPhone', 'Samsung', 'Android', 'iOS', 'iPhone', 'Samsung', 'Nokia', 'Blackberry', 'Android']) - ).toEqual(['iPhone', 'Samsung', 'Android', 'iOS', 'Nokia', 'Blackberry']); +describe("Iteration 5 | Find Elements", () => { + describe("function doesWordExist()", () => { + it("should be defined as a function", () => { + expect(typeof doesWordExist).toBe("function"); + }); + + it("should return null if receives an empty array when called", () => { + expect(doesWordExist([])).toBe(null); + }); + + it("should return false if the word we are looking for is not in the array", () => { + expect( + doesWordExist( + ["machine", "poison", "eat", "apple", "horse"], + "ratatouille" + ) + ).toBe(false); + }); + + it("should return true if the word we are looking for is in the array", () => { + expect( + doesWordExist( + ["pizza", "sandwich", "snack", "soda", "book", "computer"], + "book" + ) + ).toBe(true); + }); }); }); -describe('Find elements', () => { - it('should declare a function named doesWordExist', () => { - expect(typeof doesWordExist).toBe('function'); - }); - - it('should return null if receives an empty array when called', () => { - expect(doesWordExist([])).toBe(null); - }); - - it('should return true if the word we are looking for is the only one in the array', () => { - expect(doesWordExist(['machine'], 'machine')).toBe(true); - }); - it('should return false if the word we are looking for is not in the array', () => { - expect(doesWordExist(['machine', 'poison', 'eat', 'apple', 'horse'], 'ratatouille')).toBe(false); - }); - - it('should return true if the word we are looking for is in the array', () => { - expect(doesWordExist(['pizza', 'sandwich', 'snack', 'soda', 'book', 'computer'], 'book')).toBe(true); +describe("Bonus: Iteration 6 | Count Repetition", () => { + describe("function howManyTimes()", () => { + it("should be defined as a function", () => { + expect(typeof howManyTimes).toBe("function"); + }); + + it("should return 0 (zero) if receives an empty array when called", () => { + expect(howManyTimes([])).toBe(0); + }); + + it("should return 1 (one) when the word appears only one time in the array", () => { + expect(howManyTimes(["basketball", "football", "tennis"], "tennis")).toBe( + 1 + ); + }); + + it("should return 0 (zero) when the word doesn't appear in the array", () => { + expect(howManyTimes(["basketball", "football", "tennis"], "rugby")).toBe( + 0 + ); + }); + + it("should return 5 (five) when the word appears 5 times in the array", () => { + expect( + howManyTimes( + [ + "basketball", + "football", + "tennis", + "rugby", + "rugby", + "ping pong", + "rugby", + "basketball", + "rugby", + "handball", + "rugby", + ], + "rugby" + ) + ).toBe(5); + }); }); }); -describe('Count repetition', () => { - it('should declare a function named howManyTimes', () => { - expect(typeof howManyTimes).toBe('function'); - }); - it('should return 0 (zero) if receives an empty array when called', () => { - expect(howManyTimes([])).toBe(0); - }); - - it('should return 1 (one) when the word appears only one time in the array', () => { - expect(howManyTimes(['basketball', 'football', 'tennis'], 'tennis')).toBe(1); - }); - - it("should return 0 (zero) when the word doesn't appear in the array", () => { - expect(howManyTimes(['basketball', 'football', 'tennis'], 'rugby')).toBe(0); - }); - - it('should return 5 (five) when the word appears 5 times in the array', () => { - expect( - howManyTimes( - [ - 'basketball', - 'football', - 'tennis', - 'rugby', - 'rugby', - 'ping pong', - 'rugby', - 'basketball', - 'rugby', - 'handball', - 'rugby' - ], - 'rugby' - ) - ).toBe(5); +describe("Bonus: Iteration 7 | Unique Arrays", () => { + describe("function uniquifyArray()", () => { + it("should be defined as a function", () => { + expect(typeof uniquifyArray).toBe("function"); + }); + + it("should return null if receives an empty array when called", () => { + expect(uniquifyArray([])).toEqual(null); + }); + + it("should return the correct uniqified array when an array of the same elements passed as argument", () => { + expect(uniquifyArray(["Ironhack", "Ironhack", "Ironhack"])).toEqual([ + "Ironhack", + ]); + }); + + it("should return the same array when no element is repeated", () => { + expect(uniquifyArray(["Cat", "Dog", "Cow"])).toEqual([ + "Cat", + "Dog", + "Cow", + ]); + }); + + it("should return the uniquified array", () => { + expect( + uniquifyArray([ + "iPhone", + "Samsung", + "Android", + "iOS", + "iPhone", + "Samsung", + "Nokia", + "Blackberry", + "Android", + ]) + ).toEqual(["iPhone", "Samsung", "Android", "iOS", "Nokia", "Blackberry"]); + }); }); }); -describe('Bonus Quest - greatestProduct', () => { - it('should declare a function named greatestProduct', () => { - expect(typeof greatestProduct).toBe('function'); - }); - - it('should return 1 (one) when all numbers of the arrays are 1', () => { - let matrix = [ - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] - ]; - expect(greatestProduct(matrix)).toBe(1); - }); - it('should return 16 when all the numbers of the arrays are 2', () => { - let matrix = [ - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] - ]; - expect(greatestProduct(matrix)).toBe(16); +describe("Bonus: Iteration 8 | Product of Adjacent Numbers", () => { + describe("function ()", () => { + it("should be defined as a function", () => { + expect(typeof greatestProduct).toBe("function"); + }); + + it("should return 1 (one) when all numbers of the arrays are 1", () => { + let matrix = [ + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], + ]; + expect(greatestProduct(matrix)).toBe(1); + }); + + it("should return 16 when all the numbers of the arrays are 2", () => { + let matrix = [ + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], + ]; + expect(greatestProduct(matrix)).toBe(16); + }); }); }); From 568c61d0f05b423399d24b7b1e61fa737ec355e8 Mon Sep 17 00:00:00 2001 From: Uros Cirkovic Date: Mon, 30 Oct 2023 13:26:34 +0100 Subject: [PATCH 3/6] feat: update starter code --- src/functions-and-arrays.js | 112 ++++++++++++++---------------------- 1 file changed, 43 insertions(+), 69 deletions(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index 3a7dbec41..e54ea1569 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -1,88 +1,83 @@ -// Iteration #1: Find the maximum +// Iteration 1 | Find the Maximum function maxOfTwoNumbers() {} -// Iteration #2: Find longest word -const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot']; + +// Iteration 2 | Find the Longest Word +const words = ["mystery", "brother", "aviator", "crocodile", "pearl", "orchard", "crackpot"]; function findLongestWord() {} -// Iteration #3: Calculate the sum + +// Iteration 3 | Sum Numbers const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; function sumNumbers() {} -// Iteration #3.1 Bonus: -function sum() {} +// Iteration 4 | Numbers Average +const numbers2 = [2, 6, 9, 10, 7, 4, 1, 9]; +function averageNumbers() {} -// Iteration #4: Calculate the average -// Level 1: Array of numbers -const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; -function averageNumbers() {} -// Level 2: Array of strings -const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace']; +// Iteration 5 | Find Elements +const words2 = ["machine", "subset", "trouble", "starting", "matter", "eating", "truth", "disobedience"]; -function averageWordLength() { } +function doesWordExist() {} -// Bonus - Iteration #4.1 -function avg() {} -// Iteration #5: Unique arrays -const wordsUnique = [ - 'crab', - 'poison', - 'contagious', - 'simple', - 'bring', - 'sharp', - 'playground', - 'poison', - 'communion', - 'simple', - 'bring' -]; -function uniquifyArray() {} +// Bonus: Iteration 6 | Count Repetition +const repeatedWords = [ + "machine", + "matter", + "subset", + "trouble", + "starting", + "matter", + "eating", + "matter", + "truth", + "disobedience", + "matter" +]; +function howManyTimes() {} -// Iteration #6: Find elements -const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience']; -function doesWordExist() {} +// Bonus: Iteration 7 | Unique Arrays -// Iteration #7: Count repetition -const wordsCount = [ - 'machine', - 'matter', - 'subset', - 'trouble', - 'starting', - 'matter', - 'eating', - 'matter', - 'truth', - 'disobedience', - 'matter' +const duplicateWords = [ + "crab", + "poison", + "contagious", + "simple", + "bring", + "sharp", + "playground", + "poison", + "communion", + "simple", + "bring" ]; -function howManyTimes() {} +function uniquifyArray() {} + -// Iteration #8: Bonus +// Bonus: Iteration 8 | Product of Adjacent Numbers const matrix = [ [8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8], [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0], @@ -107,24 +102,3 @@ const matrix = [ ]; function greatestProduct() {} - - - - -// The following is required to make unit tests work. -/* Environment setup. Do not modify the below code. */ -if (typeof module !== 'undefined') { - module.exports = { - maxOfTwoNumbers, - findLongestWord, - sumNumbers, - sum, - averageNumbers, - averageWordLength, - avg, - uniquifyArray, - doesWordExist, - howManyTimes, - greatestProduct - }; -} From 541bbb307c8dd2191e819ceb587d4fbf919e5be9 Mon Sep 17 00:00:00 2001 From: Uros Cirkovic Date: Tue, 14 Nov 2023 17:09:04 +0100 Subject: [PATCH 4/6] feat: remove bonus iterations - Update README.md and remove bonus iterations - Update code related to bonus iterations from starter code and tests. --- README.md | 109 +-------------------- src/functions-and-arrays.js | 70 -------------- tests/functions-and-arrays.spec.js | 150 ----------------------------- 3 files changed, 3 insertions(+), 326 deletions(-) diff --git a/README.md b/README.md index ee66fad2c..61c1d4ae4 100644 --- a/README.md +++ b/README.md @@ -11,7 +11,7 @@ Upon completion of this exercise, you will be able to: - - Run predefined tests in Jasmine to check that JavaScript program meets the technical requirements. + - Run predefined tests in Jasmine to check that the JavaScript program meets the technical requirements. - Identify expected code behavior by reading and understanding test results and errors. - Create and invoke functions in JavaScript. - Pass arrays and primitive values as arguments to functions. @@ -116,7 +116,7 @@ If you want to check the tests, they are located in the `tests/` folder in the f #### Run tests -Running automated tests with Jasmine is super easy. All you need to do is open the `SpecRunner.html` file in your browserusing the [Live Server](https://marketplace.visualstudio.com/items?itemName=ritwickdey.LiveServer) VSCode extension. You should see something similar to this: +Running automated tests with Jasmine is super easy. All you need to do is open the `SpecRunner.html` file in your browser using the [Live Server](https://marketplace.visualstudio.com/items?itemName=ritwickdey.LiveServer) VSCode extension. You should see something similar to this: @@ -229,112 +229,9 @@ const words2 = ["machine", "subset", "trouble", "starting", "matter", "eating", -### Bonus: Iteration 6 | Count Repetition +**Happy coding!** :blue_heart: -Declare a function named `howManyTimes` that will take in an *array of words* as the first argument and a *word to search* for as the second argument. The function should return the number of times the word appears in the array. -You can use the following array to test your solution: - -```javascript -const repeatedWords = [ - "machine", - "matter", - "subset", - "trouble", - "starting", - "matter", - "eating", - "matter", - "truth", - "disobedience", - "matter" -]; -``` - -
- - - -### Bonus: Iteration 7 | Unique Arrays - -Take the following array, remove the duplicates, and return a new array. You are more than likely going to want to check out the Array methods [`indexOf`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf) and [`includes`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/includes). - -Do this in the form of a function `uniquifyArray` that receives an array of words as an argument. - - - -You can use the following array to test your solution: - -```javascript -const duplicateWords = [ - "crab", - "poison", - "contagious", - "simple", - "bring", - "sharp", - "playground", - "poison", - "communion", - "simple", - "bring" -]; -``` - -
- - - -### Bonus: Iteration 8 | Product of Adjacent Numbers - -Given multiple arrays, find the greatest product of four adjacent numbers. - -We consider adjacent any four numbers that are next to each other horizontally or vertically. For example, if we have a 5x5 Matrix like: - -```bash -[ 1, 2, 3, 4, 5] -[ 1, 20, 3, 4, 5] -[ 1, 20, 3, 4, 5] -[ 1, 20, 3, 4, 5] -[ 1, 4, 3, 4, 5] -``` - -The greatest product will be the `20`x`20`x`20`x`4` = `32000`. - -
- - - -Declare a function named `greatestProduct(matrix)` to find it in the 20×20 grid below! - -```javascript -const matrix = [ - [08, 02, 22, 97, 38, 15, 00, 40, 00, 75, 04, 05, 07, 78, 52, 12, 50, 77, 91, 08], - [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 04, 56, 62, 00], - [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 03, 49, 13, 36, 65], - [52, 70, 95, 23, 04, 60, 11, 42, 69, 24, 68, 56, 01, 32, 56, 71, 37, 02, 36, 91], - [22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80], - [24, 47, 32, 60, 99, 03, 45, 02, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50], - [32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70], - [67, 26, 20, 68, 02, 62, 12, 20, 95, 63, 94, 39, 63, 08, 40, 91, 66, 49, 94, 21], - [24, 55, 58, 05, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72], - [21, 36, 23, 09, 75, 00, 76, 44, 20, 45, 35, 14, 00, 61, 33, 97, 34, 31, 33, 95], - [78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 03, 80, 04, 62, 16, 14, 09, 53, 56, 92], - [16, 39, 05, 42, 96, 35, 31, 47, 55, 58, 88, 24, 00, 17, 54, 24, 36, 29, 85, 57], - [86, 56, 00, 48, 35, 71, 89, 07, 05, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58], - [19, 80, 81, 68, 05, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 04, 89, 55, 40], - [04, 52, 08, 83, 97, 35, 99, 16, 07, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66], - [88, 36, 68, 87, 57, 62, 20, 72, 03, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69], - [04, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 08, 46, 29, 32, 40, 62, 76, 36], - [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 04, 36, 16], - [20, 73, 35, 29, 78, 31, 90, 01, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 05, 54], - [01, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 01, 89, 19, 67, 48] -]; -``` - -
- -**Happy coding!** :heart:
diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index e54ea1569..ce8695cc9 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -32,73 +32,3 @@ function averageNumbers() {} const words2 = ["machine", "subset", "trouble", "starting", "matter", "eating", "truth", "disobedience"]; function doesWordExist() {} - - - - -// Bonus: Iteration 6 | Count Repetition -const repeatedWords = [ - "machine", - "matter", - "subset", - "trouble", - "starting", - "matter", - "eating", - "matter", - "truth", - "disobedience", - "matter" -]; - -function howManyTimes() {} - - - - -// Bonus: Iteration 7 | Unique Arrays - -const duplicateWords = [ - "crab", - "poison", - "contagious", - "simple", - "bring", - "sharp", - "playground", - "poison", - "communion", - "simple", - "bring" -]; - -function uniquifyArray() {} - - - - -// Bonus: Iteration 8 | Product of Adjacent Numbers -const matrix = [ - [8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8], - [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0], - [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65], - [52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91], - [22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80], - [24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50], - [32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70], - [67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21], - [24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72], - [21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95], - [78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92], - [16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57], - [86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58], - [19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40], - [4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66], - [88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69], - [4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36], - [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16], - [20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54], - [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48] -]; - -function greatestProduct() {} diff --git a/tests/functions-and-arrays.spec.js b/tests/functions-and-arrays.spec.js index f055e2480..60f82a23c 100644 --- a/tests/functions-and-arrays.spec.js +++ b/tests/functions-and-arrays.spec.js @@ -137,153 +137,3 @@ describe("Iteration 5 | Find Elements", () => { }); }); }); - - -describe("Bonus: Iteration 6 | Count Repetition", () => { - describe("function howManyTimes()", () => { - it("should be defined as a function", () => { - expect(typeof howManyTimes).toBe("function"); - }); - - it("should return 0 (zero) if receives an empty array when called", () => { - expect(howManyTimes([])).toBe(0); - }); - - it("should return 1 (one) when the word appears only one time in the array", () => { - expect(howManyTimes(["basketball", "football", "tennis"], "tennis")).toBe( - 1 - ); - }); - - it("should return 0 (zero) when the word doesn't appear in the array", () => { - expect(howManyTimes(["basketball", "football", "tennis"], "rugby")).toBe( - 0 - ); - }); - - it("should return 5 (five) when the word appears 5 times in the array", () => { - expect( - howManyTimes( - [ - "basketball", - "football", - "tennis", - "rugby", - "rugby", - "ping pong", - "rugby", - "basketball", - "rugby", - "handball", - "rugby", - ], - "rugby" - ) - ).toBe(5); - }); - }); -}); - - -describe("Bonus: Iteration 7 | Unique Arrays", () => { - describe("function uniquifyArray()", () => { - it("should be defined as a function", () => { - expect(typeof uniquifyArray).toBe("function"); - }); - - it("should return null if receives an empty array when called", () => { - expect(uniquifyArray([])).toEqual(null); - }); - - it("should return the correct uniqified array when an array of the same elements passed as argument", () => { - expect(uniquifyArray(["Ironhack", "Ironhack", "Ironhack"])).toEqual([ - "Ironhack", - ]); - }); - - it("should return the same array when no element is repeated", () => { - expect(uniquifyArray(["Cat", "Dog", "Cow"])).toEqual([ - "Cat", - "Dog", - "Cow", - ]); - }); - - it("should return the uniquified array", () => { - expect( - uniquifyArray([ - "iPhone", - "Samsung", - "Android", - "iOS", - "iPhone", - "Samsung", - "Nokia", - "Blackberry", - "Android", - ]) - ).toEqual(["iPhone", "Samsung", "Android", "iOS", "Nokia", "Blackberry"]); - }); - }); -}); - - -describe("Bonus: Iteration 8 | Product of Adjacent Numbers", () => { - describe("function ()", () => { - it("should be defined as a function", () => { - expect(typeof greatestProduct).toBe("function"); - }); - - it("should return 1 (one) when all numbers of the arrays are 1", () => { - let matrix = [ - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], - ]; - expect(greatestProduct(matrix)).toBe(1); - }); - - it("should return 16 when all the numbers of the arrays are 2", () => { - let matrix = [ - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], - ]; - expect(greatestProduct(matrix)).toBe(16); - }); - }); -}); From b76d80ab3f706708a20e2bb119a30ddfd8643cc3 Mon Sep 17 00:00:00 2001 From: TinyjoyTW <152999162+TinyjoyTW@users.noreply.github.com> Date: Thu, 11 Jan 2024 16:49:22 +0100 Subject: [PATCH 5/6] solve lab 1 --- src/functions-and-arrays.js | 112 ++++++++++++++++++++++++++++++------ 1 file changed, 95 insertions(+), 17 deletions(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index ce8695cc9..f7f328aac 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -1,34 +1,112 @@ // Iteration 1 | Find the Maximum -function maxOfTwoNumbers() {} - - - +function maxOfTwoNumbers(num1, num2) { + if (num1 > num2) { + return num1; + } else if (num2 > num1) { + return num2; + } + return num1; +} +console.log(maxOfTwoNumbers(5, 50)); // Iteration 2 | Find the Longest Word -const words = ["mystery", "brother", "aviator", "crocodile", "pearl", "orchard", "crackpot"]; - -function findLongestWord() {} - - +function findLongestWord(words) { + if (!words || words.length === 0) { + // If the array is null, or undefined OR if the array is empty// + // the second condition is necessary because an empty array is considered truthy// + return 0; //no need to check further + } + + let longestWord = words[0]; // Initialize with the first word + let maxLength = longestWord.length; // Length of the word at words[0] + + for (let i = 1; i < words.length; i++) { + //i starts from the second word + const currentLength = words[i].length; + if (currentLength > maxLength) { + longestWord = words[i]; + maxLength = currentLength; + } + } + + return longestWord; +} + +const words = [ + "mystery", + "brother", + "aviator", + "crocodile", + "pearl", + "orchard", + "crackpot", +]; + +const result = findLongestWord(words); +console.log(result); // Iteration 3 | Sum Numbers + const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; -function sumNumbers() {} +function sumNumbers(numbers) { + let sum = 0; + + for (const eachNum of numbers) { + sum += eachNum; + } + return sum; +} +console.log(sumNumbers(numbers)); +/* Solution 2: + for (let i = 0; i < numbers.length; i++) { + sum += numbers[i]; + } return sum; +} +console.log(sumNumbers(numbers)); */ // Iteration 4 | Numbers Average const numbers2 = [2, 6, 9, 10, 7, 4, 1, 9]; -function averageNumbers() {} - - - +function averageNumbers(numbers) { + if (numbers.length === 0) { + return 0; + } else { + const sum = sumNumbers(numbers); + const averageNum = sum / numbers.length; + return averageNum; + } +} +averageNumbers(numbers); // Iteration 5 | Find Elements -const words2 = ["machine", "subset", "trouble", "starting", "matter", "eating", "truth", "disobedience"]; - -function doesWordExist() {} +const words2 = [ + "machine", + "subset", + "trouble", + "starting", + "matter", + "eating", + "truth", + "disobedience", +]; + +function doesWordExist(words, word) { + if (words.length === 0) { + // check if an array is empty ==> .length === 0 + return null; + } + + for (let i = 0; i < words.length; i++) { + if (word === words[i]) { + return true; + } + } + return false; // this return must be placed OUTSIDE the loop +} + +console.log(doesWordExist([words], "eating")); From c57759ef0d1bd53ac4906c9036971c4b03fc2b97 Mon Sep 17 00:00:00 2001 From: TinyjoyTW <152999162+TinyjoyTW@users.noreply.github.com> Date: Thu, 11 Jan 2024 22:55:33 +0100 Subject: [PATCH 6/6] combine this lab 2 with lab 1 due to forking issue. --- src/functions-and-arrays.js | 208 ++++++++++++++++++++++++++++++++++++ 1 file changed, 208 insertions(+) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index f7f328aac..85255521d 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -110,3 +110,211 @@ function doesWordExist(words, word) { } console.log(doesWordExist([words], "eating")); + +// Iteration 1 | Count Repetition +const repeatedWords = [ + "machine", + "matter", + "subset", + "trouble", + "starting", + "matter", + "eating", + "matter", + "truth", + "disobedience", + "matter", +]; + +function howManyTimes(arrayOfWords, wordToSearch) { + let timesRepeated = 0; + + if (arrayOfWords.length === 0) { + return 0; + } + for (let i = 0; i < arrayOfWords.length; i++) { + if (arrayOfWords[i] === wordToSearch) { + timesRepeated++; + } + } + return timesRepeated; +} + +console.log(howManyTimes(repeatedWords, "matter")); + +// Iteration 2 | Number Sequence + +function createSequence(n) { + let arr = []; + + if (n === 0) { + return arr; + } + + for (let i = 0; i <= n; i++) { + arr.push(i); + } + return arr; +} + +console.log(createSequence(5)); + +// Iteration 3 | Multiply for Each + +function multiplyBy(numbers, multiplier) { + if (numbers.length === 0) { + return []; + } + + const result = []; + numbers.forEach(function (number) { + result.push(number * multiplier); + }); + return result; +} + +const numbers = [1, 2, 5, 10, 13, 50]; +console.log(multiplyBy(numbers, 10)); + +// Iteration 4 | Filter Out + +function filterOut(original, toRemove) { + if (original.length === 0) { + return null; + } else if (toRemove.length === 0) { + return original; + } + + const filteredArr = original.filter((str) => !toRemove.includes(str)); + + return filteredArr; +} + +const original = ["cat", "dog", "fish", "bird", "cat", "fish"]; +const toRemove = ["cat", "dog"]; +console.log(filterOut(original, toRemove)); + +// Iteration 5 | Unique Arrays +const duplicateWords = [ + "crab", + "poison", + "contagious", + "simple", + "bring", + "sharp", + "playground", + "poison", + "communion", + "simple", + "bring", +]; + +function uniquifyArray(arr) { + if (arr.length === 0) { + return null; + } + + const uniqueArr = []; + for (const word of arr) { + if (!uniqueArr.includes(word)) { + uniqueArr.push(word); + } + } return uniqueArr; +} + +console.log(uniquifyArray(duplicateWords)); + + +// Bonus: Iteration 6 | Product of Adjacent Numbers +const matrix = [ + [8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8], + [ + 49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, + 0, + ], + [ + 81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, + 65, + ], + [52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91], + [ + 22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, + 80, + ], + [ + 24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, + 50, + ], + [ + 32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, + 70, + ], + [ + 67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, + 21, + ], + [ + 24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, + 72, + ], + [21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95], + [78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92], + [ + 16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, + 57, + ], + [86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58], + [ + 19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, + 40, + ], + [4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66], + [ + 88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, + 69, + ], + [ + 4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, + 36, + ], + [ + 20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, + 16, + ], + [ + 20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, + 54, + ], + [ + 1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, + 48, + ], +]; + +function greatestProduct(matrix) { + const rows = matrix.length; + const columns = matrix[0].length; + let maxProduct = 0; + + // Helper function to calculate the product of four numbers + function calculateProduct(a, b, c, d) { + return a * b * c * d; + } + + // Check horizontal products + for (let i = 0; i < rows; i++) { + for (let j = 0; j <= columns - 4; j++) { + const product = calculateProduct(matrix[i][j], matrix[i][j + 1], matrix[i][j + 2], matrix[i][j + 3]); + maxProduct = Math.max(maxProduct, product); + } + } + + // Check vertical products + for (let i = 0; i <= rows - 4; i++) { + for (let j = 0; j < columns; j++) { + const product = calculateProduct(matrix[i][j], matrix[i + 1][j], matrix[i + 2][j], matrix[i + 3][j]); + maxProduct = Math.max(maxProduct, product); + } + } + return maxProduct; +}