Solved: 1365,1431,2160,2373,1816

Author: tufaelahmedbd

1365-Smaller_than_curr.js

@@ -0,0 +1,15 @@
+var smallerNumbersThanCurrent = function (nums) {
+  let m = [];
+
+  for (let i = 0; i < nums.length; i++) {
+    let count = 0;
+    for (let j = 0; j < nums.length; j++) {
+      if (nums[i] > nums[j]) {
+        count++;
+      }
+    }
+    m.push(count);
+  }
+  return m;
+};
+console.log(smallerNumbersThanCurrent([8, 1, 2, 2, 3]));

1431-Kids-Greatest_Candies.js

@@ -0,0 +1,10 @@
+var kidsWithCandies = function (candies, extraCandies) {
+  let res = [];
+  let m = Math.max(...candies);
+  for (let i = 0; i < candies.length; i++) {
+    candies[i] + extraCandies >= m ? res.push(true) : res.push(false);
+  }
+
+  return res;
+};
+console.log(kidsWithCandies([2, 3, 5, 1, 3], 3));

18116-Tuncate-Sentence.js

@@ -0,0 +1,13 @@
+var truncateSentence = function (s, k) {
+  let arr = s.split(" ");
+  let res = "";
+  for (var i = 0; i < k; i++) {
+    if (i == k - 1) {
+      res += arr[i];
+    } else {
+      res += arr[i] + " ";
+    }
+  }
+  return res;
+};
+console.log(truncateSentence("Hello how are you Contestant", 4));

2160-Minimum-Sum.js

@@ -0,0 +1,12 @@
+var minimumSum = function (num) {
+  var myArr = String(num)
+    .split("")
+    .map((num) => {
+      return Number(num);
+    });
+  var m = myArr.sort((a, b) => a - b);
+  var l1 = "".concat(m[0], m[2]);
+  var l2 = "".concat(m[1], m[3]);
+  return Number(l1) + Number(l2);
+};
+console.log(minimumSum(2932));

2373-Largest-Local-valu.js

@@ -0,0 +1,32 @@
+var largestLocal = function (grid) {
+  let matrix = new Array(grid.length - 2)
+    .fill(0)
+    .map(() => new Array(grid[0].length - 2).fill(0));
+
+  for (let i = 0; i < grid[0].length - 2; i++) {
+    for (let j = 0; j < grid[0].length - 2; j++) {
+      matrix[i][j] = Math.max(
+        grid[i][j],
+        grid[i][j + 1],
+        grid[i][j + 2],
+        grid[i + 1][j],
+        grid[i + 1][j + 1],
+        grid[i + 1][j + 2],
+        grid[i + 2][j],
+        grid[i + 2][j + 1],
+        grid[i + 2][j + 2]
+      );
+    }
+  }
+
+  return matrix;
+};
+console.log(
+  largestLocal([
+    [1, 1, 1, 1, 1],
+    [1, 1, 1, 1, 1],
+    [1, 1, 2, 1, 1],
+    [1, 1, 1, 1, 1],
+    [1, 1, 1, 1, 1],
+  ])
+);