ProGrad ID

src/functions-and-arrays.js

@@ -1,18 +1,122 @@
 // Progression #1: Greatest of the two numbers
+function greatestOfTwoNumbers(a,b){
+  if(a>b){
+    return a;
+  }
+  else{
+    return b;
+  }
+}
 
 // Progression #2: The lengthy word
 const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
+function findScaryWord(arr){
+  ans=' '
+  if(arr.length==0){
+    ans = null
+  }
+  for( var _i of arr){
+      if(_i.length>ans.length){
+        ans = _i;
+      }
+
+  }
+  return ans
+}
 
 // Progression #3: Net Price
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
+function netPrice(arr){
+  let total = 0
+  if(arr.length==0){
+    return 0;
+  }
+  for(var _i of arr){
+    total =parseInt(total + _i)
+  }
+  return total
+}
+
+function add(ar){
+  let tot = 0
+  let flag = 0
+  if(ar.length==0){
+    return 0;
+  }
+  else{
+    for(var i of ar){
+      if(typeof i == "string"){
+        let k = i.length
+        tot = parseInt(tot+k)
+      }
+      else if(typeof i == 'boolean'){
+        tot = tot+(i?1:0);
+      }
+      else if(typeof i=='number'){
+        tot = tot+i
+      }
+      else{
+        flag = 1
+      }
+
+    }
+    if(flag == 1){
+      throw new Error("Unsupported data type sir or ma'am")
+    }
+    else{
+      return tot
+    }
+  }
+}
+
+
+
 // Progression #4: Calculate the average
 // Progression 4.1: Array of numbers
 const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
+function midPointOfLevels(arr){
+  let ans = 0
+  if(arr.length==0){
+    ans = null
+    return ans
+  }
+  else{
+    for(var i of arr){
+      ans = ans+i
+    }
+    return ans/arr.length
+  }
+
+}
+
+
 // Progression 4.2: Array of strings
 const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
 
+function averageWordLength(arr){
+  let ans = 0
+  if(arr.length==0){
+    return null
+  }
+  else{
+    ans = add(arr)
+    return parseFloat(ans/arr.length)
+  }
+}
+
+function avg(arr){
+  let ans = 0
+  if(arr.length == 0){
+    return null
+  }
+  else{
+    ans = add(arr)
+    return parseFloat((ans/arr.length).toFixed(2))
+  }
+}
+
 // Progression #5: Unique arrays
 const wordsUnique = [
   'bread',
@@ -32,6 +136,17 @@ const wordsUnique = [
 // Progression #6: Find elements
 const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
 
+function searchElement(arr, word){
+  if(arr.length == 0)
+  {
+    return null
+  }
+  else{
+    return arr.includes(word)
+  }
+}
+
+
 // Progression #7: Count repetition
 const wordsCount = [
   'machine',
@@ -46,6 +161,14 @@ const wordsCount = [
   'disobedience',
   'matter'
 ];
+function howManyTimesElementRepeated(arr, word){
+  if(arr.length == 0){
+    return 0;
+  }
+  else{
+    return arr.filter((element) => element == word).length
+  }
+}
 
 // Progression #8: Bonus
 
@@ -61,3 +184,17 @@ const matrix = [
   [24, 55, 58, 05, 66, 73, 99, 26, 97, 17],
   [21, 36, 23, 09, 75, 00, 76, 44, 20, 45]
 ];
+function maximumProduct(arr){
+  let prod = 1, ans = 1
+  for(var i =0;i<arr.length;i++){
+    for(var j = 0; j<arr.length;j++){
+      prod *= arr[i][j]
+
+    }
+    if(prod>ans){
+      ans = prod
+    }
+    prod = 1
+  }
+  return ans
+}