Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

BCN will-thorp gabriele-dolfi #113

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.

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

Closed
wants to merge 1 commit into from
Closed
Changes from all commits
Commits
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
114 changes: 100 additions & 14 deletions 114 starter-code/functions-and-arrays.js
Original file line number Diff line number Diff line change
@@ -1,14 +1,24 @@
// Find the maximum
function maxOfTwoNumbers (first, second) {

if (first > second) {
return first
} else {
return second
}
}

var largest = maxOfTwoNumbers(2, 6);
console.log(largest);

// Finding Longest Word
function findLongestWord (words) {

var longestWord = "";
for (i = 0; i < words.length; i++) {
if (words[i].length > longestWord.length) {
longestWord = words[i];
}
}
return longestWord.length;
}

var words = [
Expand All @@ -25,7 +35,11 @@ console.log(longest);

// Calculating a Sum
function sumArray (array) {

var sum = 0;
for (i = 0; i < array.length; i++) {
sum += array[i];
}
return sum;
}

var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
Expand All @@ -34,7 +48,11 @@ console.log(total);

// Calculate the Average
function averageNumbers (array) {

var sum = 0;
for (i = 0; i < array.length; i++) {
sum += array[i];
}
return (sum / array.length);
}

var numbers = [2, 6, 9, 10, 7, 4, 1, 9];
Expand All @@ -43,7 +61,11 @@ console.log(average);

// Array of Strings
function averageWordLength (array) {

var sum = 0;
for (i = 0; i < array.length; i++) {
sum += array[i].length;
}
return (sum / array.length);
}

var words = [
Expand All @@ -63,9 +85,16 @@ console.log(averageLength);

// Unique Arrays
function uniquifyArray (array) {

var newArray = [];
for (i = 0; i < array.length; i++) {
if (array.indexOf(array[i]) == i) {
newArray.push(array[i]);
}
}
return newArray;
}


var words = [
"crab",
"poison",
Expand All @@ -84,7 +113,12 @@ console.log(uniqued);

// Finding Elements
function doesWordExist (wordsArray, word) {

for (i = 0; i < wordsArray.length; i++) {
if (wordsArray[i] == word) {
return true;
}
}
return false;
}

var words = [
Expand All @@ -106,7 +140,13 @@ console.log(hasDog);

// Counting Repetion
function howManyTimes (words, word) {

var count = 0;
for (i = 0; i < words.length; i++) {
if (words[i] == word) {
count++;
}
}
return count;
}

var words = [
Expand All @@ -131,23 +171,69 @@ console.log(howManyDog);

// Bonus Quest
function greatestProduct (matrix) {
var answer = 0;
for (i = 0; i < matrix.length; i++) {
for (j = 0; j < matrix.length; j++) {


if (i === 0 && j === 0) {
if ((matrix[i][j + 1] * matrix [i + 1][j] * matrix[0][19] * matrix[19][0]) > answer) {
answer = matrix[i][j + 1] * matrix[i + 1][j] * matrix[0][19] * matrix[19][0];
}
} else if (i === 0 && 0 < j && j < 19) {
if ((matrix[i][j + 1] * matrix [i + 1][j] * matrix[i][j - 1] * matrix[19][j]) > answer) {
answer = matrix[i][j + 1] * matrix[i + 1][j] * matrix[i][j - 1] * matrix[19][j];
}
} else if (i === 0 && j === 19) {
if ((matrix[19][19] * matrix [0][0] * matrix[i][j - 1] * matrix[i + 1][j]) > answer) {
answer = matrix[i][j + 1] * matrix[i + 1][j] * matrix[i][j - 1] * matrix[19][j];
}
} else if (0 < i && i < 19 && j === 0) {
if ((matrix[i - 1][j] * matrix[i][j + 1] * matrix[i + 1][j] * matrix[i][19]) > answer) {
answer = matrix[i - 1][j] * matrix[i][j + 1] * matrix[i + 1][j] * matrix[i][19];
}
} else if (0 < i && i < 19 && j === 19) {
if ((matrix[i - 1][j] * matrix[0][j] * matrix[i + 1][j] * matrix[i][j - 1]) > answer) {
answer = matrix[i - 1][j] * matrix[0][j] * matrix[i + 1][j] * matrix[i][j - 1];
}
} else if (i === 19 && j === 0) {
if ((matrix[i - 1][j] * matrix[i][j + 1] * matrix[0][0] * matrix[19][19]) > answer) {
answer = matrix[i - 1][j] * matrix[i][j + 1] * matrix[0][0] * matrix[19][19];
}
} else if (i === 19 && 0 < j && j < 19) {
if ((matrix[i - 1][j] * matrix[i][j + 1] * matrix[0][j] * matrix[i][j - 1]) > answer) {
answer = matrix[i - 1][j] * matrix [i][j + 1] * matrix[0][j] * matrix[i][j - 1];
}
} else if (i === 19 && j === 19) {
if ((matrix[i - 1][j] * matrix[0][0] * matrix[0][19] * matrix[i][j - 1]) > answer) {
answer = matrix[i - 1][j] * matrix[0][0] * matrix[0][19] * matrix[i][j - 1];
}
} else {
if ((matrix[i - 1][j] * matrix[i][j + 1] * matrix[i + 1][j] * matrix[i][j - 1]) > answer) {
answer = matrix[i - 1][j] * matrix[0][0] * matrix[0][19] * matrix[i][j - 1];
}
}

}
}
return answer;
}

}

var matrix = [
[08,02,22,97,38,15,0,40,0,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,0],
[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,0,76,44,20,45,35,14,0,61,33,97,34,31,33,95],
[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,0,17,54,24,36,29,85,57],
[86,56,0,48,35,71,89,07,05,44,44,37,44,60,21,58,51,54,17,58],
[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],
Expand Down
Morty Proxy This is a proxified and sanitized view of the page, visit original site.