Jan 9, 2019
diff --git a/starter-code/src/functions-and-arrays.js b/starter-code/src/functions-and-arrays.js
 // Find the maximum
 function maxOfTwoNumbers(n1, n2){

    if (n1>=n2) {
      return n1;
    } else if (n2>n1) {
      return n2;
    }

 }
 // Finding Longest Word

 var words = [
  'mystery',
  'brother',
  'crackpot'
 ];

 function findLongestWord(arr) {

  var longest = '';

  if (arr.length === 0){
    return undefined;
  } else {
      for (var i = 0; i<arr.length; i++) {
           if (longest.length<arr[i].length) {
            longest=arr[i];

            }
      }
    }

 return longest ;
 }

 // Calculating a Sum

 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];

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


 // Calculate the Average

 var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 function averageNumbers(arr) {
  if (arr.length===0){
    return undefined;
  } else {
  var ave = 0;
  ave = sumArray(arr)/arr.length;
  return ave;
  }
 }

 // Array of Strings

 var wordsArr = [
  'seat',
  'correspond',
  'palace'
 ];



 function averageWordLength(arr){
  if (arr.length === 0){
    return undefined;
  } else {
  var longtotal = 0;
  var averatotal = 0;
  for (i=0;i<arr.length; i++) {
    longtotal += arr[i].length;
  }
 }
  averatotal = longtotal/arr.length;
  return averatotal;
 }



 // Unique Arrays

 var wordsUnique = [
  'crab',
  'poison',
  'bring'
 ];

 function uniquifyArray(arr){

    if (arr.length === 0) {
      return undefined;
    } else {

        for (i=0;i<arr.length;i++) {

          for (var j=0; j<arr.length; j++) {

            if (i != j) {

              if (arr[i]===arr[j]) {
                arr.splice(j,1);

            }

        }
      }
    }
  }
    return arr;
 }



 // Finding Elements
 var wordsFind = [
  'machine',
  'disobedience'
 ];

 function doesWordExist(arr, same){
  if (arr.length === 0) {
    return false;
  }

  var espejo= false;
  arr.forEach(function(word) {
    if (word === same){
    espejo = true;
  }
 });

 return espejo;
 }



 // Counting Repetion
 var wordsCount = [
  'machine',
  'disobedience',
  'matter'
 ];

 function howManyTimes(arr, word){
  if (arr.length === 0) {
    return false;
  }
  var count = 0;
  arr.forEach(function(same) {
    if (same===word){
      count += 1
    }
  });

  return count;

 }

 // Bonus Quest

 var matrix = [
  [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(prodma){

  if (prodma.length === 0) {
    return undefined;
  }
  prodma.forEach(function(){

    for ()

  }


    )
 }
Original file line number	Diff line number	Diff line change
		@@ -1,6 +1,15 @@
		// Find the maximum
		function maxOfTwoNumbers(n1, n2){

		if (n1>=n2) {
		return n1;
		} else if (n2>n1) {
		return n2;
		}

		}
		// Finding Longest Word

		var words = [
		'mystery',
		'brother',
Expand All		@@ -11,15 +20,52 @@ var words = [
		'crackpot'
		];

		function findLongestWord(arr) {

		var longest = '';

		if (arr.length === 0){
		return undefined;
		} else {
		for (var i = 0; i<arr.length; i++) {
		if (longest.length<arr[i].length) {
		longest=arr[i];

		}
		}
		}

		return longest ;
		}

		// Calculating a Sum

		var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];

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


		// Calculate the Average

		var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
		function averageNumbers(arr) {
		if (arr.length===0){
		return undefined;
		} else {
		var ave = 0;
		ave = sumArray(arr)/arr.length;
		return ave;
		}
		}

		// Array of Strings

		var wordsArr = [
		'seat',
		'correspond',
Expand All		@@ -33,7 +79,26 @@ var wordsArr = [
		'palace'
		];



		function averageWordLength(arr){
		if (arr.length === 0){
		return undefined;
		} else {
		var longtotal = 0;
		var averatotal = 0;
		for (i=0;i<arr.length; i++) {
		longtotal += arr[i].length;
		}
		}
		averatotal = longtotal/arr.length;
		return averatotal;
		}



		// Unique Arrays

		var wordsUnique = [
		'crab',
		'poison',
Expand All		@@ -48,6 +113,32 @@ var wordsUnique = [
		'bring'
		];

		function uniquifyArray(arr){

		if (arr.length === 0) {
		return undefined;
		} else {

		for (i=0;i<arr.length;i++) {

		for (var j=0; j<arr.length; j++) {

		if (i != j) {

		if (arr[i]===arr[j]) {
		arr.splice(j,1);

		}

		}
		}
		}
		}
		return arr;
		}



		// Finding Elements
		var wordsFind = [
		'machine',
Expand All		@@ -60,6 +151,23 @@ var wordsFind = [
		'disobedience'
		];

		function doesWordExist(arr, same){
		if (arr.length === 0) {
		return false;
		}

		var espejo= false;
		arr.forEach(function(word) {
		if (word === same){
		espejo = true;
		}
		});

		return espejo;
		}



		// Counting Repetion
		var wordsCount = [
		'machine',
Expand All		@@ -74,6 +182,22 @@ var wordsCount = [
		'disobedience',
		'matter'
		];

		function howManyTimes(arr, word){
		if (arr.length === 0) {
		return false;
		}
		var count = 0;
		arr.forEach(function(same) {
		if (same===word){
		count += 1
		}
		});

		return count;

		}

		// Bonus Quest

		var matrix = [
Expand All		@@ -98,3 +222,18 @@ var matrix = [
		[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(prodma){

		if (prodma.length === 0) {
		return undefined;
		}
		prodma.forEach(function(){

		for ()

		}


		)
		}