problem solving part 1

Author: codeWithAimeric

NumberLineJumps.js

@@ -0,0 +1,28 @@
+/*
+ * Complete the 'kangaroo' function below.
+ *
+ * The function is expected to return a STRING.
+ * The function accepts following parameters:
+ *  1. INTEGER x1
+ *  2. INTEGER v1
+ *  3. INTEGER x2
+ *  4. INTEGER v2
+ */
+
+function kangaroo(x1, v1, x2, v2) {
+    // Write your code here
+    let temp;
+    if((x2 > x1) && v2 > v1)
+    {
+        return 'YES';
+    }
+        for(let i=v1, j=v2; i<=10000, j<=10000; i+=v1, j+=v2){
+            if((x1 += i) == (x2 += j)){
+                temp = 1;
+                break;
+            }else continue;
+        }
+        if(temp == 1){
+            return 'YES';
+        }else return 'NO';
+}

aVeryBigSum.js

@@ -0,0 +1,14 @@
+/*
+ * Complete the 'aVeryBigSum' function below.
+ *
+ * The function is expected to return a LONG_INTEGER.
+ * The function accepts LONG_INTEGER_ARRAY ar as parameter.
+ */
+
+function aVeryBigSum(ar) {
+    // Write your code here
+    let res;
+    
+    res = ar.reduce((a, b) => a + b, 0);
+    return res;
+}

appleAndOrange.js

@@ -0,0 +1,31 @@
+/*
+ * Complete the 'countApplesAndOranges' function below.
+ *
+ * The function accepts following parameters:
+ *  1. INTEGER s
+ *  2. INTEGER t
+ *  3. INTEGER a
+ *  4. INTEGER b
+ *  5. INTEGER_ARRAY apples
+ *  6. INTEGER_ARRAY oranges
+ */
+
+function countApplesAndOranges(s, t, a, b, apples, oranges) {
+    // Write your code here
+    let k = 0;
+    let j = 0;
+    let i;
+
+    for (i = 0; i < apples.length; i++) {
+        if (a + apples[i] >= s && a + apples[i] <= t) {
+            ++k;
+        }
+    }
+    for (i = 0; i < oranges.length; i++) {
+        if (b + oranges[i] >= s && b + oranges[i] <= t) {
+            ++j;
+        }
+    }
+    console.log(k); 
+    console.log(j); 
+}

betweenTwoSets.js

@@ -0,0 +1,25 @@
+/*
+ * Complete the 'getTotalX' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts following parameters:
+ *  1. INTEGER_ARRAY a
+ *  2. INTEGER_ARRAY b
+ */
+
+function getTotalX(a, b) {
+    // Write your code here
+   let res = 0;
+    let i = 1;
+    let cloneA = a.splice(1, a.length); 
+    while(a[0] * i <= b[0]) {
+        if(
+         cloneA.every(item => (a[0] * i) % item === 0)
+          &&
+          b.every(item => item % (a[0] * i) === 0)
+         ) {
+            res++;
+        }i++;
+    }
+    return res;
+}

birthdayCakeCandles.js

@@ -0,0 +1,26 @@
+/*
+ * Complete the 'birthdayCakeCandles' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts INTEGER_ARRAY candles as parameter.
+ */
+
+function birthdayCakeCandles(candles) {
+    // Write your code here
+    let count = 0;
+    let max = 0;    
+    for(let i = 0; i < candles.length ; i++)
+    {
+        let num = candles[i];
+        if(num > max)
+        {
+            max = num;
+            count = 1;
+        }else if(max == num)
+        {
+            count++;
+        }
+    }
+    return count;
+
+}

breakingTheRecords.js

@@ -0,0 +1,30 @@
+/*
+ * Complete the 'breakingRecords' function below.
+ *
+ * The function is expected to return an INTEGER_ARRAY.
+ * The function accepts INTEGER_ARRAY scores as parameter.
+ */
+
+function breakingRecords(scores) {
+    // Write your code here
+    let tempMax = scores[0];
+    let tempMin = scores[0];
+    let countMax = 0;
+    let countMin = 0;
+    let resTab = [];
+    for(let i=1; i<scores.length; i++){
+        if(tempMax < scores[i]){
+            tempMax = scores[i];
+            countMax++;
+        }
+    }
+    resTab.push(countMax);
+    for(let i=1; i<scores.length; i++){
+        if(tempMin > scores[i]){
+            tempMin = scores[i];
+            countMin++;
+        }
+    }
+    resTab.push(countMin);
+    return resTab;
+}

compareTheTriplets.js

@@ -0,0 +1,15 @@
+function compareTriplets(a, b) {
+    let ap = 0;
+    let bp = 0;
+    let resTab = [];
+    for(let i=0; i<=a.length; i++){
+        if(a[i] < b[i]){
+            bp++;
+        } else if(a[i] > b[i]) {
+            ap++;
+        }
+    }
+    resTab.push(ap);
+    resTab.push(bp);
+    return resTab;
+}

diagonalDifference.js

@@ -0,0 +1,27 @@
+/*
+ * Complete the 'diagonalDifference' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts 2D_INTEGER_ARRAY arr as parameter.
+ */
+
+function diagonalDifference(arr) {
+    // Write your code here
+    let s1=0;
+    let s2=0;
+    let n=arr.length;
+    for(let i=0; i<n; i++){
+       for(let j=0; j<n; j++) {
+           
+           if(i === j){
+               s1 += arr[i][j];
+           }
+           if(i+j == n-1){
+               s2 += arr[i][j];
+           }
+       }
+    }
+
+    
+    return Math.abs(s1 - s2);
+}

miniMaxSum.js

@@ -0,0 +1,23 @@
+/*
+ * Complete the 'miniMaxSum' function below.
+ *
+ * The function accepts INTEGER_ARRAY arr as parameter.
+ */
+
+function miniMaxSum(arr) {
+    // Write your code here
+    let arr2 = [...arr];
+    let min = Math.min(...arr);
+    let max = Math.max(...arr);
+    
+    let indexOfMin = arr.indexOf(min);
+    let indexOfMax = arr.indexOf(max);
+    
+    let tabMax = arr.splice(indexOfMin, 1);
+    let resMax = arr.reduce((a, b) => a+b, 0);
+    
+    let tabMin = arr2.splice(indexOfMax, 1);  
+    let resMin = arr2.reduce((a, b) => a+b, 0);
+    
+    console.log(resMin, resMax);
+}

plusMinus.js

@@ -0,0 +1,28 @@
+/*
+ * Complete the 'plusMinus' function below.
+ *
+ * The function accepts INTEGER_ARRAY arr as parameter.
+ */
+
+function plusMinus(arr) {
+    // Write your code here
+    let n = arr.length;
+    let p=0;
+    let ng=0;
+    let z=0;
+    for(let i=0; i<=n; i++){
+        if(arr[i] > 0){
+            p++;
+        }else if(arr[i] < 0){
+            ng++;
+        }else if(arr[i] == 0){
+            z++;
+        }
+    }
+    
+    let r1 = (p/n).toFixed(6);
+    let r2 = (ng/n).toFixed(6);
+    let r3 = (z/n).toFixed(6);
+    console.log(r1 + "\n" + r2 +"\n" + r3);
+
+}

solveMeFirst.js

@@ -0,0 +1,4 @@
+function solveMeFirst(a, b) {
+    // Hint: Type return a+b below   
+    return a+b;
+  }

stairCase.js

@@ -0,0 +1,15 @@
+/*
+ * Complete the 'staircase' function below.
+ *
+ * The function accepts INTEGER n as parameter.
+ */
+
+function staircase(n) {
+    // Write your code here
+    let star = "#";
+    let space = " ";
+    for(let i=(n-1), j=1; i>=0 && j<=n; i--, j++){
+        console.log(space.repeat(i) + star.repeat(j));
+    }
+
+}

subarrayDivision.js

@@ -0,0 +1,33 @@
+/*
+ * Complete the 'birthday' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts following parameters:
+ *  1. INTEGER_ARRAY s
+ *  2. INTEGER d
+ *  3. INTEGER m
+ */
+
+function birthday(s, d, m) {
+    // Write your code here
+    let num = s;
+    let nums = [];
+    let count = 0;
+    const add = (arr) => arr.reduce((a, b) => a + b, 0);
+    for (let i = 0; i < s.length; i++) {
+      let tempTab = num.slice(0 + i, m + i);
+      nums.push(tempTab);
+    }
+    if(num.length===1 && num[0]===d){
+        count++;
+    }else{
+      nums.forEach((item) => {
+          if (add(item) === d) {
+            count++;
+          }
+        });
+    }
+    
+  
+    return count;
+}

timeConversion.js

@@ -0,0 +1,27 @@
+/*
+ * Complete the 'timeConversion' function below.
+ *
+ * The function is expected to return a STRING.
+ * The function accepts STRING s as parameter.
+ */
+
+function timeConversion(s) {
+    // Write your code here
+    let [time, part] = [s.substring(0, s.length - 2), s.substring(s.length - 2)]
+
+  time = time.split(":").map(Number)
+
+  if (part === "PM" && time[0] === 12) time[0] = 12
+
+  if (part === "PM" && time[0] !== 12) time[0] = (time[0] + 12) % 24
+
+  if (part === "AM" && time[0] === 12) time[0] = 0
+
+  return time
+
+    .map(String)
+
+    .map(s => s.padStart(2, "0"))
+
+    .join(":")
+}