Add leetcode contest 2023-06-10 - 2/4

Author: rigwild

README.md

@@ -56,6 +56,9 @@ zx _genReadme.mjs
 | [`6404-make-array-empty`](./challenges/leetcode-6404-make-array-empty) | leetcode |
 | [`6405-find-the-prefix-common-array-of-two-arrays`](./challenges/leetcode-6405-find-the-prefix-common-array-of-two-arrays) | leetcode |
 | [`6406-maximum-sum-with-exactly-k-elements`](./challenges/leetcode-6406-maximum-sum-with-exactly-k-elements) | leetcode |
+| [`6425-find-the-longest-semi-repetitive-substring`](./challenges/leetcode-6425-find-the-longest-semi-repetitive-substring) | leetcode |
+| [`6426-movement-of-robots`](./challenges/leetcode-6426-movement-of-robots) | leetcode |
+| [`6461-check-if-the-number-is-fascinating`](./challenges/leetcode-6461-check-if-the-number-is-fascinating) | leetcode |
 | [`aneo`](./challenges/codingame-aneo) | codingame |
 | [`ascii-art`](./challenges/codingame-ascii-art) | codingame |
 | [`brackets-extreme-edition`](./challenges/codingame-brackets-extreme-edition) | codingame |
@@ -158,6 +161,9 @@ ___
 | [`6404-make-array-empty`](./challenges/leetcode-6404-make-array-empty) | Classic |
 | [`6405-find-the-prefix-common-array-of-two-arrays`](./challenges/leetcode-6405-find-the-prefix-common-array-of-two-arrays) | Classic |
 | [`6406-maximum-sum-with-exactly-k-elements`](./challenges/leetcode-6406-maximum-sum-with-exactly-k-elements) | Classic |
+| [`6425-find-the-longest-semi-repetitive-substring`](./challenges/leetcode-6425-find-the-longest-semi-repetitive-substring) | Classic |
+| [`6426-movement-of-robots`](./challenges/leetcode-6426-movement-of-robots) | Classic |
+| [`6461-check-if-the-number-is-fascinating`](./challenges/leetcode-6461-check-if-the-number-is-fascinating) | Classic |
 
 ___
 
@@ -187,6 +193,9 @@ ___
 | [`6404-make-array-empty`](./challenges/leetcode-6404-make-array-empty) | leetcode | Classic |
 | [`6405-find-the-prefix-common-array-of-two-arrays`](./challenges/leetcode-6405-find-the-prefix-common-array-of-two-arrays) | leetcode | Classic |
 | [`6406-maximum-sum-with-exactly-k-elements`](./challenges/leetcode-6406-maximum-sum-with-exactly-k-elements) | leetcode | Classic |
+| [`6425-find-the-longest-semi-repetitive-substring`](./challenges/leetcode-6425-find-the-longest-semi-repetitive-substring) | leetcode | Classic |
+| [`6426-movement-of-robots`](./challenges/leetcode-6426-movement-of-robots) | leetcode | Classic |
+| [`6461-check-if-the-number-is-fascinating`](./challenges/leetcode-6461-check-if-the-number-is-fascinating) | leetcode | Classic |
 | [`aneo`](./challenges/codingame-aneo) | codingame | Classic |
 | [`ascii-art`](./challenges/codingame-ascii-art) | codingame | Classic |
 | [`brackets-extreme-edition`](./challenges/codingame-brackets-extreme-edition) | codingame | Classic |

challenges/leetcode-6425-find-the-longest-semi-repetitive-substring/README.md

@@ -0,0 +1,31 @@
+# leetcode-6425-find-the-longest-semi-repetitive-substring
+
+https://leetcode.com/problems/find-the-longest-semi-repetitive-substring
+
+**Type:** Classic
+
+## Run Code Result
+
+### Your input
+
+<!-- prettier-ignore -->
+```js
+"52233"
+"5494"
+"1111111"
+```
+
+### Your stdout
+
+<!-- prettier-ignore -->
+```js
+```
+
+### Your answer
+
+<!-- prettier-ignore -->
+```js
+4
+4
+2
+```

challenges/leetcode-6425-find-the-longest-semi-repetitive-substring/js.js

@@ -0,0 +1,44 @@
+console.log = () => {}
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var longestSemiRepetitiveSubstring = function (s) {
+  console.log('###')
+  const currentFreqs = {}
+  let left = 0
+  let right = 1
+  let sizeMax = 1
+
+  for (left = 0; left < s.length; left++) {
+    for (right = left + 1; right <= s.length; right++) {
+      const str = s.slice(left, right).split('')
+
+      let seenPair = false
+      let size = 0
+      console.log('START', str)
+
+      for (let i = 0; i < str.length; i++) {
+        console.log(str, str[i], i)
+        if (str[i] === str[i + 1]) {
+          if (!seenPair) {
+            seenPair = true
+            size++
+          } else {
+            size++
+            break
+          }
+        } else {
+          size++
+        }
+      }
+      // if (str.length >= 2 && str[str.length - 2] !== str[str.length - 1]) {
+      //     size++
+      // }
+      console.log('END', str, size)
+      sizeMax = Math.max(sizeMax, size)
+    }
+  }
+
+  return sizeMax
+}

challenges/leetcode-6426-movement-of-robots/README.md

@@ -0,0 +1,96 @@
+# leetcode-6426-movement-of-robots
+
+https://leetcode.com/problems/movement-of-robots
+
+**Type:** Classic
+
+## Run Code Result
+
+### Your input
+
+<!-- prettier-ignore -->
+```js
+[-2,0,2]
+"RLL"
+3
+[1,0]
+"RL"
+2
+```
+
+### Your stdout
+
+<!-- prettier-ignore -->
+```js
+#######
+#######
+#######
+[
+  { index: 0, pos: -2, dir: 1 },
+  { index: 1, pos: 0, dir: -1 },
+  { index: 2, pos: 2, dir: -1 }
+]
+TIME 0
+posWithRobots.length 1
+posWithRobots.length 2
+posWithRobots.length 1
+posWithRobots { '1': [ 2 ], '-1': [ 0, 1 ] }
+posWithMultipleRobots Set(1) { -1 }
+[
+  { index: 0, pos: -1, dir: -1 },
+  { index: 1, pos: -1, dir: 1 },
+  { index: 2, pos: 1, dir: -1 }
+]
+TIME 1
+posWithRobots.length 1
+posWithRobots.length 1
+posWithRobots.length 2
+posWithRobots { '0': [ 1, 2 ], '-2': [ 0 ] }
+posWithMultipleRobots Set(1) { 0 }
+[
+  { index: 0, pos: -2, dir: -1 },
+  { index: 1, pos: 0, dir: -1 },
+  { index: 2, pos: 0, dir: 1 }
+]
+TIME 2
+posWithRobots.length 1
+posWithRobots.length 1
+posWithRobots.length 1
+posWithRobots { '1': [ 2 ], '-3': [ 0 ], '-1': [ 1 ] }
+posWithMultipleRobots Set(0) {}
+[
+  { index: 0, pos: -3, dir: -1 },
+  { index: 1, pos: -1, dir: -1 },
+  { index: 2, pos: 1, dir: 1 }
+]
+distance -3 -1 2
+distance -3 1 4
+distance -1 1 2
+#######
+#######
+#######
+[ { index: 0, pos: 1, dir: 1 }, { index: 1, pos: 0, dir: -1 } ]
+TIME 0
+posWithRobots.length 1
+posWithRobots.length 1
+posWithRobots { '2': [ 0 ], '-1': [ 1 ] }
+posWithMultipleRobots Set(0) {}
+[ { index: 0, pos: 2, dir: 1 }, { index: 1, pos: -1, dir: -1 } ]
+TIME 1
+posWithRobots.length 1
+posWithRobots.length 1
+posWithRobots { '3': [ 0 ], '-2': [ 1 ] }
+posWithMultipleRobots Set(0) {}
+[ { index: 0, pos: 3, dir: 1 }, { index: 1, pos: -2, dir: -1 } ]
+distance 3 -2 5
+```
+
+### Your answer
+
+**Time Limit Exceeded when submitting.**
+
+<!-- prettier-ignore -->
+```js
+8
+5
+```

challenges/leetcode-6426-movement-of-robots/js.js

@@ -0,0 +1,55 @@
+// **Time Limit Exceeded when submitting.**
+
+Number.prototype.mod = function (n) {
+  'use strict'
+  return ((this % n) + n) % n
+}
+
+// console.log = () => {}
+
+/**
+ * @param {number[]} nums
+ * @param {string} s
+ * @param {number} d
+ * @return {number}
+ */
+var sumDistance = function (nums, s, d) {
+  const robots = nums.map((x, i) => ({ index: i, pos: x, dir: s[i] === 'L' ? -1 : 1 }))
+  console.log(robots)
+
+  for (let t = 0; t < d; t++) {
+    console.log('TIME', t)
+    const posWithRobots = {}
+    const posWithMultipleRobots = new Set()
+
+    for (const robot of robots) {
+      robot.pos += robot.dir
+
+      if (!posWithRobots[robot.pos]) posWithRobots[robot.pos] = []
+      posWithRobots[robot.pos].push(robot.index)
+      console.log('posWithRobots.length', posWithRobots[robot.pos].length)
+      if (posWithRobots[robot.pos].length >= 2) posWithMultipleRobots.add(robot.pos)
+    }
+
+    console.log('posWithRobots', posWithRobots)
+    console.log('posWithMultipleRobots', posWithMultipleRobots)
+    posWithMultipleRobots.forEach(pos => {
+      posWithRobots[pos].forEach(robotIndex => {
+        robots[robotIndex].dir *= -1
+      })
+    })
+    console.log(robots)
+  }
+
+  let length = 0
+  for (let i = 0; i < robots.length; i++) {
+    for (let j = i + 1; j < robots.length; j++) {
+      console.log('distance', robots[i].pos, robots[j].pos, Math.abs(robots[i].pos - robots[j].pos))
+      length += Math.abs(robots[i].pos - robots[j].pos)
+    }
+  }
+  console.log(length)
+  console.log(length % (10 ** 9 + 7))
+
+  return length.mod(10 ** 9 + 7)
+}

challenges/leetcode-6461-check-if-the-number-is-fascinating/README.md

@@ -0,0 +1,29 @@
+# leetcode-6461-check-if-the-number-is-fascinating
+
+https://leetcode.com/problems/check-if-the-number-is-fascinating
+
+**Type:** Classic
+
+## Run Code Result
+
+### Your input
+
+<!-- prettier-ignore -->
+```js
+192
+100
+```
+
+### Your stdout
+
+<!-- prettier-ignore -->
+```js
+```
+
+### Your answer
+
+<!-- prettier-ignore -->
+```js
+true
+false
+```

challenges/leetcode-6461-check-if-the-number-is-fascinating/js.js

@@ -0,0 +1,15 @@
+/**
+ * @param {number} n
+ * @return {boolean}
+ */
+var isFascinating = function (n) {
+  const res = `${n}${2 * n}${3 * n}`.split('').map(x => +x)
+  // console.log(res)
+  const seen = new Set()
+  for (const x of res) {
+    if (x === 0 || seen.has(x)) return false
+
+    seen.add(x)
+  }
+  return true
+}