Skip to content

Solved Lab #4247

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Solved Lab #4247

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
319 changes: 256 additions & 63 deletions src/functions-and-arrays.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,119 +1,312 @@
// Iteration #1: Find the maximum
function maxOfTwoNumbers() {}


function maxOfTwoNumbers(num1, num2) {
if (num1 > num2) {
return num1;
} else {
return num2;
}
}

// Iteration #2: Find longest word
const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];

function findLongestWord() {}


const words = [
"mystery",
"brother",
"aviator",
"crocodile",
"pearl",
"orchard",
"crackpot",
];
//return the longest word and if there are two then it must return the first one
function findLongestWord(words) {
let longestWord = "";
let maxLength = 0;
if (words.length === 0) return null;
for (let i = 0; i < words.length; i++) {
if (words[i].length > maxLength) {
longestWord = words[i];
maxLength = words[i].length;
}
}
return longestWord;
}
//console.log(findLongestWord(words));

// Iteration #3: Calculate the sum
const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];

function sumNumbers() {}


function sumNumbers(numbers) {
let totalNums = 0;
for (let i = 0; i < numbers.length; i++) {
totalNums += numbers[i];
}
return totalNums;
}
//console.log(sumNumbers(numbers));

// Iteration #3.1 Bonus:
function sum() {}

const mixedArr = [6, 12, "miami", 1, true, "barca", "200", "lisboa", 8, 10];
// should return: 57

function sum(mixedArr) {
let totalArr = [];
if (mixedArr === 0) return 0;
for (let i = 0; i < mixedArr.length; i++) {
if (typeof mixedArr[i] === `string`) {
totalArr.push(mixedArr[i].length);
} else if (typeof mixedArr[i] === `number`) {
totalArr.push(parseInt(mixedArr[i]));
} else if (mixedArr[i] === true) {
totalArr.push(1);
} else if (typeof mixedArr[i] === `object`) {
throw new Error(
"Unsupported data type (object or array) present in the array"
);
}
}

return totalArr.reduce((acc, curr) => acc + curr, 0);
}

//console.log(sum(mixedArr));

// Iteration #4: Calculate the average
// Level 1: Array of numbers
const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];

function averageNumbers() {}

function averageNumbers(numbersAvg) {
let totalSum = 0;
if (numbersAvg.length === 0) return null;
for (let i = 0; i < numbersAvg.length; i++) {
totalSum += numbersAvg[i];
}
return totalSum / numbersAvg.length;
}
//console.log(averageNumbers(numbersAvg));

// Level 2: Array of strings
const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
const wordsArr = [
"seat",
"correspond",
"linen",
"motif",
"hole",
"smell",
"smart",
"chaos",
"fuel",
"palace",
];

function averageWordLength() { }
function averageWordLength(wordsArr) {
let avgArr = [];
if (wordsArr.length === 0) return null;
for (let i = 0; i < wordsArr.length; i++) {
if (typeof wordsArr[i] === `string`) {
avgArr.push(wordsArr[i].length);
}
}
return avgArr.reduce((acc, curr) => acc + curr, 0) / wordsArr.length;
}
//console.log(averageWordLength(wordsArr));

// Bonus - Iteration #4.1
function avg() {}

function avg(mixedArr) {
let totalAvgArr = [];
if (mixedArr.length === 0) return null;
for (let i = 0; i < mixedArr.length; i++) {
if (typeof mixedArr[i] === `string`) {
totalAvgArr.push(mixedArr[i].length);
} else if (typeof mixedArr[i] === `number`) {
totalAvgArr.push(parseInt(mixedArr[i]));
} else if (mixedArr[i] === true) {
totalAvgArr.push(1);
} else if (mixedArr[i] === false) {
totalAvgArr.push(0);
} else if (typeof mixedArr[i] === `object`) {
throw new Error(
"Unsupported data type (object or array) present in the array"
);
}
}

return totalAvgArr.reduce((acc, curr) => acc + curr, 0) / mixedArr.length;
}

//console.log(avg(mixedArr));

// Iteration #5: Unique arrays
const wordsUnique = [
'crab',
'poison',
'contagious',
'simple',
'bring',
'sharp',
'playground',
'poison',
'communion',
'simple',
'bring'
"crab",
"poison",
"contagious",
"simple",
"bring",
"sharp",
"playground",
"poison",
"communion",
"simple",
"bring",
];

function uniquifyArray() {}

function uniquifyArray(wordsUnique) {
let nonDoubleArray = [];
if (wordsUnique.length === 0) return null;
for (let i = 0; i < wordsUnique.length; i++) {
if (
typeof wordsUnique[i] === `string` &&
!nonDoubleArray.includes(wordsUnique[i])
) {
nonDoubleArray.push(wordsUnique[i]);
}
}
return nonDoubleArray;
}

//console.log(uniquifyArray(wordsUnique))

// Iteration #6: Find elements
const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
const wordsFind = [
"machine",
"subset",
"trouble",
"starting",
"matter",
"eating",
"truth",
"disobedience",
];

function doesWordExist() {}
function doesWordExist(wordsFind,searchWord) {
if(wordsFind.length === 0) return null;
for(let i=0 ; i<wordsFind.length; i++){
if(wordsFind[i] === searchWord)
return true;
}
return false;
}

//console.log(doesWordExist(wordsFind, "machine"))


// Iteration #7: Count repetition
const wordsCount = [
'machine',
'matter',
'subset',
'trouble',
'starting',
'matter',
'eating',
'matter',
'truth',
'disobedience',
'matter'
"machine",
"matter",
"subset",
"trouble",
"starting",
"matter",
"eating",
"matter",
"truth",
"disobedience",
"matter",
];

function howManyTimes() {}
function howManyTimes(wordsCount, search) {
if(wordsCount.length === 0) return 0;
let counter=0;
for(let i=0;i<wordsCount.length; i++) {
if(wordsCount[i] === search){
counter += 1;
}
}
return counter
}


//console.log(wordsCount, "matter")

// Iteration #8: Bonus
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],
[
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],
[
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],
[
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],
[
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]
[
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() {}

function greatestProduct(matrix) {
let totalSum=[];
for(let i=0 ; i<matrix.length;i++){
let highestNum = 0;
for(let j=0; j<matrix[i].length; j++){
if(matrix[i][j] > highestNum){
highestNum = matrix[i][j];
}
}
totalSum.push(highestNum);
}
let answer = totalSum.reduce((acc, val) => acc * val, 1);
return answer;
}

console.log(greatestProduct(matrix));


// The following is required to make unit tests work.
/* Environment setup. Do not modify the below code. */
if (typeof module !== 'undefined') {
if (typeof module !== "undefined") {
module.exports = {
maxOfTwoNumbers,
findLongestWord,
Expand All @@ -125,6 +318,6 @@ if (typeof module !== 'undefined') {
uniquifyArray,
doesWordExist,
howManyTimes,
greatestProduct
greatestProduct,
};
}