js problems

Author: MoazIrfan

FlattenArray.js

@@ -0,0 +1,17 @@
+function flattenArray(arr) {
+    let result = [];
+    for (let i = 0; i < arr.length; i++) {
+        if (Array.isArray(arr[i])) {
+            result = result.concat(flattenArray(arr[i]))
+        }
+        else {
+            result.push(arr[i])
+        }
+    }
+    return result
+}
+
+
+const nestedArray = [1, [2, [3, 4], 5], 6, [7, 8]];
+const flattenedArray = flattenArray(nestedArray);
+console.log(flattenedArray);

decodestring.js

@@ -0,0 +1,17 @@
+function twoSum(nums, target) {
+let numObj = {};
+  for (let i = 0; i < nums.length; i++) {
+    let complement = target - nums[i];
+    if (numObj[complement] !== undefined) {
+      return [numObj[complement], i];
+    }
+    numObj[nums[i]] = i;
+  }
+}
+
+
+
+let target=12;
+let nums=[1,4,7,9,2,4,5,6,7,5,6]
+
+console.log(twoSum(nums,target));

encryptString.js

@@ -0,0 +1,21 @@
+function encrypt(input) {
+    if (!input) return ""
+    let result = '';
+    let count = 1;
+
+    for (let i = 0; i < input.length; i++) {
+        if (input[i] === input[i + 1]) {
+            count++
+        }
+        else {
+            result += count + input[i]
+            count = 1
+        }
+
+    }
+    return result;
+}
+
+const input = "aabbbcdda";
+const encrypted = encrypt(input);
+console.log(encrypted); // Output: "2a3b1c2d1a"

maxProfit.js

@@ -0,0 +1,16 @@
+function maxProfit(prices) {
+    let globalValue = 0;
+
+    for (let i = 0; i < prices.length - 1; i++) {
+        for (let j = i + 1; j < prices.length; j++) {
+            const profit = prices[j] - prices[i];
+            if (profit > globalValue) globalValue = profit
+
+
+        }
+
+    }
+    return globalValue
+}
+const prices = [7, 1, 5, 3, 6, 4]
+console.log(maxProfit(prices))

maxmin.js

@@ -0,0 +1,24 @@
+function miniMaxSum(arr) {
+    // Write your code here
+    let min = arr[0];
+    let max = arr[0];
+    let sum = arr[0];
+
+    for (let i = 1; i < arr.length; i++) {
+        const num = arr[i]
+        if (num < min) {
+            min = num;
+        } else if (num > max) {
+            max = num;
+        }
+        sum += num;
+    }
+    const minSum = sum - max;
+    const maxSum = sum - min;
+    console.log(minSum, maxSum)
+
+
+}
+
+
+miniMaxSum([1, 2, 4, 5, 6, 9]);

nonrepeatstring.js

@@ -0,0 +1,14 @@
+function nonRepeat(str) {
+    for (let i = 0; i < str.length; i++) {
+        let char = str[i]
+        if (str.indexOf(char) == i && str.indexOf(char, i + 1) == -1) {
+            return char;
+        }
+    }
+    return "Nothing found"
+}
+
+let str = "abcdabcefef";
+
+console.log(nonRepeat(str))
+

palingdramString.js

@@ -0,0 +1,16 @@
+function stringPalingdram(str) {
+    let len = str.length;
+    for (let i = 0; i < str.length / 2; i++) {
+        console.log(str)
+        if (str[i] !== str[len - 1 - i]) {
+            return "Your String is not Palingdram"
+        }
+
+        return "Strings are Palingdram"
+    }
+
+}
+
+
+const string = "racecarq"
+console.log(stringPalingdram(string))

plusminus.js

@@ -0,0 +1,26 @@
+function plusMinus(arr) {
+    let positiveCount = 0;
+    let negativeCount = 0;
+    let zeroCount = 0;
+    const n = arr.length;
+
+    for (let i = 0; i < n; i++) {
+        if (arr[i] > 0) {
+            positiveCount++;
+        } else if (arr[i] < 0) {
+            negativeCount++;
+        } else {
+            zeroCount++;
+        }
+    }
+
+    const positiveRatio = positiveCount / n;
+    const negativeRatio = negativeCount / n;
+    const zeroRatio = zeroCount / n;
+
+    console.log(positiveRatio.toFixed(6));
+    console.log(negativeRatio.toFixed(6));
+    console.log(zeroRatio.toFixed(6));
+}
+
+plusMinus([1, 1, 0, -1 - 1]);

smallestMissingNum.js

@@ -0,0 +1,20 @@
+function findSmallestMissingPositive(A) {
+
+    const positiveSet = new Set(A.filter(x => x > 0))
+
+    for (let i = 1; i < A.length + 1; i++) {
+        if (!positiveSet.has(i)) {
+            return i;
+        }
+    }
+
+    return A.length + 1
+}
+
+
+// Test cases
+const array1 = [1, 3, 6, 5, 4, 1, 2];
+const array2 = [1, 2, 3];
+const array3 = [-1, -3];
+
+console.log("Smallest missing positive for array1:", findSmallestMissingPositive(array1)); // Output: 5

twobit.js

@@ -0,0 +1,7 @@
+function twoBit(num) {
+    let nu = num.split("0").toString(2)
+    return nu
+}
+
+const num = "100010010001";
+console.log(twoBit(num))