❌ [biweekly-contest-108]

Author: enkr1

biweekly_contest/108/1.js

@@ -0,0 +1,39 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var alternatingSubarray = function (nums) {
+    let l = 0, max = 0
+
+    while (l < nums.length) {
+        let tmpMax = 0, idx = 0, tmp = []
+        for (let i = l; i < nums.length; i++) {
+            let t = nums[l] + ((idx % 2 === 0) ? 0 : 1)
+            console.log(`~> nums[i]: ${nums[i]}, t: ${t}`)
+            if (nums[i] === t) {
+                tmp.push(nums[i])
+                console.log(`nums[i]: ${nums[i]}, t: ${t}`)
+                tmpMax++;
+            } else {
+                break;
+            }
+            idx++;
+        }
+
+        console.log("tmp")
+        console.log(tmp)
+        max = Math.max(tmpMax, max);
+        l++
+    }
+
+    return (1 === max) ? -1 : max;
+};
+
+let x =
+    alternatingSubarray([64, 65, 64, 65, 64, 65, 66, 65, 66, 65]) // 6
+// alternatingSubarray([21, 9, 5]) // -1
+// alternatingSubarray([2, 3, 4, 5]) // 2
+// alternatingSubarray([2, 3, 4, 3, 4]) // 4
+
+console.log("REs")
+console.log(x)

biweekly_contest/108/2.js

@@ -0,0 +1,48 @@
+// gpt
+var relocateMarbles = (nums, moveFrom, moveTo) => {
+  let pos = new Set(nums);
+
+  for (let i = 0; i < moveFrom.length; i++) {
+    pos.delete(moveFrom[i]);
+    pos.add(moveTo[i]);
+  }
+
+  return Array.from(pos).sort((a, b) => a - b);
+}
+/**
+ * @param {number[]} nums
+ * @param {number[]} moveFrom
+ * @param {number[]} moveTo
+ * @return {number[]}
+ */
+var relocateMarbles2 = function (nums, moveFrom, moveTo) {
+  let map = new Map()
+
+  for (let i = 0; i < moveFrom.length; i++) {
+    map.set(moveFrom[i], moveTo[i])
+  }
+
+  console.log(map)
+
+  for (let i = 0; i < nums.length; i++) {
+    while (map.has(nums[i])) {
+      nums[i] = map.get(nums[i]);
+    }
+  }
+
+  return nums
+};
+
+let x =
+  // relocateMarbles(
+  //   [1, 1, 3, 3],
+  //   [1, 3],
+  //   [2, 2]
+  // ) // [2]
+  relocateMarbles(
+    [1, 6, 7, 8],
+    [1, 7, 2],
+    [2, 9, 5]) //[5,6,8,9]
+
+console.log("REs")
+console.log(x)

biweekly_contest/108/3.js

@@ -0,0 +1,48 @@
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var minimumBeautifulSubstrings = function (s) {
+  let count = 0, tmpS = ""
+  s = s.split("")
+  if (s[0] == "0") return -1;
+
+  while (s.length > 0) {
+    let curr = s.shift()
+    tmpS += curr;
+    console.log(`curr: ${curr}, tmpS: ${tmpS}`)
+    console.log(`tmpS: ${tmpS}, b10: ${parseInt(tmpS, 2)}`)
+    // console.log(Math.log(parseInt(tmpS, 2)) / Math.log(5))
+    if ((curr === "1" && curr === s[0]) && isPowerOf5(parseInt(tmpS, 2))) {
+      console.log(`--- pow5 -> tmpS: ${tmpS}`)
+      count++;
+      tmpS = ""
+      // } else if (curr === "0" && curr === s[0]) {
+    }
+  }
+
+  console.log(`> tmpS: ${tmpS}, b10: ${parseInt(tmpS, 2)}, pcount: ${count}`)
+  // return count
+  if (tmpS !== "" && isPowerOf5(parseInt(tmpS, 2))) count++;
+  return (0 !== count) ? count : -1
+};
+
+function isPowerOf5(number) {
+  const logBase5 = Math.log(number) / Math.log(5);
+  return Math.abs(logBase5 - Math.round(logBase5)) < Number.EPSILON;
+}
+
+let x =
+  // minimumBeautifulSubstrings("100101") // -1
+  // minimumBeautifulSubstrings("1011") // 2
+  // minimumBeautifulSubstrings("111") // 3
+  // minimumBeautifulSubstrings("0") // -1
+  // minimumBeautifulSubstrings("100111000110111") // 4
+  // minimumBeautifulSubstrings("101101101111001") // 5
+  // minimumBeautifulSubstrings("100111000111101") // 4
+  minimumBeautifulSubstrings("101101110011101") // 5
+
+console.log("REs")
+console.log(x)
+
+// NOTE: FAILED

biweekly_contest/108/4.js

@@ -0,0 +1,10 @@
+/**
+ * @param {number} m
+ * @param {number} n
+ * @param {number[][]} coordinates
+ * @return {number[]}
+ */
+var countBlackBlocks = function (m, n, coordinates) {
+
+};
+// NOTE: GAVE UP