Apr 30, 2022
diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js
 // Progression #1: Greatest of the two numbers
 function greatestOfTwoNumbers(firstNumber,secondNumber){
  if(firstNumber>=secondNumber)
  return firstNumber;
  return secondNumber;
 }

 // Progression #2: The lengthy word
 const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
 function findScaryWord(givenArray){
  if(givenArray.length===0)
  return null;
  if(givenArray.length===1)
  return givenArray[0]
  let longestLength=0
  let longestStringIndex=-1
  givenArray.forEach((word,index)=>{
    longestStringIndex=word.length>longestLength?index:longestStringIndex
    longestLength=longestStringIndex===index?word.length:longestLength
  })
  return givenArray[longestStringIndex]
 }

 // Progression #3: Net Price
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 function netPrice(givenArray){
  if(givenArray.length===0)
  return 0;
  let totalSum=0;
  givenArray.forEach((item)=>{totalSum+=item})
  return totalSum;
 }

 function add(givenArray){
  if(givenArray.length===0)
  return 0;
  totalSum=0;
  givenArray.forEach((item)=>{
    if(typeof(item)==="string")
    totalSum+=item.length
    else if(typeof(item)==="number")
    totalSum+=item
    else if(typeof(item)==="boolean")
      totalSum=item===true?totalSum+1:totalSum
    else
     throw new Error("Unsupported data type sir or ma'am")
    })
    return totalSum
 }

 // Progression #4: Calculate the average
 function midPointOfLevels(givenArray){
  if(givenArray.length===0)
  return null;
  let totalSum=0;
  givenArray.forEach((item)=>{
    totalSum+=item
  })
  return totalSum/givenArray.length
 }

 function averageWordLength(givenArray){
  if(givenArray.length===0)
  return null
  let totalSum=0;
  givenArray.forEach((item)=>{
    totalSum+=item.length
  })
  return totalSum/givenArray.length
 }
 function avg(givenArray){
  if(givenArray.length===0)
  return null;
  totalSum=0;
  givenArray.forEach((item)=>{
    if(typeof(item)==="string")
    totalSum+=item.length
    else if(typeof(item)==="number")
    totalSum+=item
    else if(typeof(item)==="boolean")
      totalSum=item===true?totalSum+1:totalSum
    })
    let preResult= (totalSum/givenArray.length).toFixed(2)
    return Number(preResult)
 }

 // Progression 4.1: Array of numbers
 const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];

  'egg',
  'flour'
 ];
 function uniqueArray(givenArray){
  if(givenArray.length===0)
  return null;
  let result=[]
  givenArray.forEach((item)=>{
     if(result.includes(item)===false)
     result.push(item)
  })
  return result
 }

 // Progression #6: Find elements
 const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
 function searchElement(givenArray,givenString){
  if(givenArray.length===0)
  return null;
  for(let index=0;index<givenArray.length;index++){
    if(givenArray[index]===givenString)
    return true;
  }
  return false;
 }
 function howManyTimesElementRepeated(givenArray,givenString){
  if(givenArray.length===0)
  return 0
  let count=0;
  givenArray.forEach((item)=>{
    count=item===givenString?++count:count
  })
  return count
 }

 // Progression #7: Count repetition
 const wordsCount = [
  'matter'
 ];


 // Progression #8: Bonus

 const matrix = [
  [24, 55, 58, 05, 66, 73, 99, 26, 97, 17],
  [21, 36, 23, 09, 75, 00, 76, 44, 20, 45]
 ];
 function maximumProduct(givenArray){
  for(let index1=0;index1<givenArray.length;index1++){
    for(let index2=0;index2<givenArray[0].length;index2++){
      if(givenArray[index1][index2]!==1)
      return
    }
  }
  return 1
 }
Original file line number	Diff line number	Diff line change
		@@ -1,12 +1,89 @@
		// Progression #1: Greatest of the two numbers
		function greatestOfTwoNumbers(firstNumber,secondNumber){
		if(firstNumber>=secondNumber)
		return firstNumber;
		return secondNumber;
		}

		// Progression #2: The lengthy word
		const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
		function findScaryWord(givenArray){
		if(givenArray.length===0)
		return null;
		if(givenArray.length===1)
		return givenArray[0]
		let longestLength=0
		let longestStringIndex=-1
		givenArray.forEach((word,index)=>{
		longestStringIndex=word.length>longestLength?index:longestStringIndex
		longestLength=longestStringIndex===index?word.length:longestLength
		})
		return givenArray[longestStringIndex]
		}

		// Progression #3: Net Price
		const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
		function netPrice(givenArray){
		if(givenArray.length===0)
		return 0;
		let totalSum=0;
		givenArray.forEach((item)=>{totalSum+=item})
		return totalSum;
		}

		function add(givenArray){
		if(givenArray.length===0)
		return 0;
		totalSum=0;
		givenArray.forEach((item)=>{
		if(typeof(item)==="string")
		totalSum+=item.length
		else if(typeof(item)==="number")
		totalSum+=item
		else if(typeof(item)==="boolean")
		totalSum=item===true?totalSum+1:totalSum
		else
		throw new Error("Unsupported data type sir or ma'am")
		})
		return totalSum
		}

		// Progression #4: Calculate the average
		function midPointOfLevels(givenArray){
		if(givenArray.length===0)
		return null;
		let totalSum=0;
		givenArray.forEach((item)=>{
		totalSum+=item
		})
		return totalSum/givenArray.length
		}

		function averageWordLength(givenArray){
		if(givenArray.length===0)
		return null
		let totalSum=0;
		givenArray.forEach((item)=>{
		totalSum+=item.length
		})
		return totalSum/givenArray.length
		}
		function avg(givenArray){
		if(givenArray.length===0)
		return null;
		totalSum=0;
		givenArray.forEach((item)=>{
		if(typeof(item)==="string")
		totalSum+=item.length
		else if(typeof(item)==="number")
		totalSum+=item
		else if(typeof(item)==="boolean")
		totalSum=item===true?totalSum+1:totalSum
		})
		let preResult= (totalSum/givenArray.length).toFixed(2)
		return Number(preResult)
		}

		// Progression 4.1: Array of numbers
		const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];

Expand All		@@ -28,9 +105,37 @@ const wordsUnique = [
		'egg',
		'flour'
		];
		function uniqueArray(givenArray){
		if(givenArray.length===0)
		return null;
		let result=[]
		givenArray.forEach((item)=>{
		if(result.includes(item)===false)
		result.push(item)
		})
		return result
		}

		// Progression #6: Find elements
		const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
		function searchElement(givenArray,givenString){
		if(givenArray.length===0)
		return null;
		for(let index=0;index<givenArray.length;index++){
		if(givenArray[index]===givenString)
		return true;
		}
		return false;
		}
		function howManyTimesElementRepeated(givenArray,givenString){
		if(givenArray.length===0)
		return 0
		let count=0;
		givenArray.forEach((item)=>{
		count=item===givenString?++count:count
		})
		return count
		}

		// Progression #7: Count repetition
		const wordsCount = [
Expand All		@@ -47,6 +152,7 @@ const wordsCount = [
		'matter'
		];


		// Progression #8: Bonus

		const matrix = [
Expand All		@@ -61,3 +167,12 @@ const matrix = [
		[24, 55, 58, 05, 66, 73, 99, 26, 97, 17],
		[21, 36, 23, 09, 75, 00, 76, 44, 20, 45]
		];
		function maximumProduct(givenArray){
		for(let index1=0;index1<givenArray.length;index1++){
		for(let index2=0;index2<givenArray[0].length;index2++){
		if(givenArray[index1][index2]!==1)
		return
		}
		}
		return 1
		}