add few execices problem solving part2

Author: codeWithAimeric

FormingAMagicSquare.js

@@ -0,0 +1,28 @@
+/*
+ * Complete the 'formingMagicSquare' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts 2D_INTEGER_ARRAY s as parameter.
+ */
+
+function formingMagicSquare(s) {
+    // Write your code here
+        const squares = ['618753294', '816357492', '834159672', '438951276', '672159834', '276951438', '294753618', '492357816'];
+    let min = 100;
+    let cost = (s, squares) => {
+
+        return [...s.map(value => value.join('')).join('')].reduce((target, item, index) => {
+            target += Math.abs(+item - +squares[index])
+
+            return target;
+        }, 0)
+    };
+
+    squares.forEach((item, index) => {
+        let value = cost(s, squares[index]);
+
+        (value < min) && (min = value);
+    });
+
+    return min;
+}

PickingNumbers.js

@@ -0,0 +1,36 @@
+/*
+ * Complete the 'pickingNumbers' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts INTEGER_ARRAY a as parameter.
+ */
+
+function pickingNumbers(a) {
+    // Write your code here
+    let sortedArray = a.sort(function(a,b){
+    return(a - b);
+    });
+
+    let currentArray = [];
+    let longestArray = 0;
+    let startNumber = 0;
+    for(let i = 0; i < sortedArray.length; i++){
+        let result = Math.abs(sortedArray[startNumber] - sortedArray[i]);
+        if (result <= 1){
+            currentArray.push(sortedArray[i]);
+            if(currentArray.length > longestArray){
+                    longestArray = currentArray.length
+                };
+        }else {
+
+            startNumber = i;
+            if(currentArray.length > longestArray){
+                longestArray = currentArray.length
+            }
+            currentArray = [];
+            currentArray.push(sortedArray[i]);
+        }
+
+    }
+        return longestArray;
+}

TheHurdleRace.js

@@ -0,0 +1,20 @@
+/*
+ * Complete the 'hurdleRace' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts following parameters:
+ *  1. INTEGER k
+ *  2. INTEGER_ARRAY height
+ */
+
+function hurdleRace(k, height) {
+    // Write your code here
+    let maxValue = Math.max(...height);
+    if(k > maxValue){
+        return 0;
+    }else{
+        let res = maxValue - k;
+        return res;
+    }
+
+}

backUp.js

@@ -0,0 +1,29 @@
+//additionne tout les éléments d'un tableau 
+let sumTab = tab.reduce((a, b) => a+b, 0);
+
+//sort un tableau dans l'ordre croissant
+let sortTab = tab.sort((a, b) => a-b);
+
+//parcourir un objet
+const object = { a: 1, b: 2, c: 3 };
+for (const property in object) {
+  console.log(`${property}: ${object[property]}`);
+}
+
+//insert in object
+object.key1 = "value1";
+//OR
+object["key1"] = "value1";
+
+//remove duplicate value in array js
+function onlyUnique(value, index, self) {
+  return self.indexOf(value) === index;
+}
+var a = ['a', 1, 'a', 2, '1'];
+var unique = a.filter(onlyUnique);
+
+//reverse number into string 
+let a = 12;
+let aReverseString = a.toString().split("").reverse().join("");
+//transform this string into number
+let aNumber = Number(a);

beautifulDaysAtTheMovies.js

@@ -0,0 +1,26 @@
+/*
+ * Complete the 'beautifulDays' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts following parameters:
+ *  1. INTEGER i
+ *  2. INTEGER j
+ *  3. INTEGER k
+ */
+
+function beautifulDays(i, j, k) {
+    // Write your code here
+    let reverseVal;
+    let tempResult;
+    let count = 0;
+    for(let l=i; l<=j; l++){
+        reverseVal = Number(l.toString().split("").reverse().join(""));
+        tempResult = l - reverseVal;
+        if(tempResult%k == 0){
+            count++;
+        }else{
+            continue;
+        }
+    }
+    return count; 
+}

catsAndMouse.js

@@ -0,0 +1,15 @@
+// Complete the catAndMouse function below.
+function catAndMouse(x, y, z) {
+    let resB = 0;
+    let resA = 0;
+    resA = Math.abs(z - x);
+    resB = Math.abs(z - y);
+    if(resA > resB){
+        return 'Cat B';
+    }else if(resA < resB){
+        return 'Cat A';
+    }else if(resA == resB){
+        return 'Mouse C';
+    }
+
+}

circularArrayRotation.js

@@ -0,0 +1,19 @@
+/*
+ * Complete the 'circularArrayRotation' function below.
+ *
+ * The function is expected to return an INTEGER_ARRAY.
+ * The function accepts following parameters:
+ *  1. INTEGER_ARRAY a
+ *  2. INTEGER k
+ *  3. INTEGER_ARRAY queries
+ */
+
+function circularArrayRotation(a, k, queries) {
+    // Write your code here
+    return queries.map(value => a.reduce((target, item, index) => {
+        let focus = (index + k) % a.length;
+        target[focus] = item;
+
+        return target;
+    }, [])[value]);
+}

climbingLeaderboard.js

@@ -0,0 +1,42 @@
+/*
+ * Complete the 'climbingLeaderboard' function below.
+ *
+ * The function is expected to return an INTEGER_ARRAY.
+ * The function accepts following parameters:
+ *  1. INTEGER_ARRAY ranked
+ *  2. INTEGER_ARRAY player
+ */
+
+function climbingLeaderboard(ranked, player) {
+    // Write your code here
+    let temp=0;
+    let res = [];
+    
+    function onlyUnique(value, index, self) {
+          return self.indexOf(value) === index;
+        }
+    let tab = ranked.filter(onlyUnique);
+    
+    for(let i=0; i<player.length; i++){
+            for(let j=0; j<tab.length; j++){
+                if(player[i] == tab[j]){
+                    temp=tab.indexOf(tab[j]) +1;
+                    res.push(temp);
+                    break;
+                }else if(player[i] >= tab[0]){
+                    temp = 1;
+                    res.push(temp);
+                    break;
+                }else if(player[i] <= tab[tab.length -1]){
+                    temp = tab.length +1;
+                    res.push(temp);
+                    break;
+                }else if(player[i] < tab[j] && player[i] > tab[j+1]){
+                    temp=tab.indexOf(tab[j+1]) +1;
+                    res.push(temp);
+                    break;
+                }
+        }
+    }
+    return res;
+}

countingValleys.js

@@ -0,0 +1,35 @@
+/*
+ * Complete the 'countingValleys' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts following parameters:
+ *  1. INTEGER steps
+ *  2. STRING path
+ */
+
+function countingValleys(steps, path) {
+    // Write your code here
+      let point = 0;
+    let tempFin = -1;
+    let tempDebut = 0;
+    let resTemp; 
+    let count = 0;
+    for(let i=0; i<path.length; i++){
+        if(path[i] == 'U'){
+            point++;
+        }
+        if(path[i] == 'D'){
+            point--;
+        }
+        if(point == 0){
+            tempDebut = tempFin+1;
+            tempFin = i;
+            resTemp = path.substring(tempDebut, tempFin + 1);
+            console.log(resTemp);
+            if(resTemp[0] == 'D'){
+                count++;
+            }else continue;
+        }
+    }
+    return count;      
+}

designerPdfViewer.js

@@ -0,0 +1,28 @@
+/*
+ * Complete the 'designerPdfViewer' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts following parameters:
+ *  1. INTEGER_ARRAY h
+ *  2. STRING word
+ */
+
+function designerPdfViewer(h, word) {
+    // Write your code here
+    word.toLowerCase();
+    let wordLength = word.length;
+    let index=0;
+    let val=0;
+    let tempTab = [];
+    let valMax = 0;
+    let res = 0;
+    let alphabet = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"];
+    for(let i=0; i<word.length; i++){
+        index = alphabet.indexOf(word[i]);
+        val = h[index];
+        tempTab.push(val);
+    }
+    valMax = Math.max(...tempTab);
+    res = valMax * wordLength;
+    return res;
+}

electronicsShop.js

@@ -0,0 +1,29 @@
+/*
+ * Complete the getMoneySpent function below.
+ */
+function getMoneySpent(keyboards, drives, b) {
+    /*
+     * Write your code here.
+     */
+    let tempTab = [];
+    let temp;
+    for(let i=0; i<keyboards.length; i++){
+        if(keyboards[i] >= b){
+            continue;
+        }
+        for(let j=0; j<drives.length; j++){
+            if(drives[j] >= b){
+                continue;
+            }
+            temp = keyboards[i] + drives[j];
+            if(temp <= b){
+                tempTab.push(temp);
+            }
+        }
+    }
+    if(tempTab.length == 0)
+    {
+        return -1;
+    }
+    return Math.max(...tempTab);
+}

saveThePrisoner.js

@@ -0,0 +1,19 @@
+/*
+ * Complete the 'saveThePrisoner' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts following parameters:
+ *  1. INTEGER n
+ *  2. INTEGER m
+ *  3. INTEGER s
+ */
+//n: number of prisoner
+//m: number of candy
+//s: the position where to start distribution
+
+function saveThePrisoner(n, m, s) {
+    // Write your code here
+    let lastPrisoner = (s + m - 1) % n;
+    
+    return lastPrisoner === 0 ? n : lastPrisoner;
+}

sequenceEquation.js

@@ -0,0 +1,19 @@
+/*
+ * Complete the 'permutationEquation' function below.
+ *
+ * The function is expected to return an INTEGER_ARRAY.
+ * The function accepts INTEGER_ARRAY p as parameter.
+ */
+
+function permutationEquation(p) {
+    // Write your code here
+    let temp;
+    let res;
+    let resTab = [];
+    for(let i=1; i<=p.length; i++){
+        temp = p.indexOf(i) +1;
+        res = p.indexOf(temp) + 1;
+        resTab.push(res);
+    }
+    return resTab; 
+}

utopianTree.js

@@ -0,0 +1,19 @@
+/*
+ * Complete the 'utopianTree' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts INTEGER n as parameter.
+ */
+
+function utopianTree(n) {
+    // Write your code here
+    let k=1;
+        for(let i=1; i<=n; i++){
+            if(i%2 == 0){
+            k+=1;
+        }else{
+            k*=2;
+        }
+    }
+    return k;
+}