add all easy data structure problem with array

Author: codeWithAimeric

2DArrayDS.js

@@ -0,0 +1,19 @@
+/*
+ * Complete the 'hourglassSum' function below.
+ *
+ * The function is expected to return an INTEGER.
+ * The function accepts 2D_INTEGER_ARRAY arr as parameter.
+ */
+
+function hourglassSum(arr) {
+    // Write your code here
+    let resTab = [];
+    let sum = 0;
+    for(let i=0; i<=arr.length -3; i++){
+        for(let j=0; j<=arr.length -3; j++){
+            sum = arr[i][j] + arr[i][j+1] + arr[i][j+2] + arr[i+1][j+1] + arr[i+2][j]+ arr[i+2][j+1] + arr[i+2][j+2];
+            resTab.push(sum);
+        }
+    }
+    return Math.max(...resTab);
+}

arrayDS.js

@@ -0,0 +1,12 @@
+/*
+ * Complete the 'reverseArray' function below.
+ *
+ * The function is expected to return an INTEGER_ARRAY.
+ * The function accepts INTEGER_ARRAY a as parameter.
+ */
+
+function reverseArray(a) {
+    // Write your code here
+    return a.reverse();
+
+}

arrayManipulation.js

@@ -0,0 +1,31 @@
+/*
+ * Complete the 'arrayManipulation' function below.
+ *
+ * The function is expected to return a LONG_INTEGER.
+ * The function accepts following parameters:
+ *  1. INTEGER n
+ *  2. 2D_INTEGER_ARRAY queries
+ */
+
+function arrayManipulation(n, queries) {
+    // Write your code here
+    const arr = new Array(n + 2).fill(0), qn = queries.length;
+    let sum = 0, maxValue = 0;
+
+    for (let i = 0; i < qn; i++) {
+        const [min, max, sum] = queries[i];
+        arr[min] += sum;
+        maxValue = maxValue < sum ? sum : maxValue
+        if (max <= n) {
+            arr[max + 1] -= sum;
+        }
+
+    }
+    for (let k = 0; k < n; k++) {
+        sum += arr[k];
+        if (maxValue < sum) {
+            maxValue = sum;
+        }
+    }
+    return maxValue;
+}

dynamicArray.js

@@ -0,0 +1,30 @@
+/*
+ * Complete the 'dynamicArray' function below.
+ *
+ * The function is expected to return an INTEGER_ARRAY.
+ * The function accepts following parameters:
+ *  1. INTEGER n
+ *  2. 2D_INTEGER_ARRAY queries
+ */
+
+function dynamicArray(n, queries) {
+    // Write your code here
+    let lastAnswer = 0;
+    let arr = [];
+    let idx = 0;
+    let resTab = [];
+    for(let i=0; i<n; i++){
+        arr.push([]);
+    }
+    for(let i=0; i<queries.length; i++){
+        if(queries[i][0] == 1){
+            idx = ((queries[i][1] ^ lastAnswer) % n);
+            arr[idx].push(queries[i][2]);
+        }else if(queries[i][0] == 2){
+            idx = ((queries[i][1] ^ lastAnswer) % n);
+            lastAnswer = arr[idx][queries[i][2] % arr[idx].length];
+            resTab.push(lastAnswer);
+        }
+    }
+    return resTab;
+}

leftRotation.js

@@ -0,0 +1,29 @@
+/*
+ * Complete the 'rotateLeft' function below.
+ *
+ * The function is expected to return an INTEGER_ARRAY.
+ * The function accepts following parameters:
+ *  1. INTEGER d
+ *  2. INTEGER_ARRAY arr
+ */
+
+function rotateLeft(d, arr) {
+    // Write your code here
+    let resTab = [];
+    let tempIndex = 0;
+    for(let i=0; i<arr.length; i++){
+        if(i == 0){
+            tempIndex = arr.length - d;
+            resTab[arr.length -d] = arr[i];
+            continue;
+        }
+        if(i-d >= 0){
+            tempIndex = i-d;
+            resTab[i-d] = arr[i];
+        }else{
+            tempIndex = arr.length -d + i;
+            resTab[arr.length-d+i] = arr[i];
+        }
+    }
+    return resTab;
+}

queriesWithFixedLength.js

@@ -0,0 +1,36 @@
+
+/*
+ * Complete the 'solve' function below.
+ *
+ * The function is expected to return an INTEGER_ARRAY.
+ * The function accepts following parameters:
+ *  1. INTEGER_ARRAY arr
+ *  2. INTEGER_ARRAY queries
+ */
+
+function solve(arr, queries) {
+    // Write your code here
+    const result = [];
+  for (let i = 0; i < queries.length; i++) {
+    const windowSize = queries[i];
+    const tempArr = [];
+    let isMaxAtBeginning = false;
+    let max = 0;
+    for (let j = 0; j < arr.length; j++) {
+      let window;
+      if (windowSize + j <= arr.length) {
+        if (j === 0 || isMaxAtBeginning) {
+          window = arr.slice(j, j + windowSize);
+          max = window.reduce((a, b) => (a >= b ? a : b));
+        }
+        else {
+          max = Math.max(max, arr[j + windowSize - 1]);
+        }
+        tempArr.push(max);
+        isMaxAtBeginning = max === arr[j];
+      }
+    }
+    result.push(tempArr.reduce((a, b) => (a <= b ? a : b)));
+  }
+  return result;
+}

sparseArrays.js

@@ -0,0 +1,26 @@
+/*
+ * Complete the 'matchingStrings' function below.
+ *
+ * The function is expected to return an INTEGER_ARRAY.
+ * The function accepts following parameters:
+ *  1. STRING_ARRAY stringList
+ *  2. STRING_ARRAY queries
+ */
+
+function matchingStrings(stringList, queries) {
+    // Write your code here
+    let resTab = [];
+    let count = 0;
+    for(let i=0; i<queries.length; i++){
+        for(let j=0; j<stringList.length; j++){
+            if(queries[i] == stringList[j]){
+                count++;
+            }else{
+                continue;
+            }
+        }
+        resTab.push(count);
+        count = 0;
+    }
+    return resTab; 
+}