add few exercices problem solving

Author: codeWithAimeric

billDivision.js

@@ -0,0 +1,21 @@
+/*
+ * Complete the 'bonAppetit' function below.
+ *
+ * The function accepts following parameters:
+ *  1. INTEGER_ARRAY bill
+ *  2. INTEGER k
+ *  3. INTEGER b
+ */
+
+function bonAppetit(bill, k, b) {
+    // Write your code here
+    bill.splice(k, 1);
+    let sommeTab = bill.reduce((a, b) => a+b, 0);
+    let bAnna;
+    bAnna = sommeTab / 2;
+    if(bAnna == b){
+        console.log('Bon Appetit');
+    }else{
+        console.log(Math.abs(bAnna - b));
+    }
+}

dayOfTheProgrammer.js

@@ -0,0 +1,25 @@
+/*
+ * Complete the 'dayOfProgrammer' function below.
+ *
+ * The function is expected to return a STRING.
+ * The function accepts INTEGER year as parameter.
+ */
+
+function dayOfProgrammer(year) {
+    // Write your code here
+    if(year>=1700 && year<=1917){
+        if(year%4 == 0){
+            return("12.09."+year);
+        }else{
+            return("13.09."+year);
+        }
+    }else if(year == 1918){
+        return("26.09."+year);
+    }else if(year > 1918){
+        if(year%400==0 || (year%4 ==0 && year%100!=0)){
+            return("12.09."+year);
+        }else{
+            return("13.09."+year);
+        }
+    }
+}

divisibleSumPairs.js

@@ -0,0 +1,20 @@
+/*
+ * Complete the 'divisibleSumPairs' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts following parameters:
+ *  1. INTEGER n
+ *  2. INTEGER k
+ *  3. INTEGER_ARRAY ar
+ */
+
+function divisibleSumPairs(n, k, ar) {
+    // Write your code here
+    let count = 0;
+    for(let i=0; i<ar.length; i++){
+        for(let j=i+1; j<ar.length; j++){
+            (ar[i] + ar[j])% k == 0 && count++;
+        }
+    }
+    return count; 
+}

drawingBook.js

@@ -0,0 +1,19 @@
+/*
+ * Complete the 'pageCount' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts following parameters:
+ *  1. INTEGER n
+ *  2. INTEGER p
+ */
+
+function pageCount(n, p) {
+    // Write your code here
+    let startCount = Math.floor(p/2);
+    let stopCount = Math.floor((n/2)-startCount);
+
+    let result = Math.min(startCount, stopCount);
+    return result;
+
+
+}

migratoryBirds.js

@@ -0,0 +1,19 @@
+/*
+ * Complete the 'migratoryBirds' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts INTEGER_ARRAY arr as parameter.
+ */
+
+function migratoryBirds(arr) {
+    // Write your code here
+     let maxVal=0;
+    let objectArr=arr.reduce((obj, b)=> {
+        obj[b] = ++obj[b] || 1;
+        return obj;
+      }, {});
+      
+    maxVal = Math.max(...Object.values(objectArr));
+    let res = Object.keys(objectArr).find(key => objectArr[key] === maxVal);
+    return parseInt(res);
+}

salesByMatch.js

@@ -0,0 +1,20 @@
+/*
+ * Complete the 'sockMerchant' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts following parameters:
+ *  1. INTEGER n
+ *  2. INTEGER_ARRAY ar
+ */
+
+function sockMerchant(n, ar) {
+    // Write your code here
+     const uniqueValues = [... new Set(ar)];
+    let count = 0;
+    uniqueValues.forEach(value => {
+        const filterValues = ar.filter(element => element == value)
+        const pairsNumber = Math.floor(filterValues.length/2)
+        count += pairsNumber
+    })
+    return count;
+}

subbarayDivision.js

@@ -0,0 +1,31 @@
+/*
+ * 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;
+}