From 296498dc76b480b999fe54b40e75229dfc32ea02 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Sun, 14 Jul 2024 14:44:55 +0530 Subject: [PATCH 1/3] feat: add solutions to lc problem: No.2751 (#3270) Co-authored-by: Yash <75321458+Yashwanth137@users.noreply.github.com> --- .../2700-2799/2751.Robot Collisions/README.md | 167 +++++++++++++++++- .../2751.Robot Collisions/README_EN.md | 167 +++++++++++++++++- .../2751.Robot Collisions/Solution.cpp | 45 +++++ .../2751.Robot Collisions/Solution.go | 45 +++++ .../2751.Robot Collisions/Solution.java | 44 +++++ .../2751.Robot Collisions/Solution.py | 30 ++++ 6 files changed, 492 insertions(+), 6 deletions(-) create mode 100644 solution/2700-2799/2751.Robot Collisions/Solution.cpp create mode 100644 solution/2700-2799/2751.Robot Collisions/Solution.go create mode 100644 solution/2700-2799/2751.Robot Collisions/Solution.java create mode 100644 solution/2700-2799/2751.Robot Collisions/Solution.py diff --git a/solution/2700-2799/2751.Robot Collisions/README.md b/solution/2700-2799/2751.Robot Collisions/README.md index ed0bb46be82ec..276c770bb4572 100644 --- a/solution/2700-2799/2751.Robot Collisions/README.md +++ b/solution/2700-2799/2751.Robot Collisions/README.md @@ -90,25 +90,186 @@ tags: #### Python3 ```python +class Solution: + def survivedRobotsHealths( + self, positions: List[int], healths: List[int], directions: str + ) -> List[int]: + n = len(positions) + indices = list(range(n)) + stack = [] + + indices.sort(key=lambda i: positions[i]) + + for currentIndex in indices: + if directions[currentIndex] == "R": + stack.append(currentIndex) + else: + while stack and healths[currentIndex] > 0: + topIndex = stack.pop() + + if healths[topIndex] > healths[currentIndex]: + healths[topIndex] -= 1 + healths[currentIndex] = 0 + stack.append(topIndex) + elif healths[topIndex] < healths[currentIndex]: + healths[currentIndex] -= 1 + healths[topIndex] = 0 + else: + healths[currentIndex] = 0 + healths[topIndex] = 0 + + result = [health for health in healths if health > 0] + return result ``` #### Java ```java - +class Solution { + public List survivedRobotsHealths(int[] positions, int[] healths, String directions) { + int n = positions.length; + Integer[] indices = new Integer[n]; + for (int i = 0; i < n; i++) { + indices[i] = i; + } + + Arrays.sort(indices, (i, j) -> Integer.compare(positions[i], positions[j])); + + Stack stack = new Stack<>(); + + for (int currentIndex : indices) { + if (directions.charAt(currentIndex) == 'R') { + stack.push(currentIndex); + } else { + while (!stack.isEmpty() && healths[currentIndex] > 0) { + int topIndex = stack.pop(); + + if (healths[topIndex] > healths[currentIndex]) { + healths[topIndex] -= 1; + healths[currentIndex] = 0; + stack.push(topIndex); + } else if (healths[topIndex] < healths[currentIndex]) { + healths[currentIndex] -= 1; + healths[topIndex] = 0; + } else { + healths[currentIndex] = 0; + healths[topIndex] = 0; + } + } + } + } + + List result = new ArrayList<>(); + for (int health : healths) { + if (health > 0) { + result.add(health); + } + } + + return result; + } +} ``` #### C++ ```cpp - +class Solution { +public: + vector survivedRobotsHealths(vector& positions, vector& healths, string directions) { + int n = positions.size(); + vector indices(n); + + iota(indices.begin(), indices.end(), 0); + stack st; + + auto lambda = [&](int i, int j) { return positions[i] < positions[j]; }; + + sort(begin(indices), end(indices), lambda); + + vector result; + for (int currentIndex : indices) { + if (directions[currentIndex] == 'R') { + st.push(currentIndex); + } else { + while (!st.empty() && healths[currentIndex] > 0) { + int topIndex = st.top(); + st.pop(); + + if (healths[topIndex] > healths[currentIndex]) { + healths[topIndex] -= 1; + healths[currentIndex] = 0; + st.push(topIndex); + } else if (healths[topIndex] < healths[currentIndex]) { + healths[currentIndex] -= 1; + healths[topIndex] = 0; + } else { + healths[currentIndex] = 0; + healths[topIndex] = 0; + } + } + } + } + + for (int i = 0; i < n; ++i) { + if (healths[i] > 0) { + result.push_back(healths[i]); + } + } + return result; + } +}; ``` #### Go ```go - +func survivedRobotsHealths(positions []int, healths []int, directions string) []int { + n := len(positions) + indices := make([]int, n) + for i := range indices { + indices[i] = i + } + + sort.Slice(indices, func(i, j int) bool { + return positions[indices[i]] < positions[indices[j]] + }) + + stack := []int{} + + for _, currentIndex := range indices { + if directions[currentIndex] == 'R' { + stack = append(stack, currentIndex) + } else { + for len(stack) > 0 && healths[currentIndex] > 0 { + topIndex := stack[len(stack)-1] + stack = stack[:len(stack)-1] + + if healths[topIndex] > healths[currentIndex] { + healths[topIndex] -= 1 + healths[currentIndex] = 0 + stack = append(stack, topIndex) + } else if healths[topIndex] < healths[currentIndex] { + healths[currentIndex] -= 1 + healths[topIndex] = 0 + } else { + healths[currentIndex] = 0 + healths[topIndex] = 0 + } + } + } + } + + result := []int{} + for _, health := range healths { + if health > 0 { + result = append(result, health) + } + } + + return result +} ``` diff --git a/solution/2700-2799/2751.Robot Collisions/README_EN.md b/solution/2700-2799/2751.Robot Collisions/README_EN.md index f624b21067c2e..d3516d9da0290 100644 --- a/solution/2700-2799/2751.Robot Collisions/README_EN.md +++ b/solution/2700-2799/2751.Robot Collisions/README_EN.md @@ -90,25 +90,186 @@ tags: #### Python3 ```python +class Solution: + def survivedRobotsHealths( + self, positions: List[int], healths: List[int], directions: str + ) -> List[int]: + n = len(positions) + indices = list(range(n)) + stack = [] + + indices.sort(key=lambda i: positions[i]) + + for currentIndex in indices: + if directions[currentIndex] == "R": + stack.append(currentIndex) + else: + while stack and healths[currentIndex] > 0: + topIndex = stack.pop() + + if healths[topIndex] > healths[currentIndex]: + healths[topIndex] -= 1 + healths[currentIndex] = 0 + stack.append(topIndex) + elif healths[topIndex] < healths[currentIndex]: + healths[currentIndex] -= 1 + healths[topIndex] = 0 + else: + healths[currentIndex] = 0 + healths[topIndex] = 0 + + result = [health for health in healths if health > 0] + return result ``` #### Java ```java - +class Solution { + public List survivedRobotsHealths(int[] positions, int[] healths, String directions) { + int n = positions.length; + Integer[] indices = new Integer[n]; + for (int i = 0; i < n; i++) { + indices[i] = i; + } + + Arrays.sort(indices, (i, j) -> Integer.compare(positions[i], positions[j])); + + Stack stack = new Stack<>(); + + for (int currentIndex : indices) { + if (directions.charAt(currentIndex) == 'R') { + stack.push(currentIndex); + } else { + while (!stack.isEmpty() && healths[currentIndex] > 0) { + int topIndex = stack.pop(); + + if (healths[topIndex] > healths[currentIndex]) { + healths[topIndex] -= 1; + healths[currentIndex] = 0; + stack.push(topIndex); + } else if (healths[topIndex] < healths[currentIndex]) { + healths[currentIndex] -= 1; + healths[topIndex] = 0; + } else { + healths[currentIndex] = 0; + healths[topIndex] = 0; + } + } + } + } + + List result = new ArrayList<>(); + for (int health : healths) { + if (health > 0) { + result.add(health); + } + } + + return result; + } +} ``` #### C++ ```cpp - +class Solution { +public: + vector survivedRobotsHealths(vector& positions, vector& healths, string directions) { + int n = positions.size(); + vector indices(n); + + iota(indices.begin(), indices.end(), 0); + stack st; + + auto lambda = [&](int i, int j) { return positions[i] < positions[j]; }; + + sort(begin(indices), end(indices), lambda); + + vector result; + for (int currentIndex : indices) { + if (directions[currentIndex] == 'R') { + st.push(currentIndex); + } else { + while (!st.empty() && healths[currentIndex] > 0) { + int topIndex = st.top(); + st.pop(); + + if (healths[topIndex] > healths[currentIndex]) { + healths[topIndex] -= 1; + healths[currentIndex] = 0; + st.push(topIndex); + } else if (healths[topIndex] < healths[currentIndex]) { + healths[currentIndex] -= 1; + healths[topIndex] = 0; + } else { + healths[currentIndex] = 0; + healths[topIndex] = 0; + } + } + } + } + + for (int i = 0; i < n; ++i) { + if (healths[i] > 0) { + result.push_back(healths[i]); + } + } + return result; + } +}; ``` #### Go ```go - +func survivedRobotsHealths(positions []int, healths []int, directions string) []int { + n := len(positions) + indices := make([]int, n) + for i := range indices { + indices[i] = i + } + + sort.Slice(indices, func(i, j int) bool { + return positions[indices[i]] < positions[indices[j]] + }) + + stack := []int{} + + for _, currentIndex := range indices { + if directions[currentIndex] == 'R' { + stack = append(stack, currentIndex) + } else { + for len(stack) > 0 && healths[currentIndex] > 0 { + topIndex := stack[len(stack)-1] + stack = stack[:len(stack)-1] + + if healths[topIndex] > healths[currentIndex] { + healths[topIndex] -= 1 + healths[currentIndex] = 0 + stack = append(stack, topIndex) + } else if healths[topIndex] < healths[currentIndex] { + healths[currentIndex] -= 1 + healths[topIndex] = 0 + } else { + healths[currentIndex] = 0 + healths[topIndex] = 0 + } + } + } + } + + result := []int{} + for _, health := range healths { + if health > 0 { + result = append(result, health) + } + } + + return result +} ``` diff --git a/solution/2700-2799/2751.Robot Collisions/Solution.cpp b/solution/2700-2799/2751.Robot Collisions/Solution.cpp new file mode 100644 index 0000000000000..0743eac1fed2d --- /dev/null +++ b/solution/2700-2799/2751.Robot Collisions/Solution.cpp @@ -0,0 +1,45 @@ +class Solution { +public: + vector survivedRobotsHealths(vector& positions, vector& healths, string directions) { + int n = positions.size(); + vector indices(n); + + iota(indices.begin(), indices.end(), 0); + stack st; + + auto lambda = [&](int i, int j) { return positions[i] < positions[j]; }; + + sort(begin(indices), end(indices), lambda); + + vector result; + for (int currentIndex : indices) { + if (directions[currentIndex] == 'R') { + st.push(currentIndex); + } else { + while (!st.empty() && healths[currentIndex] > 0) { + int topIndex = st.top(); + st.pop(); + + if (healths[topIndex] > healths[currentIndex]) { + healths[topIndex] -= 1; + healths[currentIndex] = 0; + st.push(topIndex); + } else if (healths[topIndex] < healths[currentIndex]) { + healths[currentIndex] -= 1; + healths[topIndex] = 0; + } else { + healths[currentIndex] = 0; + healths[topIndex] = 0; + } + } + } + } + + for (int i = 0; i < n; ++i) { + if (healths[i] > 0) { + result.push_back(healths[i]); + } + } + return result; + } +}; diff --git a/solution/2700-2799/2751.Robot Collisions/Solution.go b/solution/2700-2799/2751.Robot Collisions/Solution.go new file mode 100644 index 0000000000000..bf12096531e5f --- /dev/null +++ b/solution/2700-2799/2751.Robot Collisions/Solution.go @@ -0,0 +1,45 @@ +func survivedRobotsHealths(positions []int, healths []int, directions string) []int { + n := len(positions) + indices := make([]int, n) + for i := range indices { + indices[i] = i + } + + sort.Slice(indices, func(i, j int) bool { + return positions[indices[i]] < positions[indices[j]] + }) + + stack := []int{} + + for _, currentIndex := range indices { + if directions[currentIndex] == 'R' { + stack = append(stack, currentIndex) + } else { + for len(stack) > 0 && healths[currentIndex] > 0 { + topIndex := stack[len(stack)-1] + stack = stack[:len(stack)-1] + + if healths[topIndex] > healths[currentIndex] { + healths[topIndex] -= 1 + healths[currentIndex] = 0 + stack = append(stack, topIndex) + } else if healths[topIndex] < healths[currentIndex] { + healths[currentIndex] -= 1 + healths[topIndex] = 0 + } else { + healths[currentIndex] = 0 + healths[topIndex] = 0 + } + } + } + } + + result := []int{} + for _, health := range healths { + if health > 0 { + result = append(result, health) + } + } + + return result +} \ No newline at end of file diff --git a/solution/2700-2799/2751.Robot Collisions/Solution.java b/solution/2700-2799/2751.Robot Collisions/Solution.java new file mode 100644 index 0000000000000..59e12be376c0f --- /dev/null +++ b/solution/2700-2799/2751.Robot Collisions/Solution.java @@ -0,0 +1,44 @@ +class Solution { + public List survivedRobotsHealths(int[] positions, int[] healths, String directions) { + int n = positions.length; + Integer[] indices = new Integer[n]; + for (int i = 0; i < n; i++) { + indices[i] = i; + } + + Arrays.sort(indices, (i, j) -> Integer.compare(positions[i], positions[j])); + + Stack stack = new Stack<>(); + + for (int currentIndex : indices) { + if (directions.charAt(currentIndex) == 'R') { + stack.push(currentIndex); + } else { + while (!stack.isEmpty() && healths[currentIndex] > 0) { + int topIndex = stack.pop(); + + if (healths[topIndex] > healths[currentIndex]) { + healths[topIndex] -= 1; + healths[currentIndex] = 0; + stack.push(topIndex); + } else if (healths[topIndex] < healths[currentIndex]) { + healths[currentIndex] -= 1; + healths[topIndex] = 0; + } else { + healths[currentIndex] = 0; + healths[topIndex] = 0; + } + } + } + } + + List result = new ArrayList<>(); + for (int health : healths) { + if (health > 0) { + result.add(health); + } + } + + return result; + } +} \ No newline at end of file diff --git a/solution/2700-2799/2751.Robot Collisions/Solution.py b/solution/2700-2799/2751.Robot Collisions/Solution.py new file mode 100644 index 0000000000000..ed103f23961c5 --- /dev/null +++ b/solution/2700-2799/2751.Robot Collisions/Solution.py @@ -0,0 +1,30 @@ +class Solution: + def survivedRobotsHealths( + self, positions: List[int], healths: List[int], directions: str + ) -> List[int]: + n = len(positions) + indices = list(range(n)) + stack = [] + + indices.sort(key=lambda i: positions[i]) + + for currentIndex in indices: + if directions[currentIndex] == "R": + stack.append(currentIndex) + else: + while stack and healths[currentIndex] > 0: + topIndex = stack.pop() + + if healths[topIndex] > healths[currentIndex]: + healths[topIndex] -= 1 + healths[currentIndex] = 0 + stack.append(topIndex) + elif healths[topIndex] < healths[currentIndex]: + healths[currentIndex] -= 1 + healths[topIndex] = 0 + else: + healths[currentIndex] = 0 + healths[topIndex] = 0 + + result = [health for health in healths if health > 0] + return result From eca2a78892375dc8f0f85e1d1904f99bcef87da7 Mon Sep 17 00:00:00 2001 From: Dhanush Date: Sun, 14 Jul 2024 14:45:41 +0530 Subject: [PATCH 2/3] feat: add java solution to lc problem: No.0726 (#3271) --- .../0700-0799/0726.Number of Atoms/README.md | 44 ++++++++++++++++++- .../0726.Number of Atoms/README_EN.md | 44 ++++++++++++++++++- .../0726.Number of Atoms/Solution.java | 43 ++++++++++++++++++ 3 files changed, 129 insertions(+), 2 deletions(-) create mode 100644 solution/0700-0799/0726.Number of Atoms/Solution.java diff --git a/solution/0700-0799/0726.Number of Atoms/README.md b/solution/0700-0799/0726.Number of Atoms/README.md index d7d1da455232e..2315f6e95b8de 100644 --- a/solution/0700-0799/0726.Number of Atoms/README.md +++ b/solution/0700-0799/0726.Number of Atoms/README.md @@ -98,7 +98,49 @@ tags: #### Java ```java - +class Solution { + public String countOfAtoms(String formula) { + Map map = new HashMap<>(); + int[] stack = new int[1000]; + int top = 0, multiplier = 1, freq = 0; + char[] c = formula.toCharArray(); + for (int i = c.length - 1; i >= 0; i--) { + if (c[i] >= 'a' && c[i] <= 'z') { + int end = i--; + while (i >= 0 && c[i] >= 'a' && c[i] <= 'z') i--; + String key = new String(c, i, end - i + 1); + map.put(key, map.getOrDefault(key, 0) + Math.max(freq, 1) * multiplier); + freq = 0; + } else if (c[i] >= 'A' && c[i] <= 'Z') { + String key = new String(c, i, 1); + map.put(key, map.getOrDefault(key, 0) + Math.max(freq, 1) * multiplier); + freq = 0; + } else if (c[i] >= '0' && c[i] <= '9') { + freq = c[i] - '0'; + int p = 10; + while (i - 1 >= 0 && c[i - 1] >= '0' && c[i - 1] <= '9') { + freq += p * (c[--i] - '0'); + p *= 10; + } + } else if (c[i] == ')') { + stack[top++] = multiplier; + multiplier *= Math.max(freq, 1); + freq = 0; + } else { + multiplier = stack[--top]; + } + } + List keys = new ArrayList<>(map.keySet()); + Collections.sort(keys); + StringBuilder sb = new StringBuilder(); + for (String key : keys) { + sb.append(key); + int f = map.get(key); + if (f > 1) sb.append(f); + } + return sb.toString(); + } +} ``` #### C++ diff --git a/solution/0700-0799/0726.Number of Atoms/README_EN.md b/solution/0700-0799/0726.Number of Atoms/README_EN.md index 641c1face2c92..76917f0343ba2 100644 --- a/solution/0700-0799/0726.Number of Atoms/README_EN.md +++ b/solution/0700-0799/0726.Number of Atoms/README_EN.md @@ -98,7 +98,49 @@ tags: #### Java ```java - +class Solution { + public String countOfAtoms(String formula) { + Map map = new HashMap<>(); + int[] stack = new int[1000]; + int top = 0, multiplier = 1, freq = 0; + char[] c = formula.toCharArray(); + for (int i = c.length - 1; i >= 0; i--) { + if (c[i] >= 'a' && c[i] <= 'z') { + int end = i--; + while (i >= 0 && c[i] >= 'a' && c[i] <= 'z') i--; + String key = new String(c, i, end - i + 1); + map.put(key, map.getOrDefault(key, 0) + Math.max(freq, 1) * multiplier); + freq = 0; + } else if (c[i] >= 'A' && c[i] <= 'Z') { + String key = new String(c, i, 1); + map.put(key, map.getOrDefault(key, 0) + Math.max(freq, 1) * multiplier); + freq = 0; + } else if (c[i] >= '0' && c[i] <= '9') { + freq = c[i] - '0'; + int p = 10; + while (i - 1 >= 0 && c[i - 1] >= '0' && c[i - 1] <= '9') { + freq += p * (c[--i] - '0'); + p *= 10; + } + } else if (c[i] == ')') { + stack[top++] = multiplier; + multiplier *= Math.max(freq, 1); + freq = 0; + } else { + multiplier = stack[--top]; + } + } + List keys = new ArrayList<>(map.keySet()); + Collections.sort(keys); + StringBuilder sb = new StringBuilder(); + for (String key : keys) { + sb.append(key); + int f = map.get(key); + if (f > 1) sb.append(f); + } + return sb.toString(); + } +} ``` #### C++ diff --git a/solution/0700-0799/0726.Number of Atoms/Solution.java b/solution/0700-0799/0726.Number of Atoms/Solution.java new file mode 100644 index 0000000000000..4a2cabc65937b --- /dev/null +++ b/solution/0700-0799/0726.Number of Atoms/Solution.java @@ -0,0 +1,43 @@ +class Solution { + public String countOfAtoms(String formula) { + Map map = new HashMap<>(); + int[] stack = new int[1000]; + int top = 0, multiplier = 1, freq = 0; + char[] c = formula.toCharArray(); + for (int i = c.length - 1; i >= 0; i--) { + if (c[i] >= 'a' && c[i] <= 'z') { + int end = i--; + while (i >= 0 && c[i] >= 'a' && c[i] <= 'z') i--; + String key = new String(c, i, end - i + 1); + map.put(key, map.getOrDefault(key, 0) + Math.max(freq, 1) * multiplier); + freq = 0; + } else if (c[i] >= 'A' && c[i] <= 'Z') { + String key = new String(c, i, 1); + map.put(key, map.getOrDefault(key, 0) + Math.max(freq, 1) * multiplier); + freq = 0; + } else if (c[i] >= '0' && c[i] <= '9') { + freq = c[i] - '0'; + int p = 10; + while (i - 1 >= 0 && c[i - 1] >= '0' && c[i - 1] <= '9') { + freq += p * (c[--i] - '0'); + p *= 10; + } + } else if (c[i] == ')') { + stack[top++] = multiplier; + multiplier *= Math.max(freq, 1); + freq = 0; + } else { + multiplier = stack[--top]; + } + } + List keys = new ArrayList<>(map.keySet()); + Collections.sort(keys); + StringBuilder sb = new StringBuilder(); + for (String key : keys) { + sb.append(key); + int f = map.get(key); + if (f > 1) sb.append(f); + } + return sb.toString(); + } +} From 6966d28a99fdf04ababd1fcdc37a65b692ddebfa Mon Sep 17 00:00:00 2001 From: Libin YANG Date: Sun, 14 Jul 2024 20:21:52 +0800 Subject: [PATCH 3/3] feat: add weekly contest 406 (#3272) --- .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../3100-3199/3187.Peaks in Array/README.md | 2 + .../3187.Peaks in Array/README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 2 + .../README_EN.md | 2 + .../README.md | 163 ++++++++++++ .../README_EN.md | 161 ++++++++++++ .../Solution.cpp | 15 ++ .../Solution.go | 12 + .../Solution.java | 15 ++ .../Solution.py | 6 + .../Solution.ts | 14 ++ .../README.md | 238 ++++++++++++++++++ .../README_EN.md | 236 +++++++++++++++++ .../Solution.cpp | 25 ++ .../Solution.go | 22 ++ .../Solution.java | 27 ++ .../Solution.py | 17 ++ .../Solution.ts | 24 ++ .../images/linkedlistexample0.png | Bin 0 -> 5585 bytes .../images/linkedlistexample1.png | Bin 0 -> 5787 bytes .../images/linkedlistexample2.png | Bin 0 -> 3322 bytes .../README.md | 233 +++++++++++++++++ .../README_EN.md | 231 +++++++++++++++++ .../Solution.cpp | 20 ++ .../Solution.go | 18 ++ .../Solution.java | 19 ++ .../Solution.py | 16 ++ .../Solution.ts | 19 ++ .../images/ezgifcom-animated-gif-maker-1.gif | Bin 0 -> 19367 bytes .../README.md | 233 +++++++++++++++++ .../README_EN.md | 231 +++++++++++++++++ .../Solution.cpp | 20 ++ .../Solution.go | 18 ++ .../Solution.java | 19 ++ .../Solution.py | 16 ++ .../Solution.ts | 19 ++ .../images/ezgifcom-animated-gif-maker-1.gif | Bin 0 -> 19367 bytes solution/CONTEST_README.md | 7 + solution/CONTEST_README_EN.md | 7 + solution/README.md | 4 + solution/README_EN.md | 4 + solution/contest.json | 2 +- 70 files changed, 2174 insertions(+), 1 deletion(-) create mode 100644 solution/3200-3299/3216.Lexicographically Smallest String After a Swap/README.md create mode 100644 solution/3200-3299/3216.Lexicographically Smallest String After a Swap/README_EN.md create mode 100644 solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.cpp create mode 100644 solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.go create mode 100644 solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.java create mode 100644 solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.py create mode 100644 solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.ts create mode 100644 solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/README.md create mode 100644 solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/README_EN.md create mode 100644 solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.cpp create mode 100644 solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.go create mode 100644 solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.java create mode 100644 solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.py create mode 100644 solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.ts create mode 100644 solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/images/linkedlistexample0.png create mode 100644 solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/images/linkedlistexample1.png create mode 100644 solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/images/linkedlistexample2.png create mode 100644 solution/3200-3299/3218.Minimum Cost for Cutting Cake I/README.md create mode 100644 solution/3200-3299/3218.Minimum Cost for Cutting Cake I/README_EN.md create mode 100644 solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.cpp create mode 100644 solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.go create mode 100644 solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.java create mode 100644 solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.py create mode 100644 solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.ts create mode 100644 solution/3200-3299/3218.Minimum Cost for Cutting Cake I/images/ezgifcom-animated-gif-maker-1.gif create mode 100644 solution/3200-3299/3219.Minimum Cost for Cutting Cake II/README.md create mode 100644 solution/3200-3299/3219.Minimum Cost for Cutting Cake II/README_EN.md create mode 100644 solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.cpp create mode 100644 solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.go create mode 100644 solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.java create mode 100644 solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.py create mode 100644 solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.ts create mode 100644 solution/3200-3299/3219.Minimum Cost for Cutting Cake II/images/ezgifcom-animated-gif-maker-1.gif diff --git a/solution/3100-3199/3184.Count Pairs That Form a Complete Day I/README.md b/solution/3100-3199/3184.Count Pairs That Form a Complete Day I/README.md index c111e5a4b60e5..ce80cd4013523 100644 --- a/solution/3100-3199/3184.Count Pairs That Form a Complete Day I/README.md +++ b/solution/3100-3199/3184.Count Pairs That Form a Complete Day I/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 简单 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README.md +rating: 1149 +source: 第 402 场周赛 Q1 tags: - 数组 - 哈希表 diff --git a/solution/3100-3199/3184.Count Pairs That Form a Complete Day I/README_EN.md b/solution/3100-3199/3184.Count Pairs That Form a Complete Day I/README_EN.md index 7637e71618eab..ea32cc1e5aa58 100644 --- a/solution/3100-3199/3184.Count Pairs That Form a Complete Day I/README_EN.md +++ b/solution/3100-3199/3184.Count Pairs That Form a Complete Day I/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Easy edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README_EN.md +rating: 1149 +source: Weekly Contest 402 Q1 tags: - Array - Hash Table diff --git a/solution/3100-3199/3185.Count Pairs That Form a Complete Day II/README.md b/solution/3100-3199/3185.Count Pairs That Form a Complete Day II/README.md index 9435a47163647..7298a0f76cc48 100644 --- a/solution/3100-3199/3185.Count Pairs That Form a Complete Day II/README.md +++ b/solution/3100-3199/3185.Count Pairs That Form a Complete Day II/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 中等 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README.md +rating: 1385 +source: 第 402 场周赛 Q2 tags: - 数组 - 哈希表 diff --git a/solution/3100-3199/3185.Count Pairs That Form a Complete Day II/README_EN.md b/solution/3100-3199/3185.Count Pairs That Form a Complete Day II/README_EN.md index f71fad7669f2c..7d25568c84c05 100644 --- a/solution/3100-3199/3185.Count Pairs That Form a Complete Day II/README_EN.md +++ b/solution/3100-3199/3185.Count Pairs That Form a Complete Day II/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Medium edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README_EN.md +rating: 1385 +source: Weekly Contest 402 Q2 tags: - Array - Hash Table diff --git a/solution/3100-3199/3186.Maximum Total Damage With Spell Casting/README.md b/solution/3100-3199/3186.Maximum Total Damage With Spell Casting/README.md index b539d6b97083b..1703ebb823f69 100644 --- a/solution/3100-3199/3186.Maximum Total Damage With Spell Casting/README.md +++ b/solution/3100-3199/3186.Maximum Total Damage With Spell Casting/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 中等 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README.md +rating: 1840 +source: 第 402 场周赛 Q3 tags: - 数组 - 哈希表 diff --git a/solution/3100-3199/3186.Maximum Total Damage With Spell Casting/README_EN.md b/solution/3100-3199/3186.Maximum Total Damage With Spell Casting/README_EN.md index 4491af4e9a56c..5dd33b6f6c8ec 100644 --- a/solution/3100-3199/3186.Maximum Total Damage With Spell Casting/README_EN.md +++ b/solution/3100-3199/3186.Maximum Total Damage With Spell Casting/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Medium edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README_EN.md +rating: 1840 +source: Weekly Contest 402 Q3 tags: - Array - Hash Table diff --git a/solution/3100-3199/3187.Peaks in Array/README.md b/solution/3100-3199/3187.Peaks in Array/README.md index 761d9c0555194..0718b41932009 100644 --- a/solution/3100-3199/3187.Peaks in Array/README.md +++ b/solution/3100-3199/3187.Peaks in Array/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 困难 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3187.Peaks%20in%20Array/README.md +rating: 2154 +source: 第 402 场周赛 Q4 tags: - 树状数组 - 线段树 diff --git a/solution/3100-3199/3187.Peaks in Array/README_EN.md b/solution/3100-3199/3187.Peaks in Array/README_EN.md index eadb9d60bf3e7..93986448235fd 100644 --- a/solution/3100-3199/3187.Peaks in Array/README_EN.md +++ b/solution/3100-3199/3187.Peaks in Array/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Hard edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3187.Peaks%20in%20Array/README_EN.md +rating: 2154 +source: Weekly Contest 402 Q4 tags: - Binary Indexed Tree - Segment Tree diff --git a/solution/3100-3199/3190.Find Minimum Operations to Make All Elements Divisible by Three/README.md b/solution/3100-3199/3190.Find Minimum Operations to Make All Elements Divisible by Three/README.md index a0f8fd3a4492c..f0d4d812eff64 100644 --- a/solution/3100-3199/3190.Find Minimum Operations to Make All Elements Divisible by Three/README.md +++ b/solution/3100-3199/3190.Find Minimum Operations to Make All Elements Divisible by Three/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 简单 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3190.Find%20Minimum%20Operations%20to%20Make%20All%20Elements%20Divisible%20by%20Three/README.md +rating: 1139 +source: 第 133 场双周赛 Q1 tags: - 数组 - 数学 diff --git a/solution/3100-3199/3190.Find Minimum Operations to Make All Elements Divisible by Three/README_EN.md b/solution/3100-3199/3190.Find Minimum Operations to Make All Elements Divisible by Three/README_EN.md index 2070d7a636b04..200be668ee70a 100644 --- a/solution/3100-3199/3190.Find Minimum Operations to Make All Elements Divisible by Three/README_EN.md +++ b/solution/3100-3199/3190.Find Minimum Operations to Make All Elements Divisible by Three/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Easy edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3190.Find%20Minimum%20Operations%20to%20Make%20All%20Elements%20Divisible%20by%20Three/README_EN.md +rating: 1139 +source: Biweekly Contest 133 Q1 tags: - Array - Math diff --git a/solution/3100-3199/3191.Minimum Operations to Make Binary Array Elements Equal to One I/README.md b/solution/3100-3199/3191.Minimum Operations to Make Binary Array Elements Equal to One I/README.md index 649c317d41b09..aaf96006e839f 100644 --- a/solution/3100-3199/3191.Minimum Operations to Make Binary Array Elements Equal to One I/README.md +++ b/solution/3100-3199/3191.Minimum Operations to Make Binary Array Elements Equal to One I/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 中等 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3191.Minimum%20Operations%20to%20Make%20Binary%20Array%20Elements%20Equal%20to%20One%20I/README.md +rating: 1311 +source: 第 133 场双周赛 Q2 tags: - 位运算 - 队列 diff --git a/solution/3100-3199/3191.Minimum Operations to Make Binary Array Elements Equal to One I/README_EN.md b/solution/3100-3199/3191.Minimum Operations to Make Binary Array Elements Equal to One I/README_EN.md index 5e883bbb0f06f..3aba89da6e116 100644 --- a/solution/3100-3199/3191.Minimum Operations to Make Binary Array Elements Equal to One I/README_EN.md +++ b/solution/3100-3199/3191.Minimum Operations to Make Binary Array Elements Equal to One I/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Medium edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3191.Minimum%20Operations%20to%20Make%20Binary%20Array%20Elements%20Equal%20to%20One%20I/README_EN.md +rating: 1311 +source: Biweekly Contest 133 Q2 tags: - Bit Manipulation - Queue diff --git a/solution/3100-3199/3192.Minimum Operations to Make Binary Array Elements Equal to One II/README.md b/solution/3100-3199/3192.Minimum Operations to Make Binary Array Elements Equal to One II/README.md index db4a7f96d87e3..42b9bff2e2266 100644 --- a/solution/3100-3199/3192.Minimum Operations to Make Binary Array Elements Equal to One II/README.md +++ b/solution/3100-3199/3192.Minimum Operations to Make Binary Array Elements Equal to One II/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 中等 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3192.Minimum%20Operations%20to%20Make%20Binary%20Array%20Elements%20Equal%20to%20One%20II/README.md +rating: 1432 +source: 第 133 场双周赛 Q3 tags: - 贪心 - 数组 diff --git a/solution/3100-3199/3192.Minimum Operations to Make Binary Array Elements Equal to One II/README_EN.md b/solution/3100-3199/3192.Minimum Operations to Make Binary Array Elements Equal to One II/README_EN.md index d688ec1879a5d..b7cb922014b0e 100644 --- a/solution/3100-3199/3192.Minimum Operations to Make Binary Array Elements Equal to One II/README_EN.md +++ b/solution/3100-3199/3192.Minimum Operations to Make Binary Array Elements Equal to One II/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Medium edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3192.Minimum%20Operations%20to%20Make%20Binary%20Array%20Elements%20Equal%20to%20One%20II/README_EN.md +rating: 1432 +source: Biweekly Contest 133 Q3 tags: - Greedy - Array diff --git a/solution/3100-3199/3193.Count the Number of Inversions/README.md b/solution/3100-3199/3193.Count the Number of Inversions/README.md index facd193e0f202..94adf2ad6f097 100644 --- a/solution/3100-3199/3193.Count the Number of Inversions/README.md +++ b/solution/3100-3199/3193.Count the Number of Inversions/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 困难 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3193.Count%20the%20Number%20of%20Inversions/README.md +rating: 2266 +source: 第 133 场双周赛 Q4 tags: - 数组 - 动态规划 diff --git a/solution/3100-3199/3193.Count the Number of Inversions/README_EN.md b/solution/3100-3199/3193.Count the Number of Inversions/README_EN.md index 89739bbfbe15d..ca4c899e1d34e 100644 --- a/solution/3100-3199/3193.Count the Number of Inversions/README_EN.md +++ b/solution/3100-3199/3193.Count the Number of Inversions/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Hard edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3193.Count%20the%20Number%20of%20Inversions/README_EN.md +rating: 2266 +source: Biweekly Contest 133 Q4 tags: - Array - Dynamic Programming diff --git a/solution/3100-3199/3194.Minimum Average of Smallest and Largest Elements/README.md b/solution/3100-3199/3194.Minimum Average of Smallest and Largest Elements/README.md index b013c5378d84d..30bde6ae8b2fe 100644 --- a/solution/3100-3199/3194.Minimum Average of Smallest and Largest Elements/README.md +++ b/solution/3100-3199/3194.Minimum Average of Smallest and Largest Elements/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 简单 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3194.Minimum%20Average%20of%20Smallest%20and%20Largest%20Elements/README.md +rating: 1194 +source: 第 403 场周赛 Q1 tags: - 数组 - 双指针 diff --git a/solution/3100-3199/3194.Minimum Average of Smallest and Largest Elements/README_EN.md b/solution/3100-3199/3194.Minimum Average of Smallest and Largest Elements/README_EN.md index 80e412dd5c12f..eed9d1aaf71e1 100644 --- a/solution/3100-3199/3194.Minimum Average of Smallest and Largest Elements/README_EN.md +++ b/solution/3100-3199/3194.Minimum Average of Smallest and Largest Elements/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Easy edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3194.Minimum%20Average%20of%20Smallest%20and%20Largest%20Elements/README_EN.md +rating: 1194 +source: Weekly Contest 403 Q1 tags: - Array - Two Pointers diff --git a/solution/3100-3199/3195.Find the Minimum Area to Cover All Ones I/README.md b/solution/3100-3199/3195.Find the Minimum Area to Cover All Ones I/README.md index 9aabb18bdbddc..20653b5e553e5 100644 --- a/solution/3100-3199/3195.Find the Minimum Area to Cover All Ones I/README.md +++ b/solution/3100-3199/3195.Find the Minimum Area to Cover All Ones I/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 中等 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3195.Find%20the%20Minimum%20Area%20to%20Cover%20All%20Ones%20I/README.md +rating: 1348 +source: 第 403 场周赛 Q2 tags: - 数组 - 矩阵 diff --git a/solution/3100-3199/3195.Find the Minimum Area to Cover All Ones I/README_EN.md b/solution/3100-3199/3195.Find the Minimum Area to Cover All Ones I/README_EN.md index dc73bfd047952..05fe44572fdad 100644 --- a/solution/3100-3199/3195.Find the Minimum Area to Cover All Ones I/README_EN.md +++ b/solution/3100-3199/3195.Find the Minimum Area to Cover All Ones I/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Medium edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3195.Find%20the%20Minimum%20Area%20to%20Cover%20All%20Ones%20I/README_EN.md +rating: 1348 +source: Weekly Contest 403 Q2 tags: - Array - Matrix diff --git a/solution/3100-3199/3196.Maximize Total Cost of Alternating Subarrays/README.md b/solution/3100-3199/3196.Maximize Total Cost of Alternating Subarrays/README.md index 70c2367cf694b..7796704108b56 100644 --- a/solution/3100-3199/3196.Maximize Total Cost of Alternating Subarrays/README.md +++ b/solution/3100-3199/3196.Maximize Total Cost of Alternating Subarrays/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 中等 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3196.Maximize%20Total%20Cost%20of%20Alternating%20Subarrays/README.md +rating: 1846 +source: 第 403 场周赛 Q3 tags: - 数组 - 动态规划 diff --git a/solution/3100-3199/3196.Maximize Total Cost of Alternating Subarrays/README_EN.md b/solution/3100-3199/3196.Maximize Total Cost of Alternating Subarrays/README_EN.md index 9c71740b95a02..824bb8ef8043b 100644 --- a/solution/3100-3199/3196.Maximize Total Cost of Alternating Subarrays/README_EN.md +++ b/solution/3100-3199/3196.Maximize Total Cost of Alternating Subarrays/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Medium edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3196.Maximize%20Total%20Cost%20of%20Alternating%20Subarrays/README_EN.md +rating: 1846 +source: Weekly Contest 403 Q3 tags: - Array - Dynamic Programming diff --git a/solution/3100-3199/3197.Find the Minimum Area to Cover All Ones II/README.md b/solution/3100-3199/3197.Find the Minimum Area to Cover All Ones II/README.md index 74416885c359f..ab5fbc4777655 100644 --- a/solution/3100-3199/3197.Find the Minimum Area to Cover All Ones II/README.md +++ b/solution/3100-3199/3197.Find the Minimum Area to Cover All Ones II/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 困难 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3197.Find%20the%20Minimum%20Area%20to%20Cover%20All%20Ones%20II/README.md +rating: 2540 +source: 第 403 场周赛 Q4 tags: - 数组 - 枚举 diff --git a/solution/3100-3199/3197.Find the Minimum Area to Cover All Ones II/README_EN.md b/solution/3100-3199/3197.Find the Minimum Area to Cover All Ones II/README_EN.md index 90a5703fc1600..016dc22bcda93 100644 --- a/solution/3100-3199/3197.Find the Minimum Area to Cover All Ones II/README_EN.md +++ b/solution/3100-3199/3197.Find the Minimum Area to Cover All Ones II/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Hard edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3197.Find%20the%20Minimum%20Area%20to%20Cover%20All%20Ones%20II/README_EN.md +rating: 2540 +source: Weekly Contest 403 Q4 tags: - Array - Enumeration diff --git a/solution/3200-3299/3200.Maximum Height of a Triangle/README.md b/solution/3200-3299/3200.Maximum Height of a Triangle/README.md index a2d75a955a96d..539e1a35d13cd 100644 --- a/solution/3200-3299/3200.Maximum Height of a Triangle/README.md +++ b/solution/3200-3299/3200.Maximum Height of a Triangle/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 简单 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3200.Maximum%20Height%20of%20a%20Triangle/README.md +rating: 1451 +source: 第 404 场周赛 Q1 tags: - 数组 - 枚举 diff --git a/solution/3200-3299/3200.Maximum Height of a Triangle/README_EN.md b/solution/3200-3299/3200.Maximum Height of a Triangle/README_EN.md index de3101a17171a..4ab6bea1319b6 100644 --- a/solution/3200-3299/3200.Maximum Height of a Triangle/README_EN.md +++ b/solution/3200-3299/3200.Maximum Height of a Triangle/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Easy edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3200.Maximum%20Height%20of%20a%20Triangle/README_EN.md +rating: 1451 +source: Weekly Contest 404 Q1 tags: - Array - Enumeration diff --git a/solution/3200-3299/3201.Find the Maximum Length of Valid Subsequence I/README.md b/solution/3200-3299/3201.Find the Maximum Length of Valid Subsequence I/README.md index 1cadd23dd13e2..16c45d92dee36 100644 --- a/solution/3200-3299/3201.Find the Maximum Length of Valid Subsequence I/README.md +++ b/solution/3200-3299/3201.Find the Maximum Length of Valid Subsequence I/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 中等 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3201.Find%20the%20Maximum%20Length%20of%20Valid%20Subsequence%20I/README.md +rating: 1663 +source: 第 404 场周赛 Q2 tags: - 数组 - 动态规划 diff --git a/solution/3200-3299/3201.Find the Maximum Length of Valid Subsequence I/README_EN.md b/solution/3200-3299/3201.Find the Maximum Length of Valid Subsequence I/README_EN.md index 64aa506195bdf..5467bc82d0318 100644 --- a/solution/3200-3299/3201.Find the Maximum Length of Valid Subsequence I/README_EN.md +++ b/solution/3200-3299/3201.Find the Maximum Length of Valid Subsequence I/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Medium edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3201.Find%20the%20Maximum%20Length%20of%20Valid%20Subsequence%20I/README_EN.md +rating: 1663 +source: Weekly Contest 404 Q2 tags: - Array - Dynamic Programming diff --git a/solution/3200-3299/3202.Find the Maximum Length of Valid Subsequence II/README.md b/solution/3200-3299/3202.Find the Maximum Length of Valid Subsequence II/README.md index 6b6d8c5488a09..08c640f048251 100644 --- a/solution/3200-3299/3202.Find the Maximum Length of Valid Subsequence II/README.md +++ b/solution/3200-3299/3202.Find the Maximum Length of Valid Subsequence II/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 中等 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3202.Find%20the%20Maximum%20Length%20of%20Valid%20Subsequence%20II/README.md +rating: 1973 +source: 第 404 场周赛 Q3 tags: - 数组 - 动态规划 diff --git a/solution/3200-3299/3202.Find the Maximum Length of Valid Subsequence II/README_EN.md b/solution/3200-3299/3202.Find the Maximum Length of Valid Subsequence II/README_EN.md index 74cad2e6c6e8c..13f63d3c7700b 100644 --- a/solution/3200-3299/3202.Find the Maximum Length of Valid Subsequence II/README_EN.md +++ b/solution/3200-3299/3202.Find the Maximum Length of Valid Subsequence II/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Medium edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3202.Find%20the%20Maximum%20Length%20of%20Valid%20Subsequence%20II/README_EN.md +rating: 1973 +source: Weekly Contest 404 Q3 tags: - Array - Dynamic Programming diff --git a/solution/3200-3299/3203.Find Minimum Diameter After Merging Two Trees/README.md b/solution/3200-3299/3203.Find Minimum Diameter After Merging Two Trees/README.md index 6d9a65a21b599..39c06608c846d 100644 --- a/solution/3200-3299/3203.Find Minimum Diameter After Merging Two Trees/README.md +++ b/solution/3200-3299/3203.Find Minimum Diameter After Merging Two Trees/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 困难 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3203.Find%20Minimum%20Diameter%20After%20Merging%20Two%20Trees/README.md +rating: 2266 +source: 第 404 场周赛 Q4 tags: - 树 - 深度优先搜索 diff --git a/solution/3200-3299/3203.Find Minimum Diameter After Merging Two Trees/README_EN.md b/solution/3200-3299/3203.Find Minimum Diameter After Merging Two Trees/README_EN.md index 9eae9c17028fd..8664c3b7cd422 100644 --- a/solution/3200-3299/3203.Find Minimum Diameter After Merging Two Trees/README_EN.md +++ b/solution/3200-3299/3203.Find Minimum Diameter After Merging Two Trees/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Hard edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3203.Find%20Minimum%20Diameter%20After%20Merging%20Two%20Trees/README_EN.md +rating: 2266 +source: Weekly Contest 404 Q4 tags: - Tree - Depth-First Search diff --git a/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/README.md b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/README.md new file mode 100644 index 0000000000000..ab86433e33391 --- /dev/null +++ b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/README.md @@ -0,0 +1,163 @@ +--- +comments: true +difficulty: 简单 +edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3216.Lexicographically%20Smallest%20String%20After%20a%20Swap/README.md +--- + + + +# [3216. 交换后字典序最小的字符串](https://leetcode.cn/problems/lexicographically-smallest-string-after-a-swap) + +[English Version](/solution/3200-3299/3216.Lexicographically%20Smallest%20String%20After%20a%20Swap/README_EN.md) + +## 题目描述 + + + +

给你一个仅由数字组成的字符串 s，在最多交换一次 相邻 且具有相同 奇偶性 的数字后，返回可以得到的字典序最小的字符串。

+ +

如果两个数字都是奇数或都是偶数，则它们具有相同的奇偶性。例如，5 和 9、2 和 4 奇偶性相同，而 6 和 9 奇偶性不同。

+ +

 

+ +

示例 1：

+ +
+

输入： s = "45320"

+ +

输出： "43520"

+ +

解释：

+ +

s[1] == '5' 和 s[2] == '3' 都具有相同的奇偶性，交换它们可以得到字典序最小的字符串。

+
+ +

示例 2：

+ +
+

输入： s = "001"

+ +

输出： "001"

+ +

解释：

+ +

无需进行交换，因为 s 已经是字典序最小的。

+
+ +

 

+ +

提示：

+ +
    +
  • 2 <= s.length <= 100
    • +
  • s 仅由数字组成。
    • +
+ + + +## 解法 + + + +### 方法一：贪心 + 模拟 + +我们可以从左到右遍历字符串 $\textit{s}$，对于每一对相邻的数字，如果它们具有相同的奇偶性且前一个数字大于后一个数字，那么我们就交换这两个数字，使得字符串 $\textit{s}$ 的字典序变小，然后返回交换后的字符串。 + +遍历结束后，如果没有找到可以交换的数字对，说明字符串 $\textit{s}$ 已经是字典序最小的，直接返回即可。 + +时间复杂度 $O(n)$，空间复杂度 $O(n)$。其中 $n$ 为字符串 $\textit{s}$ 的长度。 + + + +#### Python3 + +```python +class Solution: + def getSmallestString(self, s: str) -> str: + for i, (a, b) in enumerate(pairwise(map(ord, s))): + if (a + b) % 2 == 0 and a > b: + return s[:i] + s[i + 1] + s[i] + s[i + 2 :] + return s +``` + +#### Java + +```java +class Solution { + public String getSmallestString(String s) { + char[] cs = s.toCharArray(); + int n = cs.length; + for (int i = 1; i < n; ++i) { + char a = cs[i - 1], b = cs[i]; + if (a > b && a % 2 == b % 2) { + cs[i] = a; + cs[i - 1] = b; + return new String(cs); + } + } + return s; + } +} +``` + +#### C++ + +```cpp +class Solution { +public: + string getSmallestString(string s) { + int n = s.length(); + for (int i = 1; i < n; ++i) { + char a = s[i - 1], b = s[i]; + if (a > b && a % 2 == b % 2) { + s[i - 1] = b; + s[i] = a; + break; + } + } + return s; + } +}; +``` + +#### Go + +```go +func getSmallestString(s string) string { + cs := []byte(s) + n := len(cs) + for i := 1; i < n; i++ { + a, b := cs[i-1], cs[i] + if a > b && a%2 == b%2 { + cs[i-1], cs[i] = b, a + return string(cs) + } + } + return s +} +``` + +#### TypeScript + +```ts +function getSmallestString(s: string): string { + const n = s.length; + const cs: string[] = s.split(''); + for (let i = 1; i < n; ++i) { + const a = cs[i - 1]; + const b = cs[i]; + if (a > b && +a % 2 === +b % 2) { + cs[i - 1] = b; + cs[i] = a; + return cs.join(''); + } + } + return s; +} +``` + + + + + + diff --git a/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/README_EN.md b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/README_EN.md new file mode 100644 index 0000000000000..a8431f1c1d778 --- /dev/null +++ b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/README_EN.md @@ -0,0 +1,161 @@ +--- +comments: true +difficulty: Easy +edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3216.Lexicographically%20Smallest%20String%20After%20a%20Swap/README_EN.md +--- + + + +# [3216. Lexicographically Smallest String After a Swap](https://leetcode.com/problems/lexicographically-smallest-string-after-a-swap) + +[中文文档](/solution/3200-3299/3216.Lexicographically%20Smallest%20String%20After%20a%20Swap/README.md) + +## Description + + + +

Given a string s containing only digits, return the lexicographically smallest string that can be obtained after swapping adjacent digits in s with the same parity at most once.

+ +

Digits have the same parity if both are odd or both are even. For example, 5 and 9, as well as 2 and 4, have the same parity, while 6 and 9 do not.

+ +

 

+

Example 1:

+ +
+

Input: s = "45320"

+ +

Output: "43520"

+ +

Explanation:

+ +

s[1] == '5' and s[2] == '3' both have the same parity, and swapping them results in the lexicographically smallest string.

+
+ +

Example 2:

+ +
+

Input: s = "001"

+ +

Output: "001"

+ +

Explanation:

+ +

There is no need to perform a swap because s is already the lexicographically smallest.

+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= s.length <= 100
    • +
  • s consists only of digits.
    • +
+ + + +## Solutions + + + +### Solution 1: Greedy + Simulation + +We can traverse the string $\textit{s}$ from left to right. For each pair of adjacent digits, if they have the same parity and the previous digit is greater than the next digit, then we swap these two digits to make the lexicographical order of the string $\textit{s}$ smaller, and then return the swapped string. + +After the traversal, if no swappable pair of digits is found, it means the string $\textit{s}$ is already in its smallest lexicographical order, and we can return it directly. + +The time complexity is $O(n)$, and the space complexity is $O(n)$, where $n$ is the length of the string $\textit{s}$. + + + +#### Python3 + +```python +class Solution: + def getSmallestString(self, s: str) -> str: + for i, (a, b) in enumerate(pairwise(map(ord, s))): + if (a + b) % 2 == 0 and a > b: + return s[:i] + s[i + 1] + s[i] + s[i + 2 :] + return s +``` + +#### Java + +```java +class Solution { + public String getSmallestString(String s) { + char[] cs = s.toCharArray(); + int n = cs.length; + for (int i = 1; i < n; ++i) { + char a = cs[i - 1], b = cs[i]; + if (a > b && a % 2 == b % 2) { + cs[i] = a; + cs[i - 1] = b; + return new String(cs); + } + } + return s; + } +} +``` + +#### C++ + +```cpp +class Solution { +public: + string getSmallestString(string s) { + int n = s.length(); + for (int i = 1; i < n; ++i) { + char a = s[i - 1], b = s[i]; + if (a > b && a % 2 == b % 2) { + s[i - 1] = b; + s[i] = a; + break; + } + } + return s; + } +}; +``` + +#### Go + +```go +func getSmallestString(s string) string { + cs := []byte(s) + n := len(cs) + for i := 1; i < n; i++ { + a, b := cs[i-1], cs[i] + if a > b && a%2 == b%2 { + cs[i-1], cs[i] = b, a + return string(cs) + } + } + return s +} +``` + +#### TypeScript + +```ts +function getSmallestString(s: string): string { + const n = s.length; + const cs: string[] = s.split(''); + for (let i = 1; i < n; ++i) { + const a = cs[i - 1]; + const b = cs[i]; + if (a > b && +a % 2 === +b % 2) { + cs[i - 1] = b; + cs[i] = a; + return cs.join(''); + } + } + return s; +} +``` + + + + + + diff --git a/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.cpp b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.cpp new file mode 100644 index 0000000000000..398011a423db1 --- /dev/null +++ b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.cpp @@ -0,0 +1,15 @@ +class Solution { +public: + string getSmallestString(string s) { + int n = s.length(); + for (int i = 1; i < n; ++i) { + char a = s[i - 1], b = s[i]; + if (a > b && a % 2 == b % 2) { + s[i - 1] = b; + s[i] = a; + break; + } + } + return s; + } +}; \ No newline at end of file diff --git a/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.go b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.go new file mode 100644 index 0000000000000..49f0ae97226e0 --- /dev/null +++ b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.go @@ -0,0 +1,12 @@ +func getSmallestString(s string) string { + cs := []byte(s) + n := len(cs) + for i := 1; i < n; i++ { + a, b := cs[i-1], cs[i] + if a > b && a%2 == b%2 { + cs[i-1], cs[i] = b, a + return string(cs) + } + } + return s +} \ No newline at end of file diff --git a/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.java b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.java new file mode 100644 index 0000000000000..92c26f742abfe --- /dev/null +++ b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.java @@ -0,0 +1,15 @@ +class Solution { + public String getSmallestString(String s) { + char[] cs = s.toCharArray(); + int n = cs.length; + for (int i = 1; i < n; ++i) { + char a = cs[i - 1], b = cs[i]; + if (a > b && a % 2 == b % 2) { + cs[i] = a; + cs[i - 1] = b; + return new String(cs); + } + } + return s; + } +} \ No newline at end of file diff --git a/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.py b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.py new file mode 100644 index 0000000000000..9f75d824bc015 --- /dev/null +++ b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.py @@ -0,0 +1,6 @@ +class Solution: + def getSmallestString(self, s: str) -> str: + for i, (a, b) in enumerate(pairwise(map(ord, s))): + if (a + b) % 2 == 0 and a > b: + return s[:i] + s[i + 1] + s[i] + s[i + 2 :] + return s diff --git a/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.ts b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.ts new file mode 100644 index 0000000000000..c3d04e79b6800 --- /dev/null +++ b/solution/3200-3299/3216.Lexicographically Smallest String After a Swap/Solution.ts @@ -0,0 +1,14 @@ +function getSmallestString(s: string): string { + const n = s.length; + const cs: string[] = s.split(''); + for (let i = 1; i < n; ++i) { + const a = cs[i - 1]; + const b = cs[i]; + if (a > b && +a % 2 === +b % 2) { + cs[i - 1] = b; + cs[i] = a; + return cs.join(''); + } + } + return s; +} diff --git a/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/README.md b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/README.md new file mode 100644 index 0000000000000..9445d1edeb86e --- /dev/null +++ b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/README.md @@ -0,0 +1,238 @@ +--- +comments: true +difficulty: 中等 +edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3217.Delete%20Nodes%20From%20Linked%20List%20Present%20in%20Array/README.md +--- + + + +# [3217. 从链表中移除在数组中存在的节点](https://leetcode.cn/problems/delete-nodes-from-linked-list-present-in-array) + +[English Version](/solution/3200-3299/3217.Delete%20Nodes%20From%20Linked%20List%20Present%20in%20Array/README_EN.md) + +## 题目描述 + + + +

给你一个整数数组 nums 和一个链表的头节点 head。从链表中移除所有存在于 nums 中的节点后，返回修改后的链表的头节点。

+ +

 

+ +

示例 1：

+ +
+

输入： nums = [1,2,3], head = [1,2,3,4,5]

+ +

输出： [4,5]

+ +

解释：

+ +

+ +

移除数值为 1, 2 和 3 的节点。

+
+ +

示例 2：

+ +
+

输入： nums = [1], head = [1,2,1,2,1,2]

+ +

输出： [2,2,2]

+ +

解释：

+ +

+ +

移除数值为 1 的节点。

+
+ +

示例 3：

+ +
+

输入： nums = [5], head = [1,2,3,4]

+ +

输出： [1,2,3,4]

+ +

解释：

+ +

+ +

链表中不存在值为 5 的节点。

+
+ +

 

+ +

提示：

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 105
    • +
  • nums 中的所有元素都是唯一的。
    • +
  • 链表中的节点数在 [1, 105] 的范围内。
    • +
  • 1 <= Node.val <= 105
    • +
  • 输入保证链表中至少有一个值没有在 nums 中出现过。
    • +
+ + + +## 解法 + + + +### 方法一：哈希表 + +我们可以使用一个哈希表 $\textit{s}$ 来存储数组 $\textit{nums}$ 中的所有元素，然后定义一个虚拟节点 $\textit{dummy}$，将其指向链表的头节点 $\textit{head}$。 + +接下来，我们遍历从虚拟节点 $\textit{dummy}$ 开始的链表，如果当前节点的下一个节点的值在哈希表 $\textit{s}$ 中，我们就将当前节点的指针指向下下个节点，否则我们就将当前节点指针指向下一个节点。 + +最后，我们返回虚拟节点 $\textit{dummy}$ 的下一个节点。 + +时间复杂度 $O(n + m)$，空间复杂度 $O(n)$。其中 $n$ 为数组 $\textit{nums}$ 的长度，而 $m$ 为链表 $\textit{head}$ 的长度。 + + + +#### Python3 + +```python +# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def modifiedList( + self, nums: List[int], head: Optional[ListNode] + ) -> Optional[ListNode]: + s = set(nums) + pre = dummy = ListNode(next=head) + while pre.next: + if pre.next.val in s: + pre.next = pre.next.next + else: + pre = pre.next + return dummy.next +``` + +#### Java + +```java +/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode modifiedList(int[] nums, ListNode head) { + Set s = new HashSet<>(); + for (int x : nums) { + s.add(x); + } + ListNode dummy = new ListNode(0, head); + for (ListNode pre = dummy; pre.next != null;) { + if (s.contains(pre.next.val)) { + pre.next = pre.next.next; + } else { + pre = pre.next; + } + } + return dummy.next; + } +} +``` + +#### C++ + +```cpp +/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* modifiedList(vector& nums, ListNode* head) { + unordered_set s(nums.begin(), nums.end()); + ListNode* dummy = new ListNode(0, head); + for (ListNode* pre = dummy; pre->next;) { + if (s.count(pre->next->val)) { + pre->next = pre->next->next; + } else { + pre = pre->next; + } + } + return dummy->next; + } +}; +``` + +#### Go + +```go +/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func modifiedList(nums []int, head *ListNode) *ListNode { + s := map[int]bool{} + for _, x := range nums { + s[x] = true + } + dummy := &ListNode{Next: head} + for pre := dummy; pre.Next != nil; { + if s[pre.Next.Val] { + pre.Next = pre.Next.Next + } else { + pre = pre.Next + } + } + return dummy.Next +} +``` + +#### TypeScript + +```ts +/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function modifiedList(nums: number[], head: ListNode | null): ListNode | null { + const s: Set = new Set(nums); + const dummy = new ListNode(0, head); + for (let pre = dummy; pre.next; ) { + if (s.has(pre.next.val)) { + pre.next = pre.next.next; + } else { + pre = pre.next; + } + } + return dummy.next; +} +``` + + + + + + diff --git a/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/README_EN.md b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/README_EN.md new file mode 100644 index 0000000000000..147b3f8940c09 --- /dev/null +++ b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/README_EN.md @@ -0,0 +1,236 @@ +--- +comments: true +difficulty: Medium +edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3217.Delete%20Nodes%20From%20Linked%20List%20Present%20in%20Array/README_EN.md +--- + + + +# [3217. Delete Nodes From Linked List Present in Array](https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array) + +[中文文档](/solution/3200-3299/3217.Delete%20Nodes%20From%20Linked%20List%20Present%20in%20Array/README.md) + +## Description + + + +

You are given an array of integers nums and the head of a linked list. Return the head of the modified linked list after removing all nodes from the linked list that have a value that exists in nums.

+ +

 

+

Example 1:

+ +
+

Input: nums = [1,2,3], head = [1,2,3,4,5]

+ +

Output: [4,5]

+ +

Explanation:

+ +

+ +

Remove the nodes with values 1, 2, and 3.

+
+ +

Example 2:

+ +
+

Input: nums = [1], head = [1,2,1,2,1,2]

+ +

Output: [2,2,2]

+ +

Explanation:

+ +

+ +

Remove the nodes with value 1.

+
+ +

Example 3:

+ +
+

Input: nums = [5], head = [1,2,3,4]

+ +

Output: [1,2,3,4]

+ +

Explanation:

+ +

+ +

No node has value 5.

+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
    • +
  • 1 <= nums[i] <= 105
    • +
  • All elements in nums are unique.
    • +
  • The number of nodes in the given list is in the range [1, 105].
    • +
  • 1 <= Node.val <= 105
    • +
  • The input is generated such that there is at least one node in the linked list that has a value not present in nums.
    • +
+ + + +## Solutions + + + +### Solution 1: Hash Table + +We can use a hash table $\textit{s}$ to store all the elements in the array $\textit{nums}$. Then, we define a dummy node $\textit{dummy}$ and point it to the head node of the list $\textit{head}$. + +Next, we traverse the list starting from the dummy node $\textit{dummy}$. If the value of the next node of the current node is in the hash table $\textit{s}$, we make the current node point to the next next node; otherwise, we move the current node pointer to the next node. + +Finally, we return the next node of the dummy node $\textit{dummy}$. + +The time complexity is $O(n + m)$, and the space complexity is $O(n)$. Here, $n$ is the length of the array $\textit{nums}$, and $m$ is the length of the list $\textit{head}$. + + + +#### Python3 + +```python +# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def modifiedList( + self, nums: List[int], head: Optional[ListNode] + ) -> Optional[ListNode]: + s = set(nums) + pre = dummy = ListNode(next=head) + while pre.next: + if pre.next.val in s: + pre.next = pre.next.next + else: + pre = pre.next + return dummy.next +``` + +#### Java + +```java +/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode modifiedList(int[] nums, ListNode head) { + Set s = new HashSet<>(); + for (int x : nums) { + s.add(x); + } + ListNode dummy = new ListNode(0, head); + for (ListNode pre = dummy; pre.next != null;) { + if (s.contains(pre.next.val)) { + pre.next = pre.next.next; + } else { + pre = pre.next; + } + } + return dummy.next; + } +} +``` + +#### C++ + +```cpp +/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* modifiedList(vector& nums, ListNode* head) { + unordered_set s(nums.begin(), nums.end()); + ListNode* dummy = new ListNode(0, head); + for (ListNode* pre = dummy; pre->next;) { + if (s.count(pre->next->val)) { + pre->next = pre->next->next; + } else { + pre = pre->next; + } + } + return dummy->next; + } +}; +``` + +#### Go + +```go +/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func modifiedList(nums []int, head *ListNode) *ListNode { + s := map[int]bool{} + for _, x := range nums { + s[x] = true + } + dummy := &ListNode{Next: head} + for pre := dummy; pre.Next != nil; { + if s[pre.Next.Val] { + pre.Next = pre.Next.Next + } else { + pre = pre.Next + } + } + return dummy.Next +} +``` + +#### TypeScript + +```ts +/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function modifiedList(nums: number[], head: ListNode | null): ListNode | null { + const s: Set = new Set(nums); + const dummy = new ListNode(0, head); + for (let pre = dummy; pre.next; ) { + if (s.has(pre.next.val)) { + pre.next = pre.next.next; + } else { + pre = pre.next; + } + } + return dummy.next; +} +``` + + + + + + diff --git a/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.cpp b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.cpp new file mode 100644 index 0000000000000..41b9361edf0ba --- /dev/null +++ b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.cpp @@ -0,0 +1,25 @@ +/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* modifiedList(vector& nums, ListNode* head) { + unordered_set s(nums.begin(), nums.end()); + ListNode* dummy = new ListNode(0, head); + for (ListNode* pre = dummy; pre->next;) { + if (s.count(pre->next->val)) { + pre->next = pre->next->next; + } else { + pre = pre->next; + } + } + return dummy->next; + } +}; \ No newline at end of file diff --git a/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.go b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.go new file mode 100644 index 0000000000000..6e1e31d9e19c9 --- /dev/null +++ b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.go @@ -0,0 +1,22 @@ +/** + * Definition for singly-linked list. + * type ListNode struct { + * Val int + * Next *ListNode + * } + */ +func modifiedList(nums []int, head *ListNode) *ListNode { + s := map[int]bool{} + for _, x := range nums { + s[x] = true + } + dummy := &ListNode{Next: head} + for pre := dummy; pre.Next != nil; { + if s[pre.Next.Val] { + pre.Next = pre.Next.Next + } else { + pre = pre.Next + } + } + return dummy.Next +} \ No newline at end of file diff --git a/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.java b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.java new file mode 100644 index 0000000000000..a4754a75ceeae --- /dev/null +++ b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.java @@ -0,0 +1,27 @@ +/** + * Definition for singly-linked list. + * public class ListNode { + * int val; + * ListNode next; + * ListNode() {} + * ListNode(int val) { this.val = val; } + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } + * } + */ +class Solution { + public ListNode modifiedList(int[] nums, ListNode head) { + Set s = new HashSet<>(); + for (int x : nums) { + s.add(x); + } + ListNode dummy = new ListNode(0, head); + for (ListNode pre = dummy; pre.next != null;) { + if (s.contains(pre.next.val)) { + pre.next = pre.next.next; + } else { + pre = pre.next; + } + } + return dummy.next; + } +} \ No newline at end of file diff --git a/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.py b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.py new file mode 100644 index 0000000000000..82b67d3f6f4e1 --- /dev/null +++ b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.py @@ -0,0 +1,17 @@ +# Definition for singly-linked list. +# class ListNode: +# def __init__(self, val=0, next=None): +# self.val = val +# self.next = next +class Solution: + def modifiedList( + self, nums: List[int], head: Optional[ListNode] + ) -> Optional[ListNode]: + s = set(nums) + pre = dummy = ListNode(next=head) + while pre.next: + if pre.next.val in s: + pre.next = pre.next.next + else: + pre = pre.next + return dummy.next diff --git a/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.ts b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.ts new file mode 100644 index 0000000000000..4d499ab5049b6 --- /dev/null +++ b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/Solution.ts @@ -0,0 +1,24 @@ +/** + * Definition for singly-linked list. + * class ListNode { + * val: number + * next: ListNode | null + * constructor(val?: number, next?: ListNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.next = (next===undefined ? null : next) + * } + * } + */ + +function modifiedList(nums: number[], head: ListNode | null): ListNode | null { + const s: Set = new Set(nums); + const dummy = new ListNode(0, head); + for (let pre = dummy; pre.next; ) { + if (s.has(pre.next.val)) { + pre.next = pre.next.next; + } else { + pre = pre.next; + } + } + return dummy.next; +} diff --git a/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/images/linkedlistexample0.png b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/images/linkedlistexample0.png new file mode 100644 index 0000000000000000000000000000000000000000..959f64e61dd01fd253cbaade7d4e55352d295574 GIT binary patch literal 5585 zcmb7I2{@E(+oqBv`DB@Slk`!M%1{Z}s<$bVE!na?lARFMG)yyN_cN9(MP-Rp8pb|| z8A^skvNLvrWSJPtScm_a(fhsMfBgS(e8+zr&n(aJJlB0+*L`32b)M%Hal`PM(B6Z4 zd3bn)5V}`x^6>140{?sL*$sZP8SPZ?N8p~W<$WF=!2_HRZ`%NNgNH{v7;)v2DXN!| z>ZxyLQBm)yKNPRfd+w-8LURArjl1-u)t})n*QmAnd*cB{=ZUr;0}AGO8@j$MDEpOZ zu5zjBBlnzFPkqP-&muH>U-L(*1!+~8;^h_0^*?1vxEEjpCepUj&=(RFyk`6?(dk1l zOLbp0ms!$b9GVeM=>|Mfo)gc2zVQU0m106fIRA8^yqx?0*UkU^_UyGGs$kaus#bAk z&`D0!w69gwuK2CR^_hFEmo?5+w`gO$@|FqdOIW>)<+T)ToYtlmM!JR{-~j^ctgNkx zd3nv|xwq^Wetau_e%7UTakAa>YvPIX_BFdCRlQO;mQ~pN?~@B_X;s1~5p&p%mrB?n zzg9)*9&gX5<4C2!LR{g42%sdDNjn8_B2+fWOhH+nH?R@FxM*lxAfc&7rudc2FT0F3zpP}snqYO#anHhd-#sVa*EQV-3Q!h$%n_R&e)7Ke2MYNoH+7@;w z2eR#L`S;Eo3u0DQ?Qx^DyPch#=g*x>jPrM`?ya86Sjz?iAeZKA8bW;Lnx&?DEM3yY zH=3J0`)`-UsJOfxl{Pkwy|2;d?WQaZlnL}40sQe$wA z##&}}o$E2OxHlm}WF9h4^&*SaJ3}k>{MG*fxv|2$*kQS3iZS!W;zuOw4y>j7nSfdU%l6hBR?$vZ9=Hnv>aCQc}`W;?{n5b$&cBw|a`WmLnAaQS^^v zhA{n2IwVK$JFS;qL~cg-j=$FNW86UVY};X6n>C`@y``Skulh1T8+YO1P!GWIoISZ` zE&>jL6{WG!I|o*`&JpXXs(a#4XvIxG)oTiz3>tPB$F}=Uf3B1+)DJS z&|Hkf)?lSjf{+}~fVM^v>YqFNIQv=C&2S@^>l|FkFSN0*96-T33`t4+_H#1rK-Ovd z4zUCN3O9CAiZd3B#DrQbDpkbyaF&9a4b=AGA!I-{;Ku#Dy`DgnJ!Tb%hoK}(YXizvDsdqjYf(nG7 zMv?*pc^kid6KXp6@%>ew8=7Je@<;pw|G2i0LI;=BRKOZBp_7{erhkkrja?$i^*_|^ zK_!^>{}pu`8W~Oxf}r9IVK<*C4OaP#N*k@i_qQ^IPl69JR~%(Ia|A-LAN-dH%VMrB zE^@SwN@BuPIP;UBZW82#9`rl5pc6c_7vJHMGRspiI6d>d(Z4;5k3Vqo7I(vW^7_xp;K{c|Ba`%{1>)EGMZmlAXZeo*mqk@EFG+3jM$z@JLAeb98Wg086gge)NVh49`E~bpwcNOAX68htQd3qjuee6;q~#4GA;3ifMc2Kir`xYJ69#*GU;0mD za#d{o>89<%x$=fc{5C&7uQnRXOV#uFEU5bif-r#QAL{Y8Gb3g=NdKu`oY$sUKPut; zmpdjV4sYJPNnz9n(BG7g@MX2(vyMl}DKs)(u1P(ZagdMfj!+TLcqYL;jy16RKbi`| z!ge>a94<0%_RsCOISIchS{J+^$OwNcFSQPh1V;(|>Xb=(-|M z0DGpGVS)?DEI)y@-}QTFB9Umhz;mt0xL-_%9AN4fR{|EZQ4u`R$}oJB=UC}{Y?oB5 z9rP17+voIbZBxZ1Bz&LYc*Inx!muM|z|qt8YL8F8fCxaU zvy(HG{Dj_IO>82gxP%*kkJ zE;OADOjgo*&I#hK--1fzJTtucVczGnI1ACMREDc2_L9SBU397M`1R@8S>Y(i{6!0B zc=fw6rq}E!oQ2BJId~N?);}8OPsJ~yl<)u0@2kR8CM;R_K2b|5PnMVWij)SjX0I1} zScsZ1;B5!$I4r6%I9QBn{9>#6>pch-Od3F-a9%&8RF4lO< zL_lba&>R5=FaT{#1*xn|!(w(sAczzF+m#Xcl$*Qzyyg=~UV=U>{+ZHYMJrd3AEg@Z zu`z&(mwkq9qK^naU_Z@uoFW`8FqH9%ya>Zs0xVs&$O^2z z)iok;hyG8fEoNU11l(C2kV}GePL4D7`js5E=Xg=2wvTw?{M={Ztr?dA;7L{)7G0hOn89?cX~Fw$D;Fydd4jn%vptHnyDuvvZ0c8KdXmJgIIYXu)|zPiUi zOe&#AdY@*+8P!yzC@FYd0vN}1fhgp-vX9DzC_pK!^{Fy~xxyzBtrZs~D}1k;a&PsS zEbv6hIR~N`ZKh{qdx%&b!r34`0S5wk&yq>oB?L5hv*Y#t`8fXaMqt-JEo{ zhcJ%RI$W&;f)y9_Dk?6VJaua9)D{o-KwKn{!KCVW#0^DR!jZZpu%3Q>{_rXC*x@pzzi|7-i-RXmpB}%fvs(;C6@ndk3LI6j->6#1gzHJP7sh5> zu>XrlPiKm4_hT+ct6U<_L-3>w?)*0>i+dvuV{F8_9Xbg=>0k1Y#MqeywI{;wfc)zP%y# zrdT>Gr_1qa?Qhc)^6~{!Q|`g&*DGTa6Qg`tRD9ymD0UKzHUZQ01_eMnZRm}>A~HHhN z5)%_|Sz7*K`O)@xzlqogd4-NY zu_W_GV01WDL&CD;qyLtFK(h`Y#!vmzr{OQ~KBJ^``@;v0gzz~Nq!t-W&nO3@&T7Xe z9*?45C%1c8Z>Fd4(BVGihvuCq+lU`;;OR;Hma36-vDWyIm@r8C&>T)#QdQgr%8a6l z1@EE7JW`%bOebf}eTL>$fQ=wpu}k0lI891)z{~Uy5A4hc-0DD`1_skrK6b2fzBRq5 zXu+Zq+(S{k}Mu#i8~iB zo{GaQ7QjatjF{>j+?Ax}zpJVmd~2BM-koRL7|9}}y65)_q2ds*wiil~&00dp8R2{v zs=#oMwRcbGK&4vzwx)~Mg~LNZX>#&pF9G?CqiJFwe=N%|z*H>uOHipY6`N|dV`xw& zZDVe8Qv)wnaBt-DOKpsQc3(E@eJZHEP;qe~%035L>^drhMDzNti_AuTdA@w!cWnEl zXQ`>TJbhL$5N3+*P>hF@?=|3~jz!Vw>5tG3iHkfJ<#*@K4oP}{zg*cfCvfc)HyrrE z7Ekr)@wS~j_7{b{vb8EGdr>3tkUtEdp}R|`-+z2%l)({k`)<{9DUmJ=lrit%!P=zA zseI&IfFMx*6J95JHRHt5bF)@ARVZ|g=4I*uz0scIhg}01_sgJo}aBhuAe-dS}Q0h=t+$fA53}FSLR*DVj)2~$Er&f z+P~jFf6a1sn$w)ipPgI>`%~}0SOXyTOql|KQJCQ#2&`wRP8Mmutf=uJqc^5%^#w>n zY5O6k7rjIXIWavDSpPKWPuvivaLFyBfRh|g0~Q)E##*>B=V`b@(WkSj0zt1kx(wJ-C+YNp_>2d;AZlSk}#aen^O&3}Ahdz^q*Oq}@M VuVctZ8F`#x5pcsRd6#bo{WtI(`qBUZ literal 0 HcmV?d00001 diff --git a/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/images/linkedlistexample1.png b/solution/3200-3299/3217.Delete Nodes From Linked List Present in Array/images/linkedlistexample1.png new file mode 100644 index 0000000000000000000000000000000000000000..6946829c54999f8810438e3a11cc3e10d3ac6206 GIT binary patch literal 5787 zcmb7Ic|4SR)Spt3LN2m}8&{~9LS)y1M3gMoI=3ifUxzV66kSG5mU69Qmog^V2cyUu z8Db{OSjOJi8Ozw-hti$*zW4s|`V7xJkKc2C=XaLx`JNMg(?ExfRe%))0wRmommb6e-{OoQi021_iN@}AkdLtc7FGDkOMbBpyM}muU<0t>zPgt&^NI!d4J() zv4Vp3I+~x$EAcuPCOqgFir`Qj&M9Ye-ZY>~rQ|`bR%M3;yhu{WKX*FynP=YlKAT4w zOhU|Qmw7BNik{G#-*?&se&_^ts_T_`h}IMopNZmgGjx!S(rwZ#$Rn2I;hO-Z0+S4 z@|o`LZpyr$9U12n{nuX(o1FtR-_44C!M_>>Hga^StXr62xuYQ3Hz(2Qjiq7;N z>NVoqRFOj12OH;Goifo4_dGpnn`@qUif7(~Xt-(ZhTU*4kF9Un9^c$VeQBV2Ecp$> z;p*tjtSnt);3q#=g~%;2Mf{_sQJrH(pY@AKV$3#m0v1@ zZHRq(Y0(NPyzoU?<16ajJK6B?@PY)7n#YIVA=Z6!u~?3#a$p%;4V7Zp_GX;7ChKtC0J&nvSOieQd-0-bFx&zoN8qPBZ}9&qP)Mz86a zKs`y>?h7--(2{6aJreU!PC>yf%J6U&bhiH;jP}5Pb?(lJP0rRLRoPpOZlh~0vS$WB z-x@9a+i^{gllG-kLAJOgo5a)5Dsghpgo{o75_a7Cn}8F-2QoqkzH?P#8IM@M?(Ce` zSLRV`>hy&+f%8V-3>fShst3P=4W^6@$x8XJOXps<5Wk@nTJm72;R-2-de(pah7F`}h=NNUy11e7?ba$PafM^FvxK;to1EU1kMLTxW6Hy3jy;y5%pk@rmwlkr{e3}Sd!>@Lii`dU!ixFHX2HC#Nvs5%8X$HBdlZ}Wnw z@cy;U84bbisbIo}d|QASme3@m2?bA(uxM^>ZocH4u^j&%gyP|fhX5FSkB87{1ZRIR zrJX~gacH&9sI=AAyO243rchsMar}*cEqHP80~7!GyN{jw%G!C>9;75-$JkaykMWkc ze&AhAXA@L#{&9|qbCtZNF3jXbF z_>eo~v0Lh^O;x?q8dfu}?{i!ojX03IiQdjGM8EII(z~}X(v;s~y-3{H$B+^1%UXVi zBHloFBA`S2*YK3LX9R74CD>_jdaY$te7w|^C+sg&pfhE%L9LdHD}Jh0M^`EKkl47P zBk=aHv9bH#E%){f__D@Ld6M<>O}XqQ40zFc*J#D;797WN^YUWV5%k9S;Rb7K=2i$b zl?H-y{;B=b<~2%qmQBrDFH%IuOI>|^09V1s(0QeU0u{j8WL#JX0-42{CGOluBVM*SLBSn_28 zbD271S>Dpc3$?S$w7Yk&eH250Iav1{-OC+7w-b{{0voqtWtNe!h)#^g$>z9^O+G=0 zzH7d|C6OnTqS=G?Tkv8~f`H%lFfr5?!HEm5sc=Y}A23~W!jBqJhqc4l1W&E4t$D9- z5pWKOJ{HC;s7S(5?zrj}=yVDpxm(48I&x}B@B|qr;jPn7cS!C#@MAG@u&$j4KpclF z#>U2y2+o9HN}|74)}2{lfr@0p&dQIemmXzSRwm`UGGkE0rW<=_XUPU{g@J$V!?SE@ zw!7yUH4pQC=@j~tH7L2r#x*rH_2G(w@AF$3+U7J*roD4qUNmQg??YwyuttGHG;Ss} zuNr?V@pqVD{}_s~9O)Dx7nm*NnHO5EbimEpl^v`4KtI*g5yC&5ql=a?)n&XqE|s8e zG9z?4D^2B?g#;#!*lIU3Pz|nv(W1k`4&lnh+G^IQnY0dEJfqno=d|3JBN9iSWO_9SCz}T9I8CMyqXJ37Sw3?7Kcj9xgl`Br$j;qg2F*IDfzqC7aXq>P^B->Mm!pry zL5`!_baHDdux^f=2>%^Toht`x#9LPn1r$QLu+7`}P8BA%h7cL*{cJ9p<*zO%@ z-f(O$A%iWb4O)W29UUE+Iw)a{x+CDqKR)$L2DWE6|H5Fw`c+Xsrn)GTGo!H2GL{Ol z3b?J>p5mcmSDjzXl=I`&gi(D}0j1>iiBD0Xp`j(_Ui$ixKGL0CU7Oy$PS~pZ8QlDkA$LKOzXYY)O#&$qwYCGA})y{2!!a7ajR_%>&eh*s({<&Ry5GmlFqm z=X8KqC{z-s6W81#xY`ew0)@LH#}F-{ur>JM(GDpnX{&w4hV}VEkN30QOAkO?4Ikuy zTdL$%+xGK-ds!t2R7SGkR)3n2RLWwQn4k?>%Wt{c9z$1O>GN_C*j^h)$61!Tb}KVu zNluuc@z2R67IDNIRC|igE-Ctf-n+g?cc2^lyJv=k&0dBFmFY)h--!D7@v2U}9=K{L z$cElkPqODJnnwrH9f6+$pIYjZ?5S1Z1^{gvZyT!J8)1})oS_|L3cUm9e`bl)mdmzH zL4up*+Ef>B*E+>G)k^&K+gJP$lgM8k_MB5;M2s2MM%(6ZU^|9H*P$Kzp>A4~(qiI4)Rg2T?K3JBl6Jl=**if@Yl)ZLo zXyHMWA`Da!=x}<@S%*4Jo(hZ6uv^=j{7css$`gRby=`k$}Ntlm|rP^_fY$%$axt!h=~k@ov%9g6}A&%kf-Fhb|xPKMCC zX6QV#^6>HD5c|TUd1p?pcC0T6>sQJYJlz{8Wqin2R7|Y)H9GwN_`A&Nt(id%rog4P zSIHnpe4QHSW>=fIAyV$%XhgLa-Gf3Pk-wkA)kG*p?C|WDodoV!$)m?N0v5E}Se^HF z<0Zt275_^rrjPo@aJQxCGC@z~;no15G#X9zkN2Se%-zfF$$SC}iw+cn$3#8qeOX-0 z!?y8^M=HU@PvI&hj7RXnv&?9E-0wA2s`eLq+80iMC6f~zm+Axs1zskqXz9(jpgB;v!4X3jxRom%6J}1;dub~A7k*U`|ImG1RGz7B6ug+_skQ$p*}wrIGdf=W?JhB{=agZJ zzFFxbVuK5qyk`^^%98>!_(O0i+pSx-(w4Lw4zbn&^}cgCe139hPRoIrHS2-P>!h{~uGSe2OznK<1uJr3 zwn6e~DhZo&EU*aRbU#pTr(%UNAvo#5>E$yaQ|R+IToLiJ-|mw({y)So&8ipjTYu=0 zk@bk$d}m*PW>y=miUTAL)gbo2*k@Zy%gEjLyc+B2l}90i$dc{x@^b#~AwKmDId_!% z`t-QDQMqTl)5>$wMw+xi&0jOk$|7`6 z9}^OiM)HDvO+N2(@;y!m^tol=8kL)>^dV*`B;>3Q`W`O5`$F40aSzk}xlgKobDG+b zd?y7JUA?vN2{~hL{FxYGY6dyS&fQ$~#%$z$9)Eq%r>rsPA4KXF9NW<@l#0Vy&}meO zg9i_4kLRvArX+wFV;Tf`9F%%f;56#mP?419=;B$iMC-+l4SBqXxQoFD)(BTo#G$1mL9+y0qU|;(DjEW$&08CHfoc6%szr&erpw+ApR=r*00L1 z1}n0{c{fE-Nj@lkx%y@%hPc1;3OsfGrXjv*;qrZXCM=VW6z_b zMVXk{V=0uoIv7jR8>+#L8>1qOeDKtIjXG1P=c0Q&ym0VFuEl1QJP%I~uH6S=@yWYlY5N&M!HRMu00@QJ3h1aa(Rb||%|WSj z=(fLmCkgX3e_W$fY8XxJ#q! zK<5?LdL5Ft78a<6PBGh+y2syl0N85c$T|o2KD-Ll^nt2nrr)yuym%!T=$e|y(by}C z?=rT(4|cB4=fxXU`N#MKz7@H5@7^z5Tw*{yh&#-6s&RR`_eu#OL3n4l)V?_BPupM& zF5dMTB_=H=*I1$G;ijOs3EPB<^G3-p&ysv+o@Zm1n+8xq)5c!ZO_~RN_1h9R)vsry z;WqJihA~xFWbG4O9HK;KR*ckG~SI|{c*bt813b8 zI8DyKUt5K%>+0#nym}?cFKhSb(nR|e095TdGIeEb>yJ9k-bY~VfS&U2dE%Z@!HXYw zfwGYSUvZJfKU4tvxWOY_%n=Q14JeJ~Dkrn7w1rnzD=(XiH?=&a+)zma#b4;T)zoP^ zvV-6JsK3lupSdCCmM~JT9x8f6?V=!_;w$ zh31mY?IgM!qRp7Q5;m8GiJAHTrtSRy=RD`^efQn_Jn#E`-|zkVS*r7iW9wA3R6rom zI=kbxE+7yX46Fm7iU3vE!3_g`l&>5=bqxf9X-K|uo&B*Q5J>f@ovk%CoHIpoI*#RO zw`4jzJbRo5gY0-?wUOh$@4k48ts+KS;S%fUIi%)e5{qKuj|uwqR&|Qslmevvil_>U?qlcfpc;P=Y zSYMUzl9xHnK&4dD!&x&z~>UMlY3*hSdDDvm$!-1CORt;>2SKY1nHuoIpRn*3V;O#B!q&cOLutbBiGNUZu6OFnUTBe45aZtfo8Jlmx51*sfC> zG56aaZEg2LmpSCh;;G{8{%S)CILSnxreD#9SjLG184SirH@BbJRPU z?_d&%v@qRo&c0I^&<<1$R4;|poNEw>fiF|XtVAICfL(6!rl z8V)G{13f`E@KWERtE<*V?5n=2chZHM<}7enk(b(sKaD<>*wEem!0qHoPTsNfbB6iC zC*s2FczAe%WRe*M5$f;V?$Bto1<}%+heHvtIY9LkfN>y+5*aPTJBkUxgLOT*Hp!EX z1f|qp+*Yu0tYDe9ZiTFhS13`KPQ(?lD55rG)SmL#?SK2QbX>*{(0PHN=b`aM4Z~7l ziCAWw@HvXU_0aI|$z9#uehv-}soSgsUMubAf1G^%O}6l|vvtu+E+(in9msF_`6Vx2 za4uZ9pkY)dq#i2Jk!gUV8$_xf44Zz`&xnHGjm!D#mcM$qfSYM*VzM_xp+Kj|;ZEZ> z!^4i?G)0pI&b?$8$CHD&(-#(|h1N%aL!H zkmQXzx(*Bk_T|C4KMDdtEC)Q%SSAmf=uBt;93ABEpN8oH72W4`Dqo9fg5WIQp}XE$PNuSwk;VH(IZZKxG0gAfF?y%nVr6hE8bY zmHh+j!06$K*~j>>u-d?^Y57~lA|1vSpzNfjrDeYzU_^ZZqXMI&MJU|(1He9*)|PZ# z`2(S{_;f`%mQmV=vkx6#)y1x88KP$Q_$BXAO^sAV-Ql4v zA%|l{i(|ejDLOVtT*lXRPuK{)Iqt@0NNDp&Z&h&rru@CbQR~1(UYb-$?A+&DlDwe> zu*G<#ub-Pe&CA#s>F_5O4XZJV2;KGb8&P*A&^wZhQ*{UpGvOON)eET9s-B)x?n#D@ z^JGFi_ctMW!_N0bMZ1ejOL5nfzK%CX%7bzGy)ddZ2xadi{v+|iO}b*j;1|F=&!WCw zUY?)0%adoY5jigkV==adamx!+)-hp|-CxqT_tnCaltfLJ&H}+mWh)P%BL=YCRke0D zRCHV7m=dol&exeiWpI|yrAx2Hiyzf^Gc)O*LWUX=>K`R`tS@C!C3h^5`aYV1!!dQf z=vYJgJqVyelK4Y=`wvm;!4W7Zcmtq)R-Fm5$b6wLW;w98GU!NHU`@{UWiG3Dn$hYl z`WPgHquw~hYIXNIZop;4R_=|9=5K=l(LjA_9q%gtn#3(GEL^Iw2~c9M-=1VRByx;z zQIChmCQ_=*mH3qBEh$Z_^Jb=e-SGOwWTFDmW_PAar)V(DZw41m7B<5YLAb?->lRrW zaMZcDWgpE%D`v2gXF&48BwF(*2$vxy4SKdHSxiqQTGI`5$rmA~`z*&-2#7_iTz=|^ z(v444Wxfs=c<3qKBHrDdpNLSegy+V-d}cZF3*y<;5z!KdOkboHS_aRE_!Lp>6`<=B zKmaEsqPB-1k9Z@&;c`GajPj98>W(fpqUlvf=!r-5CpD$rK@U5b?{2{HcYh-kWa}of+7wgMSts2GkV#Da1^Y zuz3=`T~6eeFVg>#m9w)U{H@(YBJt+CL(U{Die=O$%f7XYrW6;y6~yF_fjz3etUg*w zs>tCuai6D`*H#k#eP^cz^Lu3(pA+h+8kkaA+VyS zFwOX4+g|&6D}fz{374hw9L2!e%EZ*Pr{ZG!mO@kKGuUkXM5&r}()!t016$lxMC9JJ zmDP{?a5M~z%(U;}^Y`kVjOXUQ(BCSntRK-BLPN1T^=WQy0_J-wf%BO=e^#?Elmct3 zN9JK|(*umRtt(b|XA4=UriWwZ5qm8xf>gA+yaySxbiwK~2T?E=|+3KvSzzOJ`vR!&4W)^{X_3G8r z^72j{i%8A4jjr{~BLW%1XsUq!tPDOE9o@&}@umRyP^LxKK5!Yb;2s8Mzl8*;ZywK-}fIl0Dqm}TARMjOymDCMl}>X z(pBOm0Z>sZLi}Szrzy8uB}K*VjX>R%cn=wZs|JJ#4K+E4>g?&65OYt_oTji*tjjVW zU=TUH8~UjRfL|;o)8i1SGAT*HJ;*hRxd%81k$O3$9KMGTzbIO&5X{eexVgDqL65(A zV}GhQPlD8(f`fzKTgomhh#KAx{j|g%wz;zDNn5so*}ua&UC6AXqoYSySk+Wt%?HjJ zWGwKja`$6+)>r0DU8?0+N&_C2t3of@&*1Yob@u!M~sy70H?qI8$~6h5(cAxVP-IR)22;b@8A0XNV@X&?b}0S zN0OfX6PHG(mC_bLn1xe2n>Qa>a*Rh9C&1%@p{xvEz4wl68ROp**!APXoBcJ{T7=8X zglyrNblyysU999#JpAe`^7_AkcL2=)9q0ce__unuq`Ty_JlZ06X*v+tQ;x GiT?$yOgmBl literal 0 HcmV?d00001 diff --git a/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/README.md b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/README.md new file mode 100644 index 0000000000000..0a4e607ed205e --- /dev/null +++ b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/README.md @@ -0,0 +1,233 @@ +--- +comments: true +difficulty: 中等 +edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3218.Minimum%20Cost%20for%20Cutting%20Cake%20I/README.md +--- + + + +# [3218. 切蛋糕的最小总开销 I](https://leetcode.cn/problems/minimum-cost-for-cutting-cake-i) + +[English Version](/solution/3200-3299/3218.Minimum%20Cost%20for%20Cutting%20Cake%20I/README_EN.md) + +## 题目描述 + + + +

有一个 m x n 大小的矩形蛋糕，需要切成 1 x 1 的小块。

+ +

给你整数 m ，n 和两个数组：

+ +
    +
  • horizontalCut 的大小为 m - 1 ，其中 horizontalCut[i] 表示沿着水平线 i 切蛋糕的开销。
    • +
  • verticalCut 的大小为 n - 1 ，其中 verticalCut[j] 表示沿着垂直线 j 切蛋糕的开销。
    • +
+ +

一次操作中，你可以选择任意不是 1 x 1 大小的矩形蛋糕并执行以下操作之一：

+ +
    +
  1. 沿着水平线 i 切开蛋糕，开销为 horizontalCut[i] 。
    2. +
  2. 沿着垂直线 j 切开蛋糕，开销为 verticalCut[j] 。
    3. +
+ +

每次操作后，这块蛋糕都被切成两个独立的小蛋糕。

+ +

每次操作的开销都为最开始对应切割线的开销，并且不会改变。

+ +

请你返回将蛋糕全部切成 1 x 1 的蛋糕块的 最小 总开销。

+ +

 

+ +

示例 1：

+ +
+

输入：m = 3, n = 2, horizontalCut = [1,3], verticalCut = [5]

+ +

输出：13

+ +

解释：

+ +

+ +
    +
  • 沿着垂直线 0 切开蛋糕，开销为 5 。
    • +
  • 沿着水平线 0 切开 3 x 1 的蛋糕块，开销为 1 。
    • +
  • 沿着水平线 0 切开 3 x 1 的蛋糕块，开销为 1 。
    • +
  • 沿着水平线 1 切开 2 x 1 的蛋糕块，开销为 3 。
    • +
  • 沿着水平线 1 切开 2 x 1 的蛋糕块，开销为 3 。
    • +
+ +

总开销为 5 + 1 + 1 + 3 + 3 = 13 。

+
+ +

示例 2：

+ +
+

输入：m = 2, n = 2, horizontalCut = [7], verticalCut = [4]

+ +

输出：15

+ +

解释：

+ +
    +
  • 沿着水平线 0 切开蛋糕，开销为 7 。
    • +
  • 沿着垂直线 0 切开 1 x 2 的蛋糕块，开销为 4 。
    • +
  • 沿着垂直线 0 切开 1 x 2 的蛋糕块，开销为 4 。
    • +
+ +

总开销为 7 + 4 + 4 = 15 。

+
+ +

 

+ +

提示：

+ +
    +
  • 1 <= m, n <= 20
    • +
  • horizontalCut.length == m - 1
    • +
  • verticalCut.length == n - 1
    • +
  • 1 <= horizontalCut[i], verticalCut[i] <= 103
    • +
+ + + +## 解法 + + + +### 方法一：贪心 + 双指针 + +对于一个位置，越早切，所需要切的次数越少，因此，显然是开销越大的位置越早切。 + +所以，我们可以对数组 $\textit{horizontalCut}$ 和 $\textit{verticalCut}$ 按照从大到小的顺序排序，然后使用两个指针 $i$ 和 $j$ 分别指向 $\textit{horizontalCut}$ 和 $\textit{verticalCut}$ 的开销，每次选择开销较大的位置进行切割，同时更新对应的行数和列数。 + +每次在水平方向上切割时，如果此前列数为 $v$，那么此次的开销为 $\textit{horizontalCut}[i] \times v$，然后行数 $h$ 加一；同理，每次在垂直方向上切割时，如果此前行数为 $h$，那么此次的开销为 $\textit{verticalCut}[j] \times h$，然后列数 $v$ 加一。 + +最后，当 $i$ 和 $j$ 都到达末尾时，返回总开销即可。 + +时间复杂度 $O(m \times \log m + n \times \log n)$，空间复杂度 $O(\log m + \log n)$。其中 $m$ 和 $n$ 分别为 $\textit{horizontalCut}$ 和 $\textit{verticalCut}$ 的长度。 + + + +#### Python3 + +```python +class Solution: + def minimumCost( + self, m: int, n: int, horizontalCut: List[int], verticalCut: List[int] + ) -> int: + horizontalCut.sort(reverse=True) + verticalCut.sort(reverse=True) + ans = i = j = 0 + h = v = 1 + while i < m - 1 or j < n - 1: + if j == n - 1 or (i < m - 1 and horizontalCut[i] > verticalCut[j]): + ans += horizontalCut[i] * v + h, i = h + 1, i + 1 + else: + ans += verticalCut[j] * h + v, j = v + 1, j + 1 + return ans +``` + +#### Java + +```java +class Solution { + public int minimumCost(int m, int n, int[] horizontalCut, int[] verticalCut) { + Arrays.sort(horizontalCut); + Arrays.sort(verticalCut); + int ans = 0; + int i = m - 2, j = n - 2; + int h = 1, v = 1; + while (i >= 0 || j >= 0) { + if (j < 0 || (i >= 0 && horizontalCut[i] > verticalCut[j])) { + ans += horizontalCut[i--] * v; + ++h; + } else { + ans += verticalCut[j--] * h; + ++v; + } + } + return ans; + } +} +``` + +#### C++ + +```cpp +class Solution { +public: + int minimumCost(int m, int n, vector& horizontalCut, vector& verticalCut) { + sort(horizontalCut.rbegin(), horizontalCut.rend()); + sort(verticalCut.rbegin(), verticalCut.rend()); + int ans = 0; + int i = 0, j = 0; + int h = 1, v = 1; + while (i < m - 1 || j < n - 1) { + if (j == n - 1 || (i < m - 1 && horizontalCut[i] > verticalCut[j])) { + ans += horizontalCut[i++] * v; + h++; + } else { + ans += verticalCut[j++] * h; + v++; + } + } + return ans; + } +}; +``` + +#### Go + +```go +func minimumCost(m int, n int, horizontalCut []int, verticalCut []int) (ans int) { + sort.Sort(sort.Reverse(sort.IntSlice(horizontalCut))) + sort.Sort(sort.Reverse(sort.IntSlice(verticalCut))) + i, j := 0, 0 + h, v := 1, 1 + for i < m-1 || j < n-1 { + if j == n-1 || (i < m-1 && horizontalCut[i] > verticalCut[j]) { + ans += horizontalCut[i] * v + h++ + i++ + } else { + ans += verticalCut[j] * h + v++ + j++ + } + } + return +} +``` + +#### TypeScript + +```ts +function minimumCost(m: number, n: number, horizontalCut: number[], verticalCut: number[]): number { + horizontalCut.sort((a, b) => b - a); + verticalCut.sort((a, b) => b - a); + let ans = 0; + let [i, j] = [0, 0]; + let [h, v] = [1, 1]; + while (i < m - 1 || j < n - 1) { + if (j === n - 1 || (i < m - 1 && horizontalCut[i] > verticalCut[j])) { + ans += horizontalCut[i] * v; + h++; + i++; + } else { + ans += verticalCut[j] * h; + v++; + j++; + } + } + return ans; +} +``` + + + + + + diff --git a/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/README_EN.md b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/README_EN.md new file mode 100644 index 0000000000000..62f7daff212c7 --- /dev/null +++ b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/README_EN.md @@ -0,0 +1,231 @@ +--- +comments: true +difficulty: Medium +edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3218.Minimum%20Cost%20for%20Cutting%20Cake%20I/README_EN.md +--- + + + +# [3218. Minimum Cost for Cutting Cake I](https://leetcode.com/problems/minimum-cost-for-cutting-cake-i) + +[中文文档](/solution/3200-3299/3218.Minimum%20Cost%20for%20Cutting%20Cake%20I/README.md) + +## Description + + + +

There is an m x n cake that needs to be cut into 1 x 1 pieces.

+ +

You are given integers m, n, and two arrays:

+ +
    +
  • horizontalCut of size m - 1, where horizontalCut[i] represents the cost to cut along the horizontal line i.
    • +
  • verticalCut of size n - 1, where verticalCut[j] represents the cost to cut along the vertical line j.
    • +
+ +

In one operation, you can choose any piece of cake that is not yet a 1 x 1 square and perform one of the following cuts:

+ +
    +
  1. Cut along a horizontal line i at a cost of horizontalCut[i].
    2. +
  2. Cut along a vertical line j at a cost of verticalCut[j].
    3. +
+ +

After the cut, the piece of cake is divided into two distinct pieces.

+ +

The cost of a cut depends only on the initial cost of the line and does not change.

+ +

Return the minimum total cost to cut the entire cake into 1 x 1 pieces.

+ +

 

+

Example 1:

+ +
+

Input: m = 3, n = 2, horizontalCut = [1,3], verticalCut = [5]

+ +

Output: 13

+ +

Explanation:

+ +

+ +
    +
  • Perform a cut on the vertical line 0 with cost 5, current total cost is 5.
    • +
  • Perform a cut on the horizontal line 0 on 3 x 1 subgrid with cost 1.
    • +
  • Perform a cut on the horizontal line 0 on 3 x 1 subgrid with cost 1.
    • +
  • Perform a cut on the horizontal line 1 on 2 x 1 subgrid with cost 3.
    • +
  • Perform a cut on the horizontal line 1 on 2 x 1 subgrid with cost 3.
    • +
+ +

The total cost is 5 + 1 + 1 + 3 + 3 = 13.

+
+ +

Example 2:

+ +
+

Input: m = 2, n = 2, horizontalCut = [7], verticalCut = [4]

+ +

Output: 15

+ +

Explanation:

+ +
    +
  • Perform a cut on the horizontal line 0 with cost 7.
    • +
  • Perform a cut on the vertical line 0 on 1 x 2 subgrid with cost 4.
    • +
  • Perform a cut on the vertical line 0 on 1 x 2 subgrid with cost 4.
    • +
+ +

The total cost is 7 + 4 + 4 = 15.

+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m, n <= 20
    • +
  • horizontalCut.length == m - 1
    • +
  • verticalCut.length == n - 1
    • +
  • 1 <= horizontalCut[i], verticalCut[i] <= 103
    • +
+ + + +## Solutions + + + +### Solution 1: Greedy + Two Pointers + +For a given position, the earlier you cut, the fewer cuts are needed, so it is clear that positions with higher costs should be cut earlier. + +Therefore, we can sort the arrays $\textit{horizontalCut}$ and $\textit{verticalCut}$ in descending order, and then use two pointers $i$ and $j$ to point to the costs in $\textit{horizontalCut}$ and $\textit{verticalCut}$, respectively. Each time, we choose the position with the larger cost to cut, while updating the corresponding number of rows and columns. + +Each time a horizontal cut is made, if the number of columns before the cut was $v$, then the cost of this cut is $\textit{horizontalCut}[i] \times v$, and then the number of rows $h$ is incremented by one; similarly, each time a vertical cut is made, if the number of rows before the cut was $h$, then the cost of this cut is $\textit{verticalCut}[j] \times h$, and then the number of columns $v$ is incremented by one. + +Finally, when both $i$ and $j$ reach the end, return the total cost. + +The time complexity is $O(m \times \log m + n \times \log n)$, and the space complexity is $O(\log m + \log n)$. Here, $m$ and $n$ are the lengths of $\textit{horizontalCut}$ and $\textit{verticalCut}$, respectively. + + + +#### Python3 + +```python +class Solution: + def minimumCost( + self, m: int, n: int, horizontalCut: List[int], verticalCut: List[int] + ) -> int: + horizontalCut.sort(reverse=True) + verticalCut.sort(reverse=True) + ans = i = j = 0 + h = v = 1 + while i < m - 1 or j < n - 1: + if j == n - 1 or (i < m - 1 and horizontalCut[i] > verticalCut[j]): + ans += horizontalCut[i] * v + h, i = h + 1, i + 1 + else: + ans += verticalCut[j] * h + v, j = v + 1, j + 1 + return ans +``` + +#### Java + +```java +class Solution { + public int minimumCost(int m, int n, int[] horizontalCut, int[] verticalCut) { + Arrays.sort(horizontalCut); + Arrays.sort(verticalCut); + int ans = 0; + int i = m - 2, j = n - 2; + int h = 1, v = 1; + while (i >= 0 || j >= 0) { + if (j < 0 || (i >= 0 && horizontalCut[i] > verticalCut[j])) { + ans += horizontalCut[i--] * v; + ++h; + } else { + ans += verticalCut[j--] * h; + ++v; + } + } + return ans; + } +} +``` + +#### C++ + +```cpp +class Solution { +public: + int minimumCost(int m, int n, vector& horizontalCut, vector& verticalCut) { + sort(horizontalCut.rbegin(), horizontalCut.rend()); + sort(verticalCut.rbegin(), verticalCut.rend()); + int ans = 0; + int i = 0, j = 0; + int h = 1, v = 1; + while (i < m - 1 || j < n - 1) { + if (j == n - 1 || (i < m - 1 && horizontalCut[i] > verticalCut[j])) { + ans += horizontalCut[i++] * v; + h++; + } else { + ans += verticalCut[j++] * h; + v++; + } + } + return ans; + } +}; +``` + +#### Go + +```go +func minimumCost(m int, n int, horizontalCut []int, verticalCut []int) (ans int) { + sort.Sort(sort.Reverse(sort.IntSlice(horizontalCut))) + sort.Sort(sort.Reverse(sort.IntSlice(verticalCut))) + i, j := 0, 0 + h, v := 1, 1 + for i < m-1 || j < n-1 { + if j == n-1 || (i < m-1 && horizontalCut[i] > verticalCut[j]) { + ans += horizontalCut[i] * v + h++ + i++ + } else { + ans += verticalCut[j] * h + v++ + j++ + } + } + return +} +``` + +#### TypeScript + +```ts +function minimumCost(m: number, n: number, horizontalCut: number[], verticalCut: number[]): number { + horizontalCut.sort((a, b) => b - a); + verticalCut.sort((a, b) => b - a); + let ans = 0; + let [i, j] = [0, 0]; + let [h, v] = [1, 1]; + while (i < m - 1 || j < n - 1) { + if (j === n - 1 || (i < m - 1 && horizontalCut[i] > verticalCut[j])) { + ans += horizontalCut[i] * v; + h++; + i++; + } else { + ans += verticalCut[j] * h; + v++; + j++; + } + } + return ans; +} +``` + + + + + + diff --git a/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.cpp b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.cpp new file mode 100644 index 0000000000000..b42c71b565b24 --- /dev/null +++ b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.cpp @@ -0,0 +1,20 @@ +class Solution { +public: + int minimumCost(int m, int n, vector& horizontalCut, vector& verticalCut) { + sort(horizontalCut.rbegin(), horizontalCut.rend()); + sort(verticalCut.rbegin(), verticalCut.rend()); + int ans = 0; + int i = 0, j = 0; + int h = 1, v = 1; + while (i < m - 1 || j < n - 1) { + if (j == n - 1 || (i < m - 1 && horizontalCut[i] > verticalCut[j])) { + ans += horizontalCut[i++] * v; + h++; + } else { + ans += verticalCut[j++] * h; + v++; + } + } + return ans; + } +}; \ No newline at end of file diff --git a/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.go b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.go new file mode 100644 index 0000000000000..51ccff2c94e70 --- /dev/null +++ b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.go @@ -0,0 +1,18 @@ +func minimumCost(m int, n int, horizontalCut []int, verticalCut []int) (ans int) { + sort.Sort(sort.Reverse(sort.IntSlice(horizontalCut))) + sort.Sort(sort.Reverse(sort.IntSlice(verticalCut))) + i, j := 0, 0 + h, v := 1, 1 + for i < m-1 || j < n-1 { + if j == n-1 || (i < m-1 && horizontalCut[i] > verticalCut[j]) { + ans += horizontalCut[i] * v + h++ + i++ + } else { + ans += verticalCut[j] * h + v++ + j++ + } + } + return +} \ No newline at end of file diff --git a/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.java b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.java new file mode 100644 index 0000000000000..2ea101401c9f7 --- /dev/null +++ b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.java @@ -0,0 +1,19 @@ +class Solution { + public int minimumCost(int m, int n, int[] horizontalCut, int[] verticalCut) { + Arrays.sort(horizontalCut); + Arrays.sort(verticalCut); + int ans = 0; + int i = m - 2, j = n - 2; + int h = 1, v = 1; + while (i >= 0 || j >= 0) { + if (j < 0 || (i >= 0 && horizontalCut[i] > verticalCut[j])) { + ans += horizontalCut[i--] * v; + ++h; + } else { + ans += verticalCut[j--] * h; + ++v; + } + } + return ans; + } +} \ No newline at end of file diff --git a/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.py b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.py new file mode 100644 index 0000000000000..d87eb07238319 --- /dev/null +++ b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.py @@ -0,0 +1,16 @@ +class Solution: + def minimumCost( + self, m: int, n: int, horizontalCut: List[int], verticalCut: List[int] + ) -> int: + horizontalCut.sort(reverse=True) + verticalCut.sort(reverse=True) + ans = i = j = 0 + h = v = 1 + while i < m - 1 or j < n - 1: + if j == n - 1 or (i < m - 1 and horizontalCut[i] > verticalCut[j]): + ans += horizontalCut[i] * v + h, i = h + 1, i + 1 + else: + ans += verticalCut[j] * h + v, j = v + 1, j + 1 + return ans diff --git a/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.ts b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.ts new file mode 100644 index 0000000000000..5069d7b85c340 --- /dev/null +++ b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/Solution.ts @@ -0,0 +1,19 @@ +function minimumCost(m: number, n: number, horizontalCut: number[], verticalCut: number[]): number { + horizontalCut.sort((a, b) => b - a); + verticalCut.sort((a, b) => b - a); + let ans = 0; + let [i, j] = [0, 0]; + let [h, v] = [1, 1]; + while (i < m - 1 || j < n - 1) { + if (j === n - 1 || (i < m - 1 && horizontalCut[i] > verticalCut[j])) { + ans += horizontalCut[i] * v; + h++; + i++; + } else { + ans += verticalCut[j] * h; + v++; + j++; + } + } + return ans; +} diff --git a/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/images/ezgifcom-animated-gif-maker-1.gif b/solution/3200-3299/3218.Minimum Cost for Cutting Cake I/images/ezgifcom-animated-gif-maker-1.gif new file mode 100644 index 0000000000000000000000000000000000000000..6f53ef8b8f9f746fe14559ede8185fdb1d703233 GIT binary patch literal 19367 zcmeI4Wl)@pnyniM?h@SHg1aZUYjAh>;KAM9-5Ymz2-3I&w*+_BkZ{@A*>lcJO`SP& zZq>b2GvNons4l9j`g`hGYrQQlDaOTZfDI-Db_4k12N4kw6B833AD@(zl#-H?fq{XA zg@u=wS4c=mR8&+_Qc_-C{{8#+nwpwAIy(CL`lhC)4h{}(Zf;&)UcSD*fq{V$5fSn6 z@yW@_85tQlIXQWGd1Yl~wY9Yk4GpcWt=-+-eSLkOK79g#Kob)av$L}c3k%E3%WG?E zo12?^dwT~52gk?9S65fp*Vm7akI&D~Eh-ADWu^Z9{@S$EARn)jx!Irp>3{NzV~75gR$07&x046T4bCn-iNmJKH<)Ffy8W zm|2)I7}?n{+89`wI0ESZckx|hxv2pPUiAl*R zscGpMnOWI6xq0~og+;|BrNFZCipr|$n%cVhhQ_Amme#iRj?S*`p5DIxflq@&!y};4 zvGI1C*VEH)CO(@17MG~zR~6|2c=TWC*LLK{0TjDOas&WE%-6)n*W#EFu`0VGn*k^IHbh+qIhy|tMUFkm&XscP}0 zVHj_WK$(*D#p4-VPKT=_^(B+fIYI$&1X2y9(*+Uch+du zpvHHc0G&qUMr93@YgR#m8}GyTgHkvI2H` zKNIU9D`6Y3L(7?`1iQT-ekKeVHFnEmC1s%g5=z7pY8XPB4)Z09K@(;xf-N2<-;1yg zdn=gkFsUGh|MEkDp5Rw(V-||};jL&MLoRZCQ8agQ7D>?lcH+G#EJgC5O4`>*)!^2` zc-gMLJ_z#KFD7YKtE}LT@}>`P2$=M~;~AENlGyZ&2uwm!ZY(7w2KD9uq1*|?L%qC^ zz7dMNI_z+BTq|&#h{EB#B4DwJ&7p-lOuip5JttWz8CYug`Vgl8?r}dqjw5}qJbb*) zucC^@;vlIF7j`$rIJnfj@(t7xUG<>U16{@#oHU)0CTNK+zW<$8Md~=*1HIq$Y3m!N zBtomLW>{T#`lboF_UE0t_Wbh7wi(i+s=CW;D@N8YGrSBP>veReod=Zdww+6dyt^F` zXLR-*aAafWy@2NkyT;XYE&Dzcy{GemZNfTQQw-txH-%4_35g2tLf~XGDd=VR7k$!A3{x)Y8$w0D1t6^i1Weq}?oFfU5>yA)Z#A zaaKAQe5O~>0564>`H*Tff1Y=4BC`1^=$Fhmbo9Q>ke+x94QX(N#=dZ4MP)qiv#L%# z*fKH{!PJ4>w$GkNP345`=yYsTy(n+guicgUr(lUv4$7+gn2 zbssNNdJu}4LL|owaj#N`Wr|r+M#fBeuF|F=i`hyf$1OFl(ig{yIhsetZ9T3sHW5m= zh9oB()2}l3WlDG!MkZX^uCmS}OZfIACq0(0vhT}>4pzo@|W51;gLzn}EKp7ig_SnEtXL5<}L)$;9N0O=-rbsY2Qbe+*A zT0m{;O#bKVWGx+ON0X@_Pnt8`c88rGjV{gc8!|yz6xq($vxcTIWb9oS8X7y|32$`7 znpzcirLv-ebg$E9%neJ>ld=;v)sKYBDLSDz+7*r^8b9t3I^)gQ>UKlicw=a*T?qCQ z5DYbT$X|+$+lX#lWllS5E?lYTCF-c&@vgl77{cBqcQ3M|Q?S#A8yg0dVA*E|=z3b};n-Xd2rFfx?O5&{ekP0N+Z>bKHO`SD4Y@ z>Yic}`dSz4cBs1iuCikKDbwZo#)aLWlO}8KaYbdJ$B zP}68BJ>C=UNnx~Wz9D`U|k$Jkl_ee%;j=;0R62}F4%$uhy(K2|r*HoAH_ z;&;i{FhT7~&oU!QS6Mg7-jClfEhPNL`LhUb=2#u^^AYo`rc-dOBQEc|3w%rnE)HiC z&-t5PJ?JNw0SBs%`dRMLkFLY=X5TO8t+W<6$jnCLn*98nIJqpG%(U+Yq7uH}4|;lb zHmpltWi_v*X{~cE`b2zWUFZMyy?#zrIjZeI5kjDCwMt&b8lDbe|XX8<}6dX8!3BUp0^4NA(E(7S{dqW&MQ5hBi4G#{D&P!)zbfXwOHTh4^G4E3)lCd3S6p48%kzV8ObadE;7g$ zPKFqqEL8}K#{d#>zXwHAANA%U=3}}2TajR5aDY%x0I*(%78d}3iv&PGz7R%XxUD?T z5E6D+48T#-jlm=Tnij-fb zM%WXDOjit%!^nUA+5Bw)GbS9ay+0*C7TfpOnFLT#ku9vX6kbF8>$K(TVyfRy545WL&-Dz4OO$nre!>DI0I$7 z$+_mtw=hPEZUuleT1OZYdA|$_uaZ|7Gue;?vHTm)d8-|jcytqnx(9{5{*)yz1~w0e zefA>gB5yCv@k60%s=G!$Jg1|UX30-Kls%e>HnN@c&>7&ka@GfgaW(=vILdZB(yNP( z@jqN1B^A2*SK)eMoVxY&-x8)iX!>SQbaKNd*7UF z%DlHLYN?2iJ#lJ?e?yq*rY^D=<`+G5+}=&!d)R$_?;`D%=Pw~Ekl3WbxJ~a#%&5e^ z=6xWKzSj;Ht|-+DW~fuor(yXz|MerIW2jiPVEAxB6#G}00u&)6@vT_a^~Eo7%;Xlq ziFOK-gFa5Mu$$3ZxBJGi0`rhXNlLM>qzOFUG^VM_@0LQ-b{x`n;&sr%ifxVBMsPFS z4_aX|<@HB$lAW?O%*g5agl1gbFI$KC$r6`J)5Cl8d%+h)K&1uoj+Vpl5D2mH#STi# zB_*Ne007WWPLrIxtS&vf+?5B-s-#%=z>J{THl41jT42Ts*h~9hMcUsKURF0$+-8|( zBuaPEu;?aw(zs~(egtarQPVnOl#rGob$nhkH#1;H<17PFv*JP@hu7;OJ9s%_ zuOAvIQlk6pgIBdEMqU`ug7E^)Z$a$=uAv0WP)U+VL0|-0K8B=~T8L zX|4M@5`il`)=v^X6%C(dj82?q@ttHv<|xXg*;_@3DxLZ?U9)Z%Uj4wC2lPPidgeGjI{pcx z*^k%kIYh&7@IBd(O+(!eClg5Y3PMr{x&HUB&&{suAzln7pvU;gAG<os}HpYz>~7PLInW8DYdnGp7uhZ0KVX4Jul%1ia&O+ocZN9J@7hIUqqDiz{r9x zL@LDK=p6tLiA)0&6ZLksq8f9%i2Sp8;r3&|Nrgou9CmG2>qla7oYlZb{l6WR7Sga`onl41#Jk8l#&KA_G)0h@TsHO ziZKNXT^g%{s&d8--!3nHHe9x%UKu-(avF%Ogul_k&fjA;^E9!PgPm3(E_^oUaxP7F z^FZ+fXf9pu15l>Z^1Z=fa3xP8Q1>%Xv7c5o=Te3CA0z1TrrH;=LLXXsu@CpQCRDb< z5NmXCkmt5GHmbsyN_q*Td0Uq{USY~Px-{W&Tc3+qX)Z3kJd=LgP%2w#sW!Si-*($r z3IqPnc-C*o{ewj9H{|{&Ku$n00AY;d=(v7L>;-ajs#cW<>}=}RWFtJa$Bmo8bf+!j zrWy0<`^DwY3>-<;HDwqZ@pNY$SLs&fc_jnVXI)Q9R@GS{$@zBOudtr%5>{x%t$N(@ zm&^JQkZDT>bSW$72JYvVDF-pM5Gn@YoH}0R*3YClq!SYHhUG%0uQK-$pDnKsyivoy z8bZZtJ|96Wf2x_}<}5xL7YY!opJG@*V4AeT%t{>#jeT05dMnIN^jYSJ{?bnskMw3% zTsW0&=C12$dtTCupC!*U;Gkhf1Rd{gmDX_0WtL`Chke;+8S!q(&S{)8C_rnG-GX%hxI^dxu&q7f<^bWoS}U;*E}-rHsV-LLKhcndE4V14Lc;( z-5SBZ=elFxg)Wza;*0FIK%hWUBf{3pfmwd`Gds%D$FE~VdLJ(*0-~Nk zGh1@*x9xU<>UZONNIx$3o`1n`qE?UIoA4J5H;-_a?GJIGS>*Zqu05Gt@px^+$ zC=ziW%KLT6RAYUuU+F`T7p_5lR)={V+VhH0XcL~QRAlPYGm}&aUd-7gOy~x|7Z>FL zEdtTK?yi&C*t*sNB3bngTC~gPXLj_G}?JJgIoX?rx~n595Umd>TOE@fA#Ong){ z39S;7V9J?#UL_P;Mq_rt*2$+&MRZ4!ul&6obH5!^2vy=Js65W3-LdWA;z&(v3d}`E z6`H+^nU#sem5jffBbTU_lni7*cObJV6@ULY9LwXJw|7rY!!rsy8TD9_v#f0*+P^om zS?FBCK5oJ0cQ~03VlLf!LX^94pV_B>pGy=36oDs;DpL}|#b~j7|KeHZ=1EW*CuQoj z;h(Fclgc}}t<<`4RT~|XDosC>tBumC2C%%Xuz@VsZcbll0X0^8HkRRmOE0vdVOCi4 z(;JS^ssg$GdyuP%sv~?X_S%183?m?`w50PH|ihI{GEL-K6GP=6U zbJsc*RpneFy>^&S`j_Cb{6oR}-`6IMe!=^zP2$JBMgl0vXUvBkhLx#st8$xkKAM(O zR%~w*PF!}642xQ#(w%`n@Cr{*5~G?5<1uV`E4!H$5-nmgMLLL&^iHd$$h!L z_pk3aeY-`mGlS%0)SvS{V&{MP;*S&_k{d=0b#D+l=CC*riqo|BRhKpX{gxhQaZ-UH zZ`>^{cuSvxy+UZog6#CI4g~_%82W#of4F`Hj)Jo;h z$FX`@){k=9Fj%U#ngk?0K8HxZCUxej}eDRV=;L}#jiFiDvryDplJ{oPJxz`bb zk7?5t0<9%cD}?`k<>Ik(c*}^Y>moQ(OF(lkMBM)Yg@=s4b^SJ2x9QN#v&wGW$!X$o zxr)s8nX9X@9HITIPQj0xlSIMQy0g|<%+`a5Ndb?elA&nk^8qsXi{mJI`Sx8U;XlL2 zcVBwRWcUewaZaK2GAf7pSGCnrujhsLSG6U0&5pN$|1KAa#4Ql_D@5*8pIYc^dca3a z^&IdhN+F&aA+SF}$R9&J0J&I{*8m|%E^K~?+M_^f5iD}mDPJUnJV;Dt12{9csx8QU?#YI^q5@Ls#47PlFRb03O92%z$A0as0RNvk8_ByEne>+}6QpNn2z$a`xTYNq zRnjk4&B@i*h{nOUH`I=|zhA{vWMBDk`i@{ybTb*@Ylu5%jRCPt1bpxR3Yg!-W`WUNz zAXS|A!C}#l^g^LgUJPIuU1=a9m{nYKB8mSb-~mJDcCvL{Gqq>L35bp=t|B2Oc-4F? zx@eguKjd-A%!-t^eRx#bzKm?5ES}3Lmz%DQH8%oI%4t>-@B8(P3U3r!qWDqzhtG;b zZZ}z4ba*ZcVN%~4Cw*abV5fAV3D}myYEJ6Lg(uyc3S8wYDbo~;DmkNUH=gcR{1&pB z{p?Frxnd%|Epo+%5s`9k@uZCJZ*mC;s7iTkQEhdL^RPChGuuysxjk8w1;mvc=7eLUS*tG@abulR&-Ekzt znd5QZmVn55w~lPbezSS^q4T)FDu(mn*wg#RE{ICc{eB`P$Nk20Yoq-lY7U8i<8XH4 z0b=XW{2!N0us($VZF8zqeTKHLh82s7Mp@@o;PDMB?_`%4W z`y;c=BwQC5I>KOsgo;l-o;u|cjGIb6I9&LoMy@~#;z$e5p?V(_?2t-pNMFV(dA+I2 zqcNcw)BRDES}j9?5&~>7!BzGcw%&pG5H=vFq@32eWx^7}EvS#Hkgl^@Y+?$OwdY{X zSWnDlPokE)5_QTt&|bga4C8g;I8TFcHsyVDKVkLgl-XUex3fIb_kE`>(|5ou?=fu3 z=cPXbU&|6WNfY!Bzf44kqGJ6BtLP5plz)9)Dn^H+q^2~N`%Q&df&h0qxbCX(6uEI< ztd&MNh%h9ROxD6&L1X&3_Bx)2KvqoaaXenmp?FFgDD4z3?Tq$5ORz{=Aq=QejGI&@ z_nJl}#iJXTjb02nKAX|7JY3H4x&n(IQ7$K4_52(o7rK!aveU9NFa9;K&D~1I#Hp<7 zg<|?o2!F(s(n0TGgI;3FqA$Upc#>;8!v6V~@?SAH&AYb6@hX>(sIUHQLil?Y`1iBG zzenJq>CdJP?L8zwqcsHafYz+nwe`{P$bfg{eBh(TL!ihC)QsJyVcnWDS zn6{L;Q>?^hS6?VpKYOTPXEU#;8QJ9^(~>_MZl8uC(hYMd+3=6uU_SlqVzb)JjUJP~ zDt9w8`^D6b@Z+^h+eU_V39I)9w~oE>Vl^dQxo=BH2^}G6e@AV5ckbgBh%(@9A=35e6yus;b61)4i=Ae*14eDg4p`cXK zU^K^619I~C-qj%Fs?f~{moL;JkxJ)oMiC49r75ujmP7fWuSs$6;@)v6ZKJbhyA?*E z(gN{fi4Ac;334K7uqh0dG)4&tVM}Cb5x!yBVS4%d`bjF$!-Z+8WkbbT>|G=JSy~e# zRO#8k(!D_MK}qT?u^(Zj+Ws>VoB2B6>7nV;Zee=`;Yw8F#hEUL2PL_|w1=e`O5vEm z(&DnivZA)$!}6LzT3L#hf=>yfZnx~H^sT7FBupn1#2<18VO`Vxb4o%GLC=H>*gUT9 z65)N**r6VA!nka^BHg@x3U1rd8o5%W@@I&-O<3#KVD@g=wn(Jv1%Z;S2m9H<3^Zry zX}2r8SzZTpJ27C$9!!~VdTI8B&$`R@$;ga+4q>m6GnqS4u~uun;W5-r{L580~FBh3j8_4HI5-qPbvUod8E?#81)CpFt)hTgZEmUI)hy9$R{+FxZS z5qSm@kVjhf)8ceFiqi`S+jolavY&armJ{ik9!7;A-p^+(csCsRq08|O)_Zz)tc<`v z^K_RmBJ*9x3Xk(1S(MuQL14xzxLz?I35fq%ktm2iT}S;|k;v^%Lm+e!{SrALpPR9A zBH~{nmp8h0a{LFXCczJtH^2Yr0f#Ic0MOp&T$8p4@u>g+ucvY^tvP%7D{{dIu;0Pc zgJXHMo(CPH;TI5p@ef6K`wHOe3zLN<1R%@@1LXF=Fev~4f%+kn5by{o=8TdR#9&J> zJy2ZgeYIgRNI%yk=lo#7)dBt*8#9E>Z^5U_1=rY7C*;* zG?5`Dm~|PdszkMQx&A^pP9`jbYZn-IWP}fCA;zaG7w6+dMuY<#5?r^5PBuosUkVkI z0wKi*j~Q>&gk%ZrPA8-w=%UGnNPY8TNva;pAeU_#Q2;3>b|&nQxG#QEy>yH;z1pEg z4eL-ZLrNGNAYch{7c<&*Of)7pMV6P8mBmC$&M`8bfa0zc!bS#e~e%E}V|^|8o5C2}uK z9mOB0`aOF5@6OwQbL=qJI8!S5sZcU(9+KXsb%uu)Q0;o+iIYal(R|y$|n7! z5w%~+xX1Gl+Q7U`Y)Duv5n~wAml?hY%m5|NMHnSU{u00~^l$4FaLRWV5&G777~%od zEa`DNaq4e>4pkJ)0u3Sy@Fls#4sD*#QT`+JT!&tPJ1Y5auYRqf>JpNgiushGzd#O@ zpmmIm7ct%@nS~n3w3#su8zVpF;g(cVt&6Q=EuwyZ&>}w}laLy?LiPq{R1NCPJ*S|E z#A+l}0W{;r5{XZD1~qDM>zG_Bv&&pkDzhg#6W!ZD$oMUo|CpFH{WG~dLe`Rm6$^UC z+I2vYy#@l59Uz#3=kfz&<1MM{B4$@fTLn;|G6tE6F#?KAiI`c72rW(PU{gQUEV z5_<0a>W+}>!lZTjUOH?i)!VG5DYl3B)C(E2`P-2xf1X5SD1tp!C!nId<6J%p#oi7d zuAD-#b7Aiey#);g+^nzVRPk%XIbPEaPS(pRN>Lmsx@3 zg+NKCaEW{*v{dP=5|y>O@|V$Lz={fxx=Tt`C#bRb>QGT*0Yn=>8Bl5eaw7I0Mvwn2 z$Nu5s<~lqVyW>1LJtS%wwxJbF!lShTotW)c3^dMS#vg>|Ha-Y7Qf3ZuU-h;&(kv5 z7{>KS)54dW5kkMd=WFZi>I(Tw1vgdz2_qqXJ`64N4H6s-8XFuMaP9|*TkU;t^ebtE zkedItPOe(x`$NN*=ZDl!s(An>Tx0e9z?BREuLH|dIHfKItI{>B0aQ4`|}t8k+bcY8OOyd z1=*l=%!`x={9r^`w=U5kV0--CJ*cZlDOsqUf{IF1TFimLD;>XxmcKz< zfx#{z{}m;T&WMERpj=ALH3eH%SgS>Fd^(VhlD5`$Jn`g`?IdEC_0z+!-2_YK;&C>6 zT-roaV_n8Ee#yfojf_!vbygHv393Vytn-X=n%8xKz-Mj+RY%tByRDMNr?4pxTc>P9 z$Ws0Q8bzlnrHn?IRly+BY457pJcti_#B{hy>l#Yw(2z7RuW4tTap#hUAqk4@JZR*j z#1acAWYJ~I)0E z0RTubUq5ibGw~}+>jJ{N`vFdYzp?T1A~uvSpNJ$695r{|lmv`Ib_7Mz_ii$UA8az0shI}6#|Ao}!$S0%Kp8l5&s z%9+3|3bt>-vW{}JfkzEH+;3CIGkO!!yAX0tc1OnT)2nly239%Sft*f1;?qtQsRU}F z6;4naJWoWZL@3&%Cl1h4kw5B+ur70jlVVul+3btH36l)7oGZAwrj%L(j>ke>=N|N7 z5Q)z^%lm-Piw7_cko7d{6N_ha$!>sl7?!g;7b@oTjZ_M*9(76S4F$-R<^pML@|gnc z&g&5+ij`86g=K7ILx`s> z65SisluqcN7M2%!;4o9(^3$`xW=QqZ-g=vT4>KZKneB!W4Rs$sF4GP}823)28nhQVC`0I;3etX|<@B8h2f9HK-?LUVpyQ<&}i6q-Uz3=GfFy*|5giq|e z7lx|hyvuSOkEZaeB+n4kOg8LAdKxb6P7Drm8*?V1-qJ-snGe2WGDWkyLlGL0VVPG{ zx|cbKzIse8kLu2Xb&U6U!O8bc^KHG~TdYeKedhAak^)al`np+a;Y!x=tv`%j|}#5O+5y;t>2M6WYp^nDZ=*+_%vNR6|WOskSz?%K}?AP3wWZbDd9qQ|#QS-P7Sb8>ye{)S4dc>bkJ-WaR(8){gw+?o+p2 zC>)l(FQi1Q;FDsBmx+WQ;N=+Hnts!F`&%YHCBWCc0RVPjp7q0$Qh+{|$M>ugoew!J)-Q0j!^iqnm$@O~Cmc zFJgQV3W=d5hu`5|#)iril46Cy1Gz5aV#makNhL?5C{5g`t#e>Gxdft@Z zxNl_75+o8f3#DMY$1kcy3bZK@6qlq9Nn(-r0<<12xw~b=WRgnKOsHjBC1oESeeOor zncQ1t`aZFwHoYnyRbS#%qh$4Js4!*A;g&VPyh;^bF5>VE8+&9&cin5y<(PhujjTi$ zn=>w1X?mEzcSp}$@G9b70m>WFCgeOI>g$>M^T> ob6cZg4QGf&SDr`dR~s9YR8A_rq{4jpU*FIDQ}hdY>GgR34|=12JOBUy literal 0 HcmV?d00001 diff --git a/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/README.md b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/README.md new file mode 100644 index 0000000000000..e58225476aeb6 --- /dev/null +++ b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/README.md @@ -0,0 +1,233 @@ +--- +comments: true +difficulty: 困难 +edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3219.Minimum%20Cost%20for%20Cutting%20Cake%20II/README.md +--- + + + +# [3219. 切蛋糕的最小总开销 II](https://leetcode.cn/problems/minimum-cost-for-cutting-cake-ii) + +[English Version](/solution/3200-3299/3219.Minimum%20Cost%20for%20Cutting%20Cake%20II/README_EN.md) + +## 题目描述 + + + +

有一个 m x n 大小的矩形蛋糕，需要切成 1 x 1 的小块。

+ +

给你整数 m ，n 和两个数组：

+ +
    +
  • horizontalCut 的大小为 m - 1 ，其中 horizontalCut[i] 表示沿着水平线 i 切蛋糕的开销。
    • +
  • verticalCut 的大小为 n - 1 ，其中 verticalCut[j] 表示沿着垂直线 j 切蛋糕的开销。
    • +
+ +

一次操作中，你可以选择任意不是 1 x 1 大小的矩形蛋糕并执行以下操作之一：

+ +
    +
  1. 沿着水平线 i 切开蛋糕，开销为 horizontalCut[i] 。
    2. +
  2. 沿着垂直线 j 切开蛋糕，开销为 verticalCut[j] 。
    3. +
+ +

每次操作后，这块蛋糕都被切成两个独立的小蛋糕。

+ +

每次操作的开销都为最开始对应切割线的开销，并且不会改变。

+ +

请你返回将蛋糕全部切成 1 x 1 的蛋糕块的 最小 总开销。

+ +

 

+ +

示例 1：

+ +
+

输入：m = 3, n = 2, horizontalCut = [1,3], verticalCut = [5]

+ +

输出：13

+ +

解释：

+ +

+ +
    +
  • 沿着垂直线 0 切开蛋糕，开销为 5 。
    • +
  • 沿着水平线 0 切开 3 x 1 的蛋糕块，开销为 1 。
    • +
  • 沿着水平线 0 切开 3 x 1 的蛋糕块，开销为 1 。
    • +
  • 沿着水平线 1 切开 2 x 1 的蛋糕块，开销为 3 。
    • +
  • 沿着水平线 1 切开 2 x 1 的蛋糕块，开销为 3 。
    • +
+ +

总开销为 5 + 1 + 1 + 3 + 3 = 13 。

+
+ +

示例 2：

+ +
+

输入：m = 2, n = 2, horizontalCut = [7], verticalCut = [4]

+ +

输出：15

+ +

解释：

+ +
    +
  • 沿着水平线 0 切开蛋糕，开销为 7 。
    • +
  • 沿着垂直线 0 切开 1 x 2 的蛋糕块，开销为 4 。
    • +
  • 沿着垂直线 0 切开 1 x 2 的蛋糕块，开销为 4 。
    • +
+ +

总开销为 7 + 4 + 4 = 15 。

+
+ +

 

+ +

提示：

+ +
    +
  • 1 <= m, n <= 105
    • +
  • horizontalCut.length == m - 1
    • +
  • verticalCut.length == n - 1
    • +
  • 1 <= horizontalCut[i], verticalCut[i] <= 103
    • +
+ + + +## 解法 + + + +### 方法一：贪心 + 双指针 + +对于一个位置，越早切，所需要切的次数越少，因此，显然是开销越大的位置越早切。 + +所以，我们可以对数组 $\textit{horizontalCut}$ 和 $\textit{verticalCut}$ 按照从大到小的顺序排序，然后使用两个指针 $i$ 和 $j$ 分别指向 $\textit{horizontalCut}$ 和 $\textit{verticalCut}$ 的开销，每次选择开销较大的位置进行切割，同时更新对应的行数和列数。 + +每次在水平方向上切割时，如果此前列数为 $v$，那么此次的开销为 $\textit{horizontalCut}[i] \times v$，然后行数 $h$ 加一；同理，每次在垂直方向上切割时，如果此前行数为 $h$，那么此次的开销为 $\textit{verticalCut}[j] \times h$，然后列数 $v$ 加一。 + +最后，当 $i$ 和 $j$ 都到达末尾时，返回总开销即可。 + +时间复杂度 $O(m \times \log m + n \times \log n)$，空间复杂度 $O(\log m + \log n)$。其中 $m$ 和 $n$ 分别为 $\textit{horizontalCut}$ 和 $\textit{verticalCut}$ 的长度。 + + + +#### Python3 + +```python +class Solution: + def minimumCost( + self, m: int, n: int, horizontalCut: List[int], verticalCut: List[int] + ) -> int: + horizontalCut.sort(reverse=True) + verticalCut.sort(reverse=True) + ans = i = j = 0 + h = v = 1 + while i < m - 1 or j < n - 1: + if j == n - 1 or (i < m - 1 and horizontalCut[i] > verticalCut[j]): + ans += horizontalCut[i] * v + h, i = h + 1, i + 1 + else: + ans += verticalCut[j] * h + v, j = v + 1, j + 1 + return ans +``` + +#### Java + +```java +class Solution { + public long minimumCost(int m, int n, int[] horizontalCut, int[] verticalCut) { + Arrays.sort(horizontalCut); + Arrays.sort(verticalCut); + long ans = 0; + int i = m - 2, j = n - 2; + int h = 1, v = 1; + while (i >= 0 || j >= 0) { + if (j < 0 || (i >= 0 && horizontalCut[i] > verticalCut[j])) { + ans += 1L * horizontalCut[i--] * v; + ++h; + } else { + ans += 1L * verticalCut[j--] * h; + ++v; + } + } + return ans; + } +} +``` + +#### C++ + +```cpp +class Solution { +public: + long long minimumCost(int m, int n, vector& horizontalCut, vector& verticalCut) { + sort(horizontalCut.rbegin(), horizontalCut.rend()); + sort(verticalCut.rbegin(), verticalCut.rend()); + long long ans = 0; + int i = 0, j = 0; + int h = 1, v = 1; + while (i < m - 1 || j < n - 1) { + if (j == n - 1 || (i < m - 1 && horizontalCut[i] > verticalCut[j])) { + ans += 1LL * horizontalCut[i++] * v; + h++; + } else { + ans += 1LL * verticalCut[j++] * h; + v++; + } + } + return ans; + } +}; +``` + +#### Go + +```go +func minimumCost(m int, n int, horizontalCut []int, verticalCut []int) (ans int64) { + sort.Sort(sort.Reverse(sort.IntSlice(horizontalCut))) + sort.Sort(sort.Reverse(sort.IntSlice(verticalCut))) + i, j := 0, 0 + h, v := 1, 1 + for i < m-1 || j < n-1 { + if j == n-1 || (i < m-1 && horizontalCut[i] > verticalCut[j]) { + ans += int64(horizontalCut[i] * v) + h++ + i++ + } else { + ans += int64(verticalCut[j] * h) + v++ + j++ + } + } + return +} +``` + +#### TypeScript + +```ts +function minimumCost(m: number, n: number, horizontalCut: number[], verticalCut: number[]): number { + horizontalCut.sort((a, b) => b - a); + verticalCut.sort((a, b) => b - a); + let ans = 0; + let [i, j] = [0, 0]; + let [h, v] = [1, 1]; + while (i < m - 1 || j < n - 1) { + if (j === n - 1 || (i < m - 1 && horizontalCut[i] > verticalCut[j])) { + ans += horizontalCut[i] * v; + h++; + i++; + } else { + ans += verticalCut[j] * h; + v++; + j++; + } + } + return ans; +} +``` + + + + + + diff --git a/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/README_EN.md b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/README_EN.md new file mode 100644 index 0000000000000..cfd4ac58c97de --- /dev/null +++ b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/README_EN.md @@ -0,0 +1,231 @@ +--- +comments: true +difficulty: Hard +edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3219.Minimum%20Cost%20for%20Cutting%20Cake%20II/README_EN.md +--- + + + +# [3219. Minimum Cost for Cutting Cake II](https://leetcode.com/problems/minimum-cost-for-cutting-cake-ii) + +[中文文档](/solution/3200-3299/3219.Minimum%20Cost%20for%20Cutting%20Cake%20II/README.md) + +## Description + + + +

There is an m x n cake that needs to be cut into 1 x 1 pieces.

+ +

You are given integers m, n, and two arrays:

+ +
    +
  • horizontalCut of size m - 1, where horizontalCut[i] represents the cost to cut along the horizontal line i.
    • +
  • verticalCut of size n - 1, where verticalCut[j] represents the cost to cut along the vertical line j.
    • +
+ +

In one operation, you can choose any piece of cake that is not yet a 1 x 1 square and perform one of the following cuts:

+ +
    +
  1. Cut along a horizontal line i at a cost of horizontalCut[i].
    2. +
  2. Cut along a vertical line j at a cost of verticalCut[j].
    3. +
+ +

After the cut, the piece of cake is divided into two distinct pieces.

+ +

The cost of a cut depends only on the initial cost of the line and does not change.

+ +

Return the minimum total cost to cut the entire cake into 1 x 1 pieces.

+ +

 

+

Example 1:

+ +
+

Input: m = 3, n = 2, horizontalCut = [1,3], verticalCut = [5]

+ +

Output: 13

+ +

Explanation:

+ +

+ +
    +
  • Perform a cut on the vertical line 0 with cost 5, current total cost is 5.
    • +
  • Perform a cut on the horizontal line 0 on 3 x 1 subgrid with cost 1.
    • +
  • Perform a cut on the horizontal line 0 on 3 x 1 subgrid with cost 1.
    • +
  • Perform a cut on the horizontal line 1 on 2 x 1 subgrid with cost 3.
    • +
  • Perform a cut on the horizontal line 1 on 2 x 1 subgrid with cost 3.
    • +
+ +

The total cost is 5 + 1 + 1 + 3 + 3 = 13.

+
+ +

Example 2:

+ +
+

Input: m = 2, n = 2, horizontalCut = [7], verticalCut = [4]

+ +

Output: 15

+ +

Explanation:

+ +
    +
  • Perform a cut on the horizontal line 0 with cost 7.
    • +
  • Perform a cut on the vertical line 0 on 1 x 2 subgrid with cost 4.
    • +
  • Perform a cut on the vertical line 0 on 1 x 2 subgrid with cost 4.
    • +
+ +

The total cost is 7 + 4 + 4 = 15.

+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m, n <= 105
    • +
  • horizontalCut.length == m - 1
    • +
  • verticalCut.length == n - 1
    • +
  • 1 <= horizontalCut[i], verticalCut[i] <= 103
    • +
+ + + +## Solutions + + + +### Solution 1: Greedy + Two Pointers + +For a given position, the earlier you cut, the fewer cuts are needed, so it is clear that positions with higher costs should be cut earlier. + +Therefore, we can sort the arrays $\textit{horizontalCut}$ and $\textit{verticalCut}$ in descending order, and then use two pointers $i$ and $j$ to point to the costs in $\textit{horizontalCut}$ and $\textit{verticalCut}$, respectively. Each time, we choose the position with the larger cost to cut, while updating the corresponding number of rows and columns. + +Each time a horizontal cut is made, if the number of columns before the cut was $v$, then the cost of this cut is $\textit{horizontalCut}[i] \times v$, and then the number of rows $h$ is incremented by one; similarly, each time a vertical cut is made, if the number of rows before the cut was $h$, then the cost of this cut is $\textit{verticalCut}[j] \times h$, and then the number of columns $v$ is incremented by one. + +Finally, when both $i$ and $j$ reach the end, return the total cost. + +The time complexity is $O(m \times \log m + n \times \log n)$, and the space complexity is $O(\log m + \log n)$. Here, $m$ and $n$ are the lengths of $\textit{horizontalCut}$ and $\textit{verticalCut}$, respectively. + + + +#### Python3 + +```python +class Solution: + def minimumCost( + self, m: int, n: int, horizontalCut: List[int], verticalCut: List[int] + ) -> int: + horizontalCut.sort(reverse=True) + verticalCut.sort(reverse=True) + ans = i = j = 0 + h = v = 1 + while i < m - 1 or j < n - 1: + if j == n - 1 or (i < m - 1 and horizontalCut[i] > verticalCut[j]): + ans += horizontalCut[i] * v + h, i = h + 1, i + 1 + else: + ans += verticalCut[j] * h + v, j = v + 1, j + 1 + return ans +``` + +#### Java + +```java +class Solution { + public long minimumCost(int m, int n, int[] horizontalCut, int[] verticalCut) { + Arrays.sort(horizontalCut); + Arrays.sort(verticalCut); + long ans = 0; + int i = m - 2, j = n - 2; + int h = 1, v = 1; + while (i >= 0 || j >= 0) { + if (j < 0 || (i >= 0 && horizontalCut[i] > verticalCut[j])) { + ans += 1L * horizontalCut[i--] * v; + ++h; + } else { + ans += 1L * verticalCut[j--] * h; + ++v; + } + } + return ans; + } +} +``` + +#### C++ + +```cpp +class Solution { +public: + long long minimumCost(int m, int n, vector& horizontalCut, vector& verticalCut) { + sort(horizontalCut.rbegin(), horizontalCut.rend()); + sort(verticalCut.rbegin(), verticalCut.rend()); + long long ans = 0; + int i = 0, j = 0; + int h = 1, v = 1; + while (i < m - 1 || j < n - 1) { + if (j == n - 1 || (i < m - 1 && horizontalCut[i] > verticalCut[j])) { + ans += 1LL * horizontalCut[i++] * v; + h++; + } else { + ans += 1LL * verticalCut[j++] * h; + v++; + } + } + return ans; + } +}; +``` + +#### Go + +```go +func minimumCost(m int, n int, horizontalCut []int, verticalCut []int) (ans int64) { + sort.Sort(sort.Reverse(sort.IntSlice(horizontalCut))) + sort.Sort(sort.Reverse(sort.IntSlice(verticalCut))) + i, j := 0, 0 + h, v := 1, 1 + for i < m-1 || j < n-1 { + if j == n-1 || (i < m-1 && horizontalCut[i] > verticalCut[j]) { + ans += int64(horizontalCut[i] * v) + h++ + i++ + } else { + ans += int64(verticalCut[j] * h) + v++ + j++ + } + } + return +} +``` + +#### TypeScript + +```ts +function minimumCost(m: number, n: number, horizontalCut: number[], verticalCut: number[]): number { + horizontalCut.sort((a, b) => b - a); + verticalCut.sort((a, b) => b - a); + let ans = 0; + let [i, j] = [0, 0]; + let [h, v] = [1, 1]; + while (i < m - 1 || j < n - 1) { + if (j === n - 1 || (i < m - 1 && horizontalCut[i] > verticalCut[j])) { + ans += horizontalCut[i] * v; + h++; + i++; + } else { + ans += verticalCut[j] * h; + v++; + j++; + } + } + return ans; +} +``` + + + + + + diff --git a/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.cpp b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.cpp new file mode 100644 index 0000000000000..b3e0a8b0b71e4 --- /dev/null +++ b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.cpp @@ -0,0 +1,20 @@ +class Solution { +public: + long long minimumCost(int m, int n, vector& horizontalCut, vector& verticalCut) { + sort(horizontalCut.rbegin(), horizontalCut.rend()); + sort(verticalCut.rbegin(), verticalCut.rend()); + long long ans = 0; + int i = 0, j = 0; + int h = 1, v = 1; + while (i < m - 1 || j < n - 1) { + if (j == n - 1 || (i < m - 1 && horizontalCut[i] > verticalCut[j])) { + ans += 1LL * horizontalCut[i++] * v; + h++; + } else { + ans += 1LL * verticalCut[j++] * h; + v++; + } + } + return ans; + } +}; \ No newline at end of file diff --git a/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.go b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.go new file mode 100644 index 0000000000000..2db1df5d2b306 --- /dev/null +++ b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.go @@ -0,0 +1,18 @@ +func minimumCost(m int, n int, horizontalCut []int, verticalCut []int) (ans int64) { + sort.Sort(sort.Reverse(sort.IntSlice(horizontalCut))) + sort.Sort(sort.Reverse(sort.IntSlice(verticalCut))) + i, j := 0, 0 + h, v := 1, 1 + for i < m-1 || j < n-1 { + if j == n-1 || (i < m-1 && horizontalCut[i] > verticalCut[j]) { + ans += int64(horizontalCut[i] * v) + h++ + i++ + } else { + ans += int64(verticalCut[j] * h) + v++ + j++ + } + } + return +} \ No newline at end of file diff --git a/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.java b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.java new file mode 100644 index 0000000000000..20e2ad7f52c55 --- /dev/null +++ b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.java @@ -0,0 +1,19 @@ +class Solution { + public long minimumCost(int m, int n, int[] horizontalCut, int[] verticalCut) { + Arrays.sort(horizontalCut); + Arrays.sort(verticalCut); + long ans = 0; + int i = m - 2, j = n - 2; + int h = 1, v = 1; + while (i >= 0 || j >= 0) { + if (j < 0 || (i >= 0 && horizontalCut[i] > verticalCut[j])) { + ans += 1L * horizontalCut[i--] * v; + ++h; + } else { + ans += 1L * verticalCut[j--] * h; + ++v; + } + } + return ans; + } +} \ No newline at end of file diff --git a/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.py b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.py new file mode 100644 index 0000000000000..d87eb07238319 --- /dev/null +++ b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.py @@ -0,0 +1,16 @@ +class Solution: + def minimumCost( + self, m: int, n: int, horizontalCut: List[int], verticalCut: List[int] + ) -> int: + horizontalCut.sort(reverse=True) + verticalCut.sort(reverse=True) + ans = i = j = 0 + h = v = 1 + while i < m - 1 or j < n - 1: + if j == n - 1 or (i < m - 1 and horizontalCut[i] > verticalCut[j]): + ans += horizontalCut[i] * v + h, i = h + 1, i + 1 + else: + ans += verticalCut[j] * h + v, j = v + 1, j + 1 + return ans diff --git a/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.ts b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.ts new file mode 100644 index 0000000000000..5069d7b85c340 --- /dev/null +++ b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/Solution.ts @@ -0,0 +1,19 @@ +function minimumCost(m: number, n: number, horizontalCut: number[], verticalCut: number[]): number { + horizontalCut.sort((a, b) => b - a); + verticalCut.sort((a, b) => b - a); + let ans = 0; + let [i, j] = [0, 0]; + let [h, v] = [1, 1]; + while (i < m - 1 || j < n - 1) { + if (j === n - 1 || (i < m - 1 && horizontalCut[i] > verticalCut[j])) { + ans += horizontalCut[i] * v; + h++; + i++; + } else { + ans += verticalCut[j] * h; + v++; + j++; + } + } + return ans; +} diff --git a/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/images/ezgifcom-animated-gif-maker-1.gif b/solution/3200-3299/3219.Minimum Cost for Cutting Cake II/images/ezgifcom-animated-gif-maker-1.gif new file mode 100644 index 0000000000000000000000000000000000000000..6f53ef8b8f9f746fe14559ede8185fdb1d703233 GIT binary patch literal 19367 zcmeI4Wl)@pnyniM?h@SHg1aZUYjAh>;KAM9-5Ymz2-3I&w*+_BkZ{@A*>lcJO`SP& zZq>b2GvNons4l9j`g`hGYrQQlDaOTZfDI-Db_4k12N4kw6B833AD@(zl#-H?fq{XA zg@u=wS4c=mR8&+_Qc_-C{{8#+nwpwAIy(CL`lhC)4h{}(Zf;&)UcSD*fq{V$5fSn6 z@yW@_85tQlIXQWGd1Yl~wY9Yk4GpcWt=-+-eSLkOK79g#Kob)av$L}c3k%E3%WG?E zo12?^dwT~52gk?9S65fp*Vm7akI&D~Eh-ADWu^Z9{@S$EARn)jx!Irp>3{NzV~75gR$07&x046T4bCn-iNmJKH<)Ffy8W zm|2)I7}?n{+89`wI0ESZckx|hxv2pPUiAl*R zscGpMnOWI6xq0~og+;|BrNFZCipr|$n%cVhhQ_Amme#iRj?S*`p5DIxflq@&!y};4 zvGI1C*VEH)CO(@17MG~zR~6|2c=TWC*LLK{0TjDOas&WE%-6)n*W#EFu`0VGn*k^IHbh+qIhy|tMUFkm&XscP}0 zVHj_WK$(*D#p4-VPKT=_^(B+fIYI$&1X2y9(*+Uch+du zpvHHc0G&qUMr93@YgR#m8}GyTgHkvI2H` zKNIU9D`6Y3L(7?`1iQT-ekKeVHFnEmC1s%g5=z7pY8XPB4)Z09K@(;xf-N2<-;1yg zdn=gkFsUGh|MEkDp5Rw(V-||};jL&MLoRZCQ8agQ7D>?lcH+G#EJgC5O4`>*)!^2` zc-gMLJ_z#KFD7YKtE}LT@}>`P2$=M~;~AENlGyZ&2uwm!ZY(7w2KD9uq1*|?L%qC^ zz7dMNI_z+BTq|&#h{EB#B4DwJ&7p-lOuip5JttWz8CYug`Vgl8?r}dqjw5}qJbb*) zucC^@;vlIF7j`$rIJnfj@(t7xUG<>U16{@#oHU)0CTNK+zW<$8Md~=*1HIq$Y3m!N zBtomLW>{T#`lboF_UE0t_Wbh7wi(i+s=CW;D@N8YGrSBP>veReod=Zdww+6dyt^F` zXLR-*aAafWy@2NkyT;XYE&Dzcy{GemZNfTQQw-txH-%4_35g2tLf~XGDd=VR7k$!A3{x)Y8$w0D1t6^i1Weq}?oFfU5>yA)Z#A zaaKAQe5O~>0564>`H*Tff1Y=4BC`1^=$Fhmbo9Q>ke+x94QX(N#=dZ4MP)qiv#L%# z*fKH{!PJ4>w$GkNP345`=yYsTy(n+guicgUr(lUv4$7+gn2 zbssNNdJu}4LL|owaj#N`Wr|r+M#fBeuF|F=i`hyf$1OFl(ig{yIhsetZ9T3sHW5m= zh9oB()2}l3WlDG!MkZX^uCmS}OZfIACq0(0vhT}>4pzo@|W51;gLzn}EKp7ig_SnEtXL5<}L)$;9N0O=-rbsY2Qbe+*A zT0m{;O#bKVWGx+ON0X@_Pnt8`c88rGjV{gc8!|yz6xq($vxcTIWb9oS8X7y|32$`7 znpzcirLv-ebg$E9%neJ>ld=;v)sKYBDLSDz+7*r^8b9t3I^)gQ>UKlicw=a*T?qCQ z5DYbT$X|+$+lX#lWllS5E?lYTCF-c&@vgl77{cBqcQ3M|Q?S#A8yg0dVA*E|=z3b};n-Xd2rFfx?O5&{ekP0N+Z>bKHO`SD4Y@ z>Yic}`dSz4cBs1iuCikKDbwZo#)aLWlO}8KaYbdJ$B zP}68BJ>C=UNnx~Wz9D`U|k$Jkl_ee%;j=;0R62}F4%$uhy(K2|r*HoAH_ z;&;i{FhT7~&oU!QS6Mg7-jClfEhPNL`LhUb=2#u^^AYo`rc-dOBQEc|3w%rnE)HiC z&-t5PJ?JNw0SBs%`dRMLkFLY=X5TO8t+W<6$jnCLn*98nIJqpG%(U+Yq7uH}4|;lb zHmpltWi_v*X{~cE`b2zWUFZMyy?#zrIjZeI5kjDCwMt&b8lDbe|XX8<}6dX8!3BUp0^4NA(E(7S{dqW&MQ5hBi4G#{D&P!)zbfXwOHTh4^G4E3)lCd3S6p48%kzV8ObadE;7g$ zPKFqqEL8}K#{d#>zXwHAANA%U=3}}2TajR5aDY%x0I*(%78d}3iv&PGz7R%XxUD?T z5E6D+48T#-jlm=Tnij-fb zM%WXDOjit%!^nUA+5Bw)GbS9ay+0*C7TfpOnFLT#ku9vX6kbF8>$K(TVyfRy545WL&-Dz4OO$nre!>DI0I$7 z$+_mtw=hPEZUuleT1OZYdA|$_uaZ|7Gue;?vHTm)d8-|jcytqnx(9{5{*)yz1~w0e zefA>gB5yCv@k60%s=G!$Jg1|UX30-Kls%e>HnN@c&>7&ka@GfgaW(=vILdZB(yNP( z@jqN1B^A2*SK)eMoVxY&-x8)iX!>SQbaKNd*7UF z%DlHLYN?2iJ#lJ?e?yq*rY^D=<`+G5+}=&!d)R$_?;`D%=Pw~Ekl3WbxJ~a#%&5e^ z=6xWKzSj;Ht|-+DW~fuor(yXz|MerIW2jiPVEAxB6#G}00u&)6@vT_a^~Eo7%;Xlq ziFOK-gFa5Mu$$3ZxBJGi0`rhXNlLM>qzOFUG^VM_@0LQ-b{x`n;&sr%ifxVBMsPFS z4_aX|<@HB$lAW?O%*g5agl1gbFI$KC$r6`J)5Cl8d%+h)K&1uoj+Vpl5D2mH#STi# zB_*Ne007WWPLrIxtS&vf+?5B-s-#%=z>J{THl41jT42Ts*h~9hMcUsKURF0$+-8|( zBuaPEu;?aw(zs~(egtarQPVnOl#rGob$nhkH#1;H<17PFv*JP@hu7;OJ9s%_ zuOAvIQlk6pgIBdEMqU`ug7E^)Z$a$=uAv0WP)U+VL0|-0K8B=~T8L zX|4M@5`il`)=v^X6%C(dj82?q@ttHv<|xXg*;_@3DxLZ?U9)Z%Uj4wC2lPPidgeGjI{pcx z*^k%kIYh&7@IBd(O+(!eClg5Y3PMr{x&HUB&&{suAzln7pvU;gAG<os}HpYz>~7PLInW8DYdnGp7uhZ0KVX4Jul%1ia&O+ocZN9J@7hIUqqDiz{r9x zL@LDK=p6tLiA)0&6ZLksq8f9%i2Sp8;r3&|Nrgou9CmG2>qla7oYlZb{l6WR7Sga`onl41#Jk8l#&KA_G)0h@TsHO ziZKNXT^g%{s&d8--!3nHHe9x%UKu-(avF%Ogul_k&fjA;^E9!PgPm3(E_^oUaxP7F z^FZ+fXf9pu15l>Z^1Z=fa3xP8Q1>%Xv7c5o=Te3CA0z1TrrH;=LLXXsu@CpQCRDb< z5NmXCkmt5GHmbsyN_q*Td0Uq{USY~Px-{W&Tc3+qX)Z3kJd=LgP%2w#sW!Si-*($r z3IqPnc-C*o{ewj9H{|{&Ku$n00AY;d=(v7L>;-ajs#cW<>}=}RWFtJa$Bmo8bf+!j zrWy0<`^DwY3>-<;HDwqZ@pNY$SLs&fc_jnVXI)Q9R@GS{$@zBOudtr%5>{x%t$N(@ zm&^JQkZDT>bSW$72JYvVDF-pM5Gn@YoH}0R*3YClq!SYHhUG%0uQK-$pDnKsyivoy z8bZZtJ|96Wf2x_}<}5xL7YY!opJG@*V4AeT%t{>#jeT05dMnIN^jYSJ{?bnskMw3% zTsW0&=C12$dtTCupC!*U;Gkhf1Rd{gmDX_0WtL`Chke;+8S!q(&S{)8C_rnG-GX%hxI^dxu&q7f<^bWoS}U;*E}-rHsV-LLKhcndE4V14Lc;( z-5SBZ=elFxg)Wza;*0FIK%hWUBf{3pfmwd`Gds%D$FE~VdLJ(*0-~Nk zGh1@*x9xU<>UZONNIx$3o`1n`qE?UIoA4J5H;-_a?GJIGS>*Zqu05Gt@px^+$ zC=ziW%KLT6RAYUuU+F`T7p_5lR)={V+VhH0XcL~QRAlPYGm}&aUd-7gOy~x|7Z>FL zEdtTK?yi&C*t*sNB3bngTC~gPXLj_G}?JJgIoX?rx~n595Umd>TOE@fA#Ong){ z39S;7V9J?#UL_P;Mq_rt*2$+&MRZ4!ul&6obH5!^2vy=Js65W3-LdWA;z&(v3d}`E z6`H+^nU#sem5jffBbTU_lni7*cObJV6@ULY9LwXJw|7rY!!rsy8TD9_v#f0*+P^om zS?FBCK5oJ0cQ~03VlLf!LX^94pV_B>pGy=36oDs;DpL}|#b~j7|KeHZ=1EW*CuQoj z;h(Fclgc}}t<<`4RT~|XDosC>tBumC2C%%Xuz@VsZcbll0X0^8HkRRmOE0vdVOCi4 z(;JS^ssg$GdyuP%sv~?X_S%183?m?`w50PH|ihI{GEL-K6GP=6U zbJsc*RpneFy>^&S`j_Cb{6oR}-`6IMe!=^zP2$JBMgl0vXUvBkhLx#st8$xkKAM(O zR%~w*PF!}642xQ#(w%`n@Cr{*5~G?5<1uV`E4!H$5-nmgMLLL&^iHd$$h!L z_pk3aeY-`mGlS%0)SvS{V&{MP;*S&_k{d=0b#D+l=CC*riqo|BRhKpX{gxhQaZ-UH zZ`>^{cuSvxy+UZog6#CI4g~_%82W#of4F`Hj)Jo;h z$FX`@){k=9Fj%U#ngk?0K8HxZCUxej}eDRV=;L}#jiFiDvryDplJ{oPJxz`bb zk7?5t0<9%cD}?`k<>Ik(c*}^Y>moQ(OF(lkMBM)Yg@=s4b^SJ2x9QN#v&wGW$!X$o zxr)s8nX9X@9HITIPQj0xlSIMQy0g|<%+`a5Ndb?elA&nk^8qsXi{mJI`Sx8U;XlL2 zcVBwRWcUewaZaK2GAf7pSGCnrujhsLSG6U0&5pN$|1KAa#4Ql_D@5*8pIYc^dca3a z^&IdhN+F&aA+SF}$R9&J0J&I{*8m|%E^K~?+M_^f5iD}mDPJUnJV;Dt12{9csx8QU?#YI^q5@Ls#47PlFRb03O92%z$A0as0RNvk8_ByEne>+}6QpNn2z$a`xTYNq zRnjk4&B@i*h{nOUH`I=|zhA{vWMBDk`i@{ybTb*@Ylu5%jRCPt1bpxR3Yg!-W`WUNz zAXS|A!C}#l^g^LgUJPIuU1=a9m{nYKB8mSb-~mJDcCvL{Gqq>L35bp=t|B2Oc-4F? zx@eguKjd-A%!-t^eRx#bzKm?5ES}3Lmz%DQH8%oI%4t>-@B8(P3U3r!qWDqzhtG;b zZZ}z4ba*ZcVN%~4Cw*abV5fAV3D}myYEJ6Lg(uyc3S8wYDbo~;DmkNUH=gcR{1&pB z{p?Frxnd%|Epo+%5s`9k@uZCJZ*mC;s7iTkQEhdL^RPChGuuysxjk8w1;mvc=7eLUS*tG@abulR&-Ekzt znd5QZmVn55w~lPbezSS^q4T)FDu(mn*wg#RE{ICc{eB`P$Nk20Yoq-lY7U8i<8XH4 z0b=XW{2!N0us($VZF8zqeTKHLh82s7Mp@@o;PDMB?_`%4W z`y;c=BwQC5I>KOsgo;l-o;u|cjGIb6I9&LoMy@~#;z$e5p?V(_?2t-pNMFV(dA+I2 zqcNcw)BRDES}j9?5&~>7!BzGcw%&pG5H=vFq@32eWx^7}EvS#Hkgl^@Y+?$OwdY{X zSWnDlPokE)5_QTt&|bga4C8g;I8TFcHsyVDKVkLgl-XUex3fIb_kE`>(|5ou?=fu3 z=cPXbU&|6WNfY!Bzf44kqGJ6BtLP5plz)9)Dn^H+q^2~N`%Q&df&h0qxbCX(6uEI< ztd&MNh%h9ROxD6&L1X&3_Bx)2KvqoaaXenmp?FFgDD4z3?Tq$5ORz{=Aq=QejGI&@ z_nJl}#iJXTjb02nKAX|7JY3H4x&n(IQ7$K4_52(o7rK!aveU9NFa9;K&D~1I#Hp<7 zg<|?o2!F(s(n0TGgI;3FqA$Upc#>;8!v6V~@?SAH&AYb6@hX>(sIUHQLil?Y`1iBG zzenJq>CdJP?L8zwqcsHafYz+nwe`{P$bfg{eBh(TL!ihC)QsJyVcnWDS zn6{L;Q>?^hS6?VpKYOTPXEU#;8QJ9^(~>_MZl8uC(hYMd+3=6uU_SlqVzb)JjUJP~ zDt9w8`^D6b@Z+^h+eU_V39I)9w~oE>Vl^dQxo=BH2^}G6e@AV5ckbgBh%(@9A=35e6yus;b61)4i=Ae*14eDg4p`cXK zU^K^619I~C-qj%Fs?f~{moL;JkxJ)oMiC49r75ujmP7fWuSs$6;@)v6ZKJbhyA?*E z(gN{fi4Ac;334K7uqh0dG)4&tVM}Cb5x!yBVS4%d`bjF$!-Z+8WkbbT>|G=JSy~e# zRO#8k(!D_MK}qT?u^(Zj+Ws>VoB2B6>7nV;Zee=`;Yw8F#hEUL2PL_|w1=e`O5vEm z(&DnivZA)$!}6LzT3L#hf=>yfZnx~H^sT7FBupn1#2<18VO`Vxb4o%GLC=H>*gUT9 z65)N**r6VA!nka^BHg@x3U1rd8o5%W@@I&-O<3#KVD@g=wn(Jv1%Z;S2m9H<3^Zry zX}2r8SzZTpJ27C$9!!~VdTI8B&$`R@$;ga+4q>m6GnqS4u~uun;W5-r{L580~FBh3j8_4HI5-qPbvUod8E?#81)CpFt)hTgZEmUI)hy9$R{+FxZS z5qSm@kVjhf)8ceFiqi`S+jolavY&armJ{ik9!7;A-p^+(csCsRq08|O)_Zz)tc<`v z^K_RmBJ*9x3Xk(1S(MuQL14xzxLz?I35fq%ktm2iT}S;|k;v^%Lm+e!{SrALpPR9A zBH~{nmp8h0a{LFXCczJtH^2Yr0f#Ic0MOp&T$8p4@u>g+ucvY^tvP%7D{{dIu;0Pc zgJXHMo(CPH;TI5p@ef6K`wHOe3zLN<1R%@@1LXF=Fev~4f%+kn5by{o=8TdR#9&J> zJy2ZgeYIgRNI%yk=lo#7)dBt*8#9E>Z^5U_1=rY7C*;* zG?5`Dm~|PdszkMQx&A^pP9`jbYZn-IWP}fCA;zaG7w6+dMuY<#5?r^5PBuosUkVkI z0wKi*j~Q>&gk%ZrPA8-w=%UGnNPY8TNva;pAeU_#Q2;3>b|&nQxG#QEy>yH;z1pEg z4eL-ZLrNGNAYch{7c<&*Of)7pMV6P8mBmC$&M`8bfa0zc!bS#e~e%E}V|^|8o5C2}uK z9mOB0`aOF5@6OwQbL=qJI8!S5sZcU(9+KXsb%uu)Q0;o+iIYal(R|y$|n7! z5w%~+xX1Gl+Q7U`Y)Duv5n~wAml?hY%m5|NMHnSU{u00~^l$4FaLRWV5&G777~%od zEa`DNaq4e>4pkJ)0u3Sy@Fls#4sD*#QT`+JT!&tPJ1Y5auYRqf>JpNgiushGzd#O@ zpmmIm7ct%@nS~n3w3#su8zVpF;g(cVt&6Q=EuwyZ&>}w}laLy?LiPq{R1NCPJ*S|E z#A+l}0W{;r5{XZD1~qDM>zG_Bv&&pkDzhg#6W!ZD$oMUo|CpFH{WG~dLe`Rm6$^UC z+I2vYy#@l59Uz#3=kfz&<1MM{B4$@fTLn;|G6tE6F#?KAiI`c72rW(PU{gQUEV z5_<0a>W+}>!lZTjUOH?i)!VG5DYl3B)C(E2`P-2xf1X5SD1tp!C!nId<6J%p#oi7d zuAD-#b7Aiey#);g+^nzVRPk%XIbPEaPS(pRN>Lmsx@3 zg+NKCaEW{*v{dP=5|y>O@|V$Lz={fxx=Tt`C#bRb>QGT*0Yn=>8Bl5eaw7I0Mvwn2 z$Nu5s<~lqVyW>1LJtS%wwxJbF!lShTotW)c3^dMS#vg>|Ha-Y7Qf3ZuU-h;&(kv5 z7{>KS)54dW5kkMd=WFZi>I(Tw1vgdz2_qqXJ`64N4H6s-8XFuMaP9|*TkU;t^ebtE zkedItPOe(x`$NN*=ZDl!s(An>Tx0e9z?BREuLH|dIHfKItI{>B0aQ4`|}t8k+bcY8OOyd z1=*l=%!`x={9r^`w=U5kV0--CJ*cZlDOsqUf{IF1TFimLD;>XxmcKz< zfx#{z{}m;T&WMERpj=ALH3eH%SgS>Fd^(VhlD5`$Jn`g`?IdEC_0z+!-2_YK;&C>6 zT-roaV_n8Ee#yfojf_!vbygHv393Vytn-X=n%8xKz-Mj+RY%tByRDMNr?4pxTc>P9 z$Ws0Q8bzlnrHn?IRly+BY457pJcti_#B{hy>l#Yw(2z7RuW4tTap#hUAqk4@JZR*j z#1acAWYJ~I)0E z0RTubUq5ibGw~}+>jJ{N`vFdYzp?T1A~uvSpNJ$695r{|lmv`Ib_7Mz_ii$UA8az0shI}6#|Ao}!$S0%Kp8l5&s z%9+3|3bt>-vW{}JfkzEH+;3CIGkO!!yAX0tc1OnT)2nly239%Sft*f1;?qtQsRU}F z6;4naJWoWZL@3&%Cl1h4kw5B+ur70jlVVul+3btH36l)7oGZAwrj%L(j>ke>=N|N7 z5Q)z^%lm-Piw7_cko7d{6N_ha$!>sl7?!g;7b@oTjZ_M*9(76S4F$-R<^pML@|gnc z&g&5+ij`86g=K7ILx`s> z65SisluqcN7M2%!;4o9(^3$`xW=QqZ-g=vT4>KZKneB!W4Rs$sF4GP}823)28nhQVC`0I;3etX|<@B8h2f9HK-?LUVpyQ<&}i6q-Uz3=GfFy*|5giq|e z7lx|hyvuSOkEZaeB+n4kOg8LAdKxb6P7Drm8*?V1-qJ-snGe2WGDWkyLlGL0VVPG{ zx|cbKzIse8kLu2Xb&U6U!O8bc^KHG~TdYeKedhAak^)al`np+a;Y!x=tv`%j|}#5O+5y;t>2M6WYp^nDZ=*+_%vNR6|WOskSz?%K}?AP3wWZbDd9qQ|#QS-P7Sb8>ye{)S4dc>bkJ-WaR(8){gw+?o+p2 zC>)l(FQi1Q;FDsBmx+WQ;N=+Hnts!F`&%YHCBWCc0RVPjp7q0$Qh+{|$M>ugoew!J)-Q0j!^iqnm$@O~Cmc zFJgQV3W=d5hu`5|#)iril46Cy1Gz5aV#makNhL?5C{5g`t#e>Gxdft@Z zxNl_75+o8f3#DMY$1kcy3bZK@6qlq9Nn(-r0<<12xw~b=WRgnKOsHjBC1oESeeOor zncQ1t`aZFwHoYnyRbS#%qh$4Js4!*A;g&VPyh;^bF5>VE8+&9&cin5y<(PhujjTi$ zn=>w1X?mEzcSp}$@G9b70m>WFCgeOI>g$>M^T> ob6cZg4QGf&SDr`dR~s9YR8A_rq{4jpU*FIDQ}hdY>GgR34|=12JOBUy literal 0 HcmV?d00001 diff --git a/solution/CONTEST_README.md b/solution/CONTEST_README.md index b42fec17fde8c..56208e83362d6 100644 --- a/solution/CONTEST_README.md +++ b/solution/CONTEST_README.md @@ -26,6 +26,13 @@ comments: true ## 往期竞赛 +#### 第 406 场周赛(2024-07-14 10:30, 90 分钟) 参赛人数 3421 + +- [3216. 交换后字典序最小的字符串](/solution/3200-3299/3216.Lexicographically%20Smallest%20String%20After%20a%20Swap/README.md) +- [3217. 从链表中移除在数组中存在的节点](/solution/3200-3299/3217.Delete%20Nodes%20From%20Linked%20List%20Present%20in%20Array/README.md) +- [3218. 切蛋糕的最小总开销 I](/solution/3200-3299/3218.Minimum%20Cost%20for%20Cutting%20Cake%20I/README.md) +- [3219. 切蛋糕的最小总开销 II](/solution/3200-3299/3219.Minimum%20Cost%20for%20Cutting%20Cake%20II/README.md) + #### 第 405 场周赛(2024-07-07 10:30, 90 分钟) 参赛人数 3240 - [3210. 找出加密后的字符串](/solution/3200-3299/3210.Find%20the%20Encrypted%20String/README.md) diff --git a/solution/CONTEST_README_EN.md b/solution/CONTEST_README_EN.md index d89253eaced4b..c68815eb1b10b 100644 --- a/solution/CONTEST_README_EN.md +++ b/solution/CONTEST_README_EN.md @@ -29,6 +29,13 @@ If you want to estimate your score changes after the contest ends, you can visit ## Past Contests +#### Weekly Contest 406 + +- [3216. Lexicographically Smallest String After a Swap](/solution/3200-3299/3216.Lexicographically%20Smallest%20String%20After%20a%20Swap/README_EN.md) +- [3217. Delete Nodes From Linked List Present in Array](/solution/3200-3299/3217.Delete%20Nodes%20From%20Linked%20List%20Present%20in%20Array/README_EN.md) +- [3218. Minimum Cost for Cutting Cake I](/solution/3200-3299/3218.Minimum%20Cost%20for%20Cutting%20Cake%20I/README_EN.md) +- [3219. Minimum Cost for Cutting Cake II](/solution/3200-3299/3219.Minimum%20Cost%20for%20Cutting%20Cake%20II/README_EN.md) + #### Weekly Contest 405 - [3210. Find the Encrypted String](/solution/3200-3299/3210.Find%20the%20Encrypted%20String/README_EN.md) diff --git a/solution/README.md b/solution/README.md index 9a26e3b72cde8..0a4c9bc30b211 100644 --- a/solution/README.md +++ b/solution/README.md @@ -3226,6 +3226,10 @@ | 3213 | [最小代价构造字符串](/solution/3200-3299/3213.Construct%20String%20with%20Minimum%20Cost/README.md) | `数组`,`字符串`,`动态规划`,`后缀数组` | 困难 | 第 405 场周赛 | | 3214 | [同比增长率](/solution/3200-3299/3214.Year%20on%20Year%20Growth%20Rate/README.md) | `数据库` | 困难 | 🔒 | | 3215 | [用偶数异或设置位计数三元组 II](/solution/3200-3299/3215.Count%20Triplets%20with%20Even%20XOR%20Set%20Bits%20II/README.md) | | 中等 | 🔒 | +| 3216 | [交换后字典序最小的字符串](/solution/3200-3299/3216.Lexicographically%20Smallest%20String%20After%20a%20Swap/README.md) | | 简单 | 第 406 场周赛 | +| 3217 | [从链表中移除在数组中存在的节点](/solution/3200-3299/3217.Delete%20Nodes%20From%20Linked%20List%20Present%20in%20Array/README.md) | | 中等 | 第 406 场周赛 | +| 3218 | [切蛋糕的最小总开销 I](/solution/3200-3299/3218.Minimum%20Cost%20for%20Cutting%20Cake%20I/README.md) | | 中等 | 第 406 场周赛 | +| 3219 | [切蛋糕的最小总开销 II](/solution/3200-3299/3219.Minimum%20Cost%20for%20Cutting%20Cake%20II/README.md) | | 困难 | 第 406 场周赛 | ## 版权 diff --git a/solution/README_EN.md b/solution/README_EN.md index 9c6f4a0d1b665..1e25425af4baa 100644 --- a/solution/README_EN.md +++ b/solution/README_EN.md @@ -3224,6 +3224,10 @@ Press Control + F(or Command + F on | 3213 | [Construct String with Minimum Cost](/solution/3200-3299/3213.Construct%20String%20with%20Minimum%20Cost/README_EN.md) | `Array`,`String`,`Dynamic Programming`,`Suffix Array` | Hard | Weekly Contest 405 | | 3214 | [Year on Year Growth Rate](/solution/3200-3299/3214.Year%20on%20Year%20Growth%20Rate/README_EN.md) | `Database` | Hard | 🔒 | | 3215 | [Count Triplets with Even XOR Set Bits II](/solution/3200-3299/3215.Count%20Triplets%20with%20Even%20XOR%20Set%20Bits%20II/README_EN.md) | | Medium | 🔒 | +| 3216 | [Lexicographically Smallest String After a Swap](/solution/3200-3299/3216.Lexicographically%20Smallest%20String%20After%20a%20Swap/README_EN.md) | | Easy | Weekly Contest 406 | +| 3217 | [Delete Nodes From Linked List Present in Array](/solution/3200-3299/3217.Delete%20Nodes%20From%20Linked%20List%20Present%20in%20Array/README_EN.md) | | Medium | Weekly Contest 406 | +| 3218 | [Minimum Cost for Cutting Cake I](/solution/3200-3299/3218.Minimum%20Cost%20for%20Cutting%20Cake%20I/README_EN.md) | | Medium | Weekly Contest 406 | +| 3219 | [Minimum Cost for Cutting Cake II](/solution/3200-3299/3219.Minimum%20Cost%20for%20Cutting%20Cake%20II/README_EN.md) | | Hard | Weekly Contest 406 | ## Copyright diff --git a/solution/contest.json b/solution/contest.json index a1d8e85f2de0a..83134041b1e37 100644 --- a/solution/contest.json +++ b/solution/contest.json @@ -1 +1 @@ -[{"contest_title": "\u7b2c 83 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 83", "contest_title_slug": "weekly-contest-83", "contest_id": 5, "contest_start_time": 1525570200, "contest_duration": 5400, "user_num": 58, "question_slugs": ["positions-of-large-groups", "masking-personal-information", "consecutive-numbers-sum", "count-unique-characters-of-all-substrings-of-a-given-string"]}, {"contest_title": "\u7b2c 84 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 84", "contest_title_slug": "weekly-contest-84", "contest_id": 6, "contest_start_time": 1526175000, "contest_duration": 5400, "user_num": 656, "question_slugs": ["flipping-an-image", "find-and-replace-in-string", "image-overlap", "sum-of-distances-in-tree"]}, {"contest_title": "\u7b2c 85 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 85", "contest_title_slug": "weekly-contest-85", "contest_id": 7, "contest_start_time": 1526779800, "contest_duration": 5400, "user_num": 467, "question_slugs": ["rectangle-overlap", "push-dominoes", "new-21-game", "similar-string-groups"]}, {"contest_title": "\u7b2c 87 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 87", "contest_title_slug": "weekly-contest-87", "contest_id": 9, "contest_start_time": 1527989400, "contest_duration": 5400, "user_num": 343, "question_slugs": ["backspace-string-compare", "longest-mountain-in-array", "hand-of-straights", "shortest-path-visiting-all-nodes"]}, {"contest_title": "\u7b2c 88 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 88", "contest_title_slug": "weekly-contest-88", "contest_id": 11, "contest_start_time": 1528594200, "contest_duration": 5400, "user_num": 404, "question_slugs": ["shifting-letters", "maximize-distance-to-closest-person", "loud-and-rich", "rectangle-area-ii"]}, {"contest_title": "\u7b2c 89 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 89", "contest_title_slug": "weekly-contest-89", "contest_id": 12, "contest_start_time": 1529199000, "contest_duration": 5400, "user_num": 491, "question_slugs": ["peak-index-in-a-mountain-array", "car-fleet", "exam-room", "k-similar-strings"]}, {"contest_title": "\u7b2c 91 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 91", "contest_title_slug": "weekly-contest-91", "contest_id": 14, "contest_start_time": 1530408600, "contest_duration": 5400, "user_num": 578, "question_slugs": ["lemonade-change", "all-nodes-distance-k-in-binary-tree", "score-after-flipping-matrix", "shortest-subarray-with-sum-at-least-k"]}, {"contest_title": "\u7b2c 92 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 92", "contest_title_slug": "weekly-contest-92", "contest_id": 15, "contest_start_time": 1531013400, "contest_duration": 5400, "user_num": 610, "question_slugs": ["transpose-matrix", "smallest-subtree-with-all-the-deepest-nodes", "prime-palindrome", "shortest-path-to-get-all-keys"]}, {"contest_title": "\u7b2c 93 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 93", "contest_title_slug": "weekly-contest-93", "contest_id": 16, "contest_start_time": 1531618200, "contest_duration": 5400, "user_num": 732, "question_slugs": ["binary-gap", "reordered-power-of-2", "advantage-shuffle", "minimum-number-of-refueling-stops"]}, {"contest_title": "\u7b2c 94 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 94", "contest_title_slug": "weekly-contest-94", "contest_id": 17, "contest_start_time": 1532223000, "contest_duration": 5400, "user_num": 733, "question_slugs": ["leaf-similar-trees", "walking-robot-simulation", "koko-eating-bananas", "length-of-longest-fibonacci-subsequence"]}, {"contest_title": "\u7b2c 95 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 95", "contest_title_slug": "weekly-contest-95", "contest_id": 18, "contest_start_time": 1532827800, "contest_duration": 5400, "user_num": 831, "question_slugs": ["middle-of-the-linked-list", "stone-game", "nth-magical-number", "profitable-schemes"]}, {"contest_title": "\u7b2c 96 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 96", "contest_title_slug": "weekly-contest-96", "contest_id": 19, "contest_start_time": 1533432600, "contest_duration": 5400, "user_num": 789, "question_slugs": ["projection-area-of-3d-shapes", "boats-to-save-people", "decoded-string-at-index", "reachable-nodes-in-subdivided-graph"]}, {"contest_title": "\u7b2c 97 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 97", "contest_title_slug": "weekly-contest-97", "contest_id": 20, "contest_start_time": 1534037400, "contest_duration": 5400, "user_num": 635, "question_slugs": ["uncommon-words-from-two-sentences", "spiral-matrix-iii", "possible-bipartition", "super-egg-drop"]}, {"contest_title": "\u7b2c 98 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 98", "contest_title_slug": "weekly-contest-98", "contest_id": 21, "contest_start_time": 1534642200, "contest_duration": 5400, "user_num": 670, "question_slugs": ["fair-candy-swap", "find-and-replace-pattern", "construct-binary-tree-from-preorder-and-postorder-traversal", "sum-of-subsequence-widths"]}, {"contest_title": "\u7b2c 99 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 99", "contest_title_slug": "weekly-contest-99", "contest_id": 22, "contest_start_time": 1535247000, "contest_duration": 5400, "user_num": 725, "question_slugs": ["surface-area-of-3d-shapes", "groups-of-special-equivalent-strings", "all-possible-full-binary-trees", "maximum-frequency-stack"]}, {"contest_title": "\u7b2c 100 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 100", "contest_title_slug": "weekly-contest-100", "contest_id": 23, "contest_start_time": 1535851800, "contest_duration": 5400, "user_num": 718, "question_slugs": ["monotonic-array", "increasing-order-search-tree", "bitwise-ors-of-subarrays", "orderly-queue"]}, {"contest_title": "\u7b2c 101 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 101", "contest_title_slug": "weekly-contest-101", "contest_id": 24, "contest_start_time": 1536456600, "contest_duration": 6300, "user_num": 854, "question_slugs": ["rle-iterator", "online-stock-span", "numbers-at-most-n-given-digit-set", "valid-permutations-for-di-sequence"]}, {"contest_title": "\u7b2c 102 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 102", "contest_title_slug": "weekly-contest-102", "contest_id": 25, "contest_start_time": 1537061400, "contest_duration": 5400, "user_num": 660, "question_slugs": ["sort-array-by-parity", "fruit-into-baskets", "sum-of-subarray-minimums", "super-palindromes"]}, {"contest_title": "\u7b2c 103 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 103", "contest_title_slug": "weekly-contest-103", "contest_id": 26, "contest_start_time": 1537666200, "contest_duration": 5400, "user_num": 575, "question_slugs": ["smallest-range-i", "snakes-and-ladders", "smallest-range-ii", "online-election"]}, {"contest_title": "\u7b2c 104 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 104", "contest_title_slug": "weekly-contest-104", "contest_id": 27, "contest_start_time": 1538271000, "contest_duration": 5400, "user_num": 354, "question_slugs": ["x-of-a-kind-in-a-deck-of-cards", "partition-array-into-disjoint-intervals", "word-subsets", "cat-and-mouse"]}, {"contest_title": "\u7b2c 105 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 105", "contest_title_slug": "weekly-contest-105", "contest_id": 28, "contest_start_time": 1538875800, "contest_duration": 5400, "user_num": 393, "question_slugs": ["reverse-only-letters", "maximum-sum-circular-subarray", "complete-binary-tree-inserter", "number-of-music-playlists"]}, {"contest_title": "\u7b2c 106 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 106", "contest_title_slug": "weekly-contest-106", "contest_id": 29, "contest_start_time": 1539480600, "contest_duration": 5400, "user_num": 369, "question_slugs": ["sort-array-by-parity-ii", "minimum-add-to-make-parentheses-valid", "3sum-with-multiplicity", "minimize-malware-spread"]}, {"contest_title": "\u7b2c 107 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 107", "contest_title_slug": "weekly-contest-107", "contest_id": 30, "contest_start_time": 1540085400, "contest_duration": 5400, "user_num": 504, "question_slugs": ["long-pressed-name", "flip-string-to-monotone-increasing", "three-equal-parts", "minimize-malware-spread-ii"]}, {"contest_title": "\u7b2c 108 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 108", "contest_title_slug": "weekly-contest-108", "contest_id": 31, "contest_start_time": 1540690200, "contest_duration": 5400, "user_num": 524, "question_slugs": ["unique-email-addresses", "binary-subarrays-with-sum", "minimum-falling-path-sum", "beautiful-array"]}, {"contest_title": "\u7b2c 109 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 109", "contest_title_slug": "weekly-contest-109", "contest_id": 32, "contest_start_time": 1541295000, "contest_duration": 5400, "user_num": 439, "question_slugs": ["number-of-recent-calls", "knight-dialer", "shortest-bridge", "stamping-the-sequence"]}, {"contest_title": "\u7b2c 110 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 110", "contest_title_slug": "weekly-contest-110", "contest_id": 33, "contest_start_time": 1541903400, "contest_duration": 5400, "user_num": 346, "question_slugs": ["reorder-data-in-log-files", "range-sum-of-bst", "minimum-area-rectangle", "distinct-subsequences-ii"]}, {"contest_title": "\u7b2c 111 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 111", "contest_title_slug": "weekly-contest-111", "contest_id": 34, "contest_start_time": 1542508200, "contest_duration": 5400, "user_num": 353, "question_slugs": ["valid-mountain-array", "delete-columns-to-make-sorted", "di-string-match", "find-the-shortest-superstring"]}, {"contest_title": "\u7b2c 112 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 112", "contest_title_slug": "weekly-contest-112", "contest_id": 35, "contest_start_time": 1543113000, "contest_duration": 5400, "user_num": 299, "question_slugs": ["minimum-increment-to-make-array-unique", "validate-stack-sequences", "most-stones-removed-with-same-row-or-column", "bag-of-tokens"]}, {"contest_title": "\u7b2c 113 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 113", "contest_title_slug": "weekly-contest-113", "contest_id": 36, "contest_start_time": 1543717800, "contest_duration": 5400, "user_num": 462, "question_slugs": ["largest-time-for-given-digits", "flip-equivalent-binary-trees", "reveal-cards-in-increasing-order", "largest-component-size-by-common-factor"]}, {"contest_title": "\u7b2c 114 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 114", "contest_title_slug": "weekly-contest-114", "contest_id": 37, "contest_start_time": 1544322600, "contest_duration": 5400, "user_num": 391, "question_slugs": ["verifying-an-alien-dictionary", "array-of-doubled-pairs", "delete-columns-to-make-sorted-ii", "tallest-billboard"]}, {"contest_title": "\u7b2c 115 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 115", "contest_title_slug": "weekly-contest-115", "contest_id": 38, "contest_start_time": 1544927400, "contest_duration": 5400, "user_num": 383, "question_slugs": ["prison-cells-after-n-days", "check-completeness-of-a-binary-tree", "regions-cut-by-slashes", "delete-columns-to-make-sorted-iii"]}, {"contest_title": "\u7b2c 116 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 116", "contest_title_slug": "weekly-contest-116", "contest_id": 39, "contest_start_time": 1545532200, "contest_duration": 5400, "user_num": 369, "question_slugs": ["n-repeated-element-in-size-2n-array", "maximum-width-ramp", "minimum-area-rectangle-ii", "least-operators-to-express-number"]}, {"contest_title": "\u7b2c 117 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 117", "contest_title_slug": "weekly-contest-117", "contest_id": 41, "contest_start_time": 1546137000, "contest_duration": 5400, "user_num": 657, "question_slugs": ["univalued-binary-tree", "numbers-with-same-consecutive-differences", "vowel-spellchecker", "binary-tree-cameras"]}, {"contest_title": "\u7b2c 118 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 118", "contest_title_slug": "weekly-contest-118", "contest_id": 42, "contest_start_time": 1546741800, "contest_duration": 5400, "user_num": 383, "question_slugs": ["powerful-integers", "pancake-sorting", "flip-binary-tree-to-match-preorder-traversal", "equal-rational-numbers"]}, {"contest_title": "\u7b2c 119 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 119", "contest_title_slug": "weekly-contest-119", "contest_id": 43, "contest_start_time": 1547346600, "contest_duration": 5400, "user_num": 513, "question_slugs": ["k-closest-points-to-origin", "largest-perimeter-triangle", "subarray-sums-divisible-by-k", "odd-even-jump"]}, {"contest_title": "\u7b2c 120 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 120", "contest_title_slug": "weekly-contest-120", "contest_id": 44, "contest_start_time": 1547951400, "contest_duration": 5400, "user_num": 382, "question_slugs": ["squares-of-a-sorted-array", "longest-turbulent-subarray", "distribute-coins-in-binary-tree", "unique-paths-iii"]}, {"contest_title": "\u7b2c 121 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 121", "contest_title_slug": "weekly-contest-121", "contest_id": 45, "contest_start_time": 1548556200, "contest_duration": 5400, "user_num": 384, "question_slugs": ["string-without-aaa-or-bbb", "time-based-key-value-store", "minimum-cost-for-tickets", "triples-with-bitwise-and-equal-to-zero"]}, {"contest_title": "\u7b2c 122 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 122", "contest_title_slug": "weekly-contest-122", "contest_id": 46, "contest_start_time": 1549161000, "contest_duration": 5400, "user_num": 280, "question_slugs": ["sum-of-even-numbers-after-queries", "smallest-string-starting-from-leaf", "interval-list-intersections", "vertical-order-traversal-of-a-binary-tree"]}, {"contest_title": "\u7b2c 123 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 123", "contest_title_slug": "weekly-contest-123", "contest_id": 47, "contest_start_time": 1549765800, "contest_duration": 5400, "user_num": 247, "question_slugs": ["add-to-array-form-of-integer", "satisfiability-of-equality-equations", "broken-calculator", "subarrays-with-k-different-integers"]}, {"contest_title": "\u7b2c 124 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 124", "contest_title_slug": "weekly-contest-124", "contest_id": 48, "contest_start_time": 1550370600, "contest_duration": 5400, "user_num": 417, "question_slugs": ["cousins-in-binary-tree", "rotting-oranges", "minimum-number-of-k-consecutive-bit-flips", "number-of-squareful-arrays"]}, {"contest_title": "\u7b2c 125 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 125", "contest_title_slug": "weekly-contest-125", "contest_id": 49, "contest_start_time": 1550975400, "contest_duration": 5400, "user_num": 469, "question_slugs": ["find-the-town-judge", "available-captures-for-rook", "maximum-binary-tree-ii", "grid-illumination"]}, {"contest_title": "\u7b2c 126 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 126", "contest_title_slug": "weekly-contest-126", "contest_id": 50, "contest_start_time": 1551580200, "contest_duration": 5400, "user_num": 591, "question_slugs": ["find-common-characters", "check-if-word-is-valid-after-substitutions", "max-consecutive-ones-iii", "minimum-cost-to-merge-stones"]}, {"contest_title": "\u7b2c 127 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 127", "contest_title_slug": "weekly-contest-127", "contest_id": 52, "contest_start_time": 1552185000, "contest_duration": 5400, "user_num": 664, "question_slugs": ["maximize-sum-of-array-after-k-negations", "clumsy-factorial", "minimum-domino-rotations-for-equal-row", "construct-binary-search-tree-from-preorder-traversal"]}, {"contest_title": "\u7b2c 128 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 128", "contest_title_slug": "weekly-contest-128", "contest_id": 53, "contest_start_time": 1552789800, "contest_duration": 5400, "user_num": 1251, "question_slugs": ["complement-of-base-10-integer", "pairs-of-songs-with-total-durations-divisible-by-60", "capacity-to-ship-packages-within-d-days", "numbers-with-repeated-digits"]}, {"contest_title": "\u7b2c 129 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 129", "contest_title_slug": "weekly-contest-129", "contest_id": 54, "contest_start_time": 1553391000, "contest_duration": 5400, "user_num": 759, "question_slugs": ["partition-array-into-three-parts-with-equal-sum", "smallest-integer-divisible-by-k", "best-sightseeing-pair", "binary-string-with-substrings-representing-1-to-n"]}, {"contest_title": "\u7b2c 130 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 130", "contest_title_slug": "weekly-contest-130", "contest_id": 55, "contest_start_time": 1553999400, "contest_duration": 5400, "user_num": 1294, "question_slugs": ["binary-prefix-divisible-by-5", "convert-to-base-2", "next-greater-node-in-linked-list", "number-of-enclaves"]}, {"contest_title": "\u7b2c 131 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 131", "contest_title_slug": "weekly-contest-131", "contest_id": 56, "contest_start_time": 1554604200, "contest_duration": 5400, "user_num": 918, "question_slugs": ["remove-outermost-parentheses", "sum-of-root-to-leaf-binary-numbers", "camelcase-matching", "video-stitching"]}, {"contest_title": "\u7b2c 132 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 132", "contest_title_slug": "weekly-contest-132", "contest_id": 57, "contest_start_time": 1555209000, "contest_duration": 5400, "user_num": 1050, "question_slugs": ["divisor-game", "maximum-difference-between-node-and-ancestor", "longest-arithmetic-subsequence", "recover-a-tree-from-preorder-traversal"]}, {"contest_title": "\u7b2c 133 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 133", "contest_title_slug": "weekly-contest-133", "contest_id": 59, "contest_start_time": 1555813800, "contest_duration": 5400, "user_num": 999, "question_slugs": ["two-city-scheduling", "matrix-cells-in-distance-order", "maximum-sum-of-two-non-overlapping-subarrays", "stream-of-characters"]}, {"contest_title": "\u7b2c 134 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 134", "contest_title_slug": "weekly-contest-134", "contest_id": 64, "contest_start_time": 1556418600, "contest_duration": 5400, "user_num": 728, "question_slugs": ["moving-stones-until-consecutive", "coloring-a-border", "uncrossed-lines", "escape-a-large-maze"]}, {"contest_title": "\u7b2c 135 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 135", "contest_title_slug": "weekly-contest-135", "contest_id": 65, "contest_start_time": 1557023400, "contest_duration": 5400, "user_num": 548, "question_slugs": ["valid-boomerang", "binary-search-tree-to-greater-sum-tree", "minimum-score-triangulation-of-polygon", "moving-stones-until-consecutive-ii"]}, {"contest_title": "\u7b2c 136 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 136", "contest_title_slug": "weekly-contest-136", "contest_id": 66, "contest_start_time": 1557628200, "contest_duration": 5400, "user_num": 790, "question_slugs": ["robot-bounded-in-circle", "flower-planting-with-no-adjacent", "partition-array-for-maximum-sum", "longest-duplicate-substring"]}, {"contest_title": "\u7b2c 137 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 137", "contest_title_slug": "weekly-contest-137", "contest_id": 67, "contest_start_time": 1558233000, "contest_duration": 5400, "user_num": 766, "question_slugs": ["last-stone-weight", "remove-all-adjacent-duplicates-in-string", "longest-string-chain", "last-stone-weight-ii"]}, {"contest_title": "\u7b2c 138 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 138", "contest_title_slug": "weekly-contest-138", "contest_id": 68, "contest_start_time": 1558837800, "contest_duration": 5400, "user_num": 752, "question_slugs": ["height-checker", "grumpy-bookstore-owner", "previous-permutation-with-one-swap", "distant-barcodes"]}, {"contest_title": "\u7b2c 139 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 139", "contest_title_slug": "weekly-contest-139", "contest_id": 69, "contest_start_time": 1559442600, "contest_duration": 5400, "user_num": 785, "question_slugs": ["greatest-common-divisor-of-strings", "flip-columns-for-maximum-number-of-equal-rows", "adding-two-negabinary-numbers", "number-of-submatrices-that-sum-to-target"]}, {"contest_title": "\u7b2c 140 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 140", "contest_title_slug": "weekly-contest-140", "contest_id": 71, "contest_start_time": 1560047400, "contest_duration": 5400, "user_num": 660, "question_slugs": ["occurrences-after-bigram", "letter-tile-possibilities", "insufficient-nodes-in-root-to-leaf-paths", "smallest-subsequence-of-distinct-characters"]}, {"contest_title": "\u7b2c 141 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 141", "contest_title_slug": "weekly-contest-141", "contest_id": 72, "contest_start_time": 1560652200, "contest_duration": 5400, "user_num": 763, "question_slugs": ["duplicate-zeros", "largest-values-from-labels", "shortest-path-in-binary-matrix", "shortest-common-supersequence"]}, {"contest_title": "\u7b2c 142 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 142", "contest_title_slug": "weekly-contest-142", "contest_id": 74, "contest_start_time": 1561257000, "contest_duration": 5400, "user_num": 801, "question_slugs": ["statistics-from-a-large-sample", "car-pooling", "find-in-mountain-array", "brace-expansion-ii"]}, {"contest_title": "\u7b2c 143 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 143", "contest_title_slug": "weekly-contest-143", "contest_id": 84, "contest_start_time": 1561861800, "contest_duration": 5400, "user_num": 803, "question_slugs": ["distribute-candies-to-people", "path-in-zigzag-labelled-binary-tree", "filling-bookcase-shelves", "parsing-a-boolean-expression"]}, {"contest_title": "\u7b2c 144 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 144", "contest_title_slug": "weekly-contest-144", "contest_id": 86, "contest_start_time": 1562466600, "contest_duration": 5400, "user_num": 777, "question_slugs": ["defanging-an-ip-address", "corporate-flight-bookings", "delete-nodes-and-return-forest", "maximum-nesting-depth-of-two-valid-parentheses-strings"]}, {"contest_title": "\u7b2c 145 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 145", "contest_title_slug": "weekly-contest-145", "contest_id": 87, "contest_start_time": 1563071400, "contest_duration": 5400, "user_num": 1114, "question_slugs": ["relative-sort-array", "lowest-common-ancestor-of-deepest-leaves", "longest-well-performing-interval", "smallest-sufficient-team"]}, {"contest_title": "\u7b2c 1 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 1", "contest_title_slug": "biweekly-contest-1", "contest_id": 70, "contest_start_time": 1559399400, "contest_duration": 7200, "user_num": 197, "question_slugs": ["fixed-point", "index-pairs-of-a-string", "campus-bikes-ii", "digit-count-in-range"]}, {"contest_title": "\u7b2c 2 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 2", "contest_title_slug": "biweekly-contest-2", "contest_id": 73, "contest_start_time": 1560609000, "contest_duration": 5400, "user_num": 256, "question_slugs": ["sum-of-digits-in-the-minimum-number", "high-five", "brace-expansion", "confusing-number-ii"]}, {"contest_title": "\u7b2c 3 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 3", "contest_title_slug": "biweekly-contest-3", "contest_id": 85, "contest_start_time": 1561818600, "contest_duration": 5400, "user_num": 312, "question_slugs": ["two-sum-less-than-k", "find-k-length-substrings-with-no-repeated-characters", "the-earliest-moment-when-everyone-become-friends", "path-with-maximum-minimum-value"]}, {"contest_title": "\u7b2c 4 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 4", "contest_title_slug": "biweekly-contest-4", "contest_id": 88, "contest_start_time": 1563028200, "contest_duration": 5400, "user_num": 438, "question_slugs": ["number-of-days-in-a-month", "remove-vowels-from-a-string", "maximum-average-subtree", "divide-array-into-increasing-sequences"]}, {"contest_title": "\u7b2c 5 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 5", "contest_title_slug": "biweekly-contest-5", "contest_id": 91, "contest_start_time": 1564237800, "contest_duration": 5400, "user_num": 495, "question_slugs": ["largest-unique-number", "armstrong-number", "connecting-cities-with-minimum-cost", "parallel-courses"]}, {"contest_title": "\u7b2c 6 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 6", "contest_title_slug": "biweekly-contest-6", "contest_id": 95, "contest_start_time": 1565447400, "contest_duration": 5400, "user_num": 513, "question_slugs": ["check-if-a-number-is-majority-element-in-a-sorted-array", "minimum-swaps-to-group-all-1s-together", "analyze-user-website-visit-pattern", "string-transforms-into-another-string"]}, {"contest_title": "\u7b2c 7 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 7", "contest_title_slug": "biweekly-contest-7", "contest_id": 99, "contest_start_time": 1566657000, "contest_duration": 5400, "user_num": 561, "question_slugs": ["single-row-keyboard", "design-file-system", "minimum-cost-to-connect-sticks", "optimize-water-distribution-in-a-village"]}, {"contest_title": "\u7b2c 8 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 8", "contest_title_slug": "biweekly-contest-8", "contest_id": 103, "contest_start_time": 1567866600, "contest_duration": 5400, "user_num": 630, "question_slugs": ["count-substrings-with-only-one-distinct-letter", "before-and-after-puzzle", "shortest-distance-to-target-color", "maximum-number-of-ones"]}, {"contest_title": "\u7b2c 9 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 9", "contest_title_slug": "biweekly-contest-9", "contest_id": 108, "contest_start_time": 1569076200, "contest_duration": 5700, "user_num": 929, "question_slugs": ["how-many-apples-can-you-put-into-the-basket", "minimum-knight-moves", "find-smallest-common-element-in-all-rows", "minimum-time-to-build-blocks"]}, {"contest_title": "\u7b2c 10 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 10", "contest_title_slug": "biweekly-contest-10", "contest_id": 115, "contest_start_time": 1570285800, "contest_duration": 5400, "user_num": 738, "question_slugs": ["intersection-of-three-sorted-arrays", "two-sum-bsts", "stepping-numbers", "valid-palindrome-iii"]}, {"contest_title": "\u7b2c 11 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 11", "contest_title_slug": "biweekly-contest-11", "contest_id": 118, "contest_start_time": 1571495400, "contest_duration": 5400, "user_num": 913, "question_slugs": ["missing-number-in-arithmetic-progression", "meeting-scheduler", "toss-strange-coins", "divide-chocolate"]}, {"contest_title": "\u7b2c 12 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 12", "contest_title_slug": "biweekly-contest-12", "contest_id": 121, "contest_start_time": 1572705000, "contest_duration": 5400, "user_num": 911, "question_slugs": ["design-a-leaderboard", "array-transformation", "tree-diameter", "palindrome-removal"]}, {"contest_title": "\u7b2c 13 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 13", "contest_title_slug": "biweekly-contest-13", "contest_id": 124, "contest_start_time": 1573914600, "contest_duration": 5400, "user_num": 810, "question_slugs": ["encode-number", "smallest-common-region", "synonymous-sentences", "handshakes-that-dont-cross"]}, {"contest_title": "\u7b2c 14 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 14", "contest_title_slug": "biweekly-contest-14", "contest_id": 129, "contest_start_time": 1575124200, "contest_duration": 5400, "user_num": 871, "question_slugs": ["hexspeak", "remove-interval", "delete-tree-nodes", "number-of-ships-in-a-rectangle"]}, {"contest_title": "\u7b2c 15 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 15", "contest_title_slug": "biweekly-contest-15", "contest_id": 132, "contest_start_time": 1576333800, "contest_duration": 5400, "user_num": 797, "question_slugs": ["element-appearing-more-than-25-in-sorted-array", "remove-covered-intervals", "iterator-for-combination", "minimum-falling-path-sum-ii"]}, {"contest_title": "\u7b2c 16 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 16", "contest_title_slug": "biweekly-contest-16", "contest_id": 135, "contest_start_time": 1577543400, "contest_duration": 5400, "user_num": 822, "question_slugs": ["replace-elements-with-greatest-element-on-right-side", "sum-of-mutated-array-closest-to-target", "deepest-leaves-sum", "number-of-paths-with-max-score"]}, {"contest_title": "\u7b2c 17 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 17", "contest_title_slug": "biweekly-contest-17", "contest_id": 138, "contest_start_time": 1578753000, "contest_duration": 5400, "user_num": 897, "question_slugs": ["decompress-run-length-encoded-list", "matrix-block-sum", "sum-of-nodes-with-even-valued-grandparent", "distinct-echo-substrings"]}, {"contest_title": "\u7b2c 18 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 18", "contest_title_slug": "biweekly-contest-18", "contest_id": 143, "contest_start_time": 1579962600, "contest_duration": 5400, "user_num": 587, "question_slugs": ["rank-transform-of-an-array", "break-a-palindrome", "sort-the-matrix-diagonally", "reverse-subarray-to-maximize-array-value"]}, {"contest_title": "\u7b2c 19 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 19", "contest_title_slug": "biweekly-contest-19", "contest_id": 146, "contest_start_time": 1581172200, "contest_duration": 5400, "user_num": 1120, "question_slugs": ["number-of-steps-to-reduce-a-number-to-zero", "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold", "angle-between-hands-of-a-clock", "jump-game-iv"]}, {"contest_title": "\u7b2c 20 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 20", "contest_title_slug": "biweekly-contest-20", "contest_id": 149, "contest_start_time": 1582381800, "contest_duration": 5400, "user_num": 1541, "question_slugs": ["sort-integers-by-the-number-of-1-bits", "apply-discount-every-n-orders", "number-of-substrings-containing-all-three-characters", "count-all-valid-pickup-and-delivery-options"]}, {"contest_title": "\u7b2c 21 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 21", "contest_title_slug": "biweekly-contest-21", "contest_id": 157, "contest_start_time": 1583591400, "contest_duration": 5400, "user_num": 1913, "question_slugs": ["increasing-decreasing-string", "find-the-longest-substring-containing-vowels-in-even-counts", "longest-zigzag-path-in-a-binary-tree", "maximum-sum-bst-in-binary-tree"]}, {"contest_title": "\u7b2c 22 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 22", "contest_title_slug": "biweekly-contest-22", "contest_id": 163, "contest_start_time": 1584801000, "contest_duration": 5400, "user_num": 2042, "question_slugs": ["find-the-distance-value-between-two-arrays", "cinema-seat-allocation", "sort-integers-by-the-power-value", "pizza-with-3n-slices"]}, {"contest_title": "\u7b2c 23 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 23", "contest_title_slug": "biweekly-contest-23", "contest_id": 169, "contest_start_time": 1586010600, "contest_duration": 5400, "user_num": 2045, "question_slugs": ["count-largest-group", "construct-k-palindrome-strings", "circle-and-rectangle-overlapping", "reducing-dishes"]}, {"contest_title": "\u7b2c 24 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 24", "contest_title_slug": "biweekly-contest-24", "contest_id": 178, "contest_start_time": 1587220200, "contest_duration": 5400, "user_num": 1898, "question_slugs": ["minimum-value-to-get-positive-step-by-step-sum", "find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k", "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n", "restore-the-array"]}, {"contest_title": "\u7b2c 25 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 25", "contest_title_slug": "biweekly-contest-25", "contest_id": 192, "contest_start_time": 1588429800, "contest_duration": 5400, "user_num": 1832, "question_slugs": ["kids-with-the-greatest-number-of-candies", "max-difference-you-can-get-from-changing-an-integer", "check-if-a-string-can-break-another-string", "number-of-ways-to-wear-different-hats-to-each-other"]}, {"contest_title": "\u7b2c 26 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 26", "contest_title_slug": "biweekly-contest-26", "contest_id": 198, "contest_start_time": 1589639400, "contest_duration": 5400, "user_num": 1971, "question_slugs": ["consecutive-characters", "simplified-fractions", "count-good-nodes-in-binary-tree", "form-largest-integer-with-digits-that-add-up-to-target"]}, {"contest_title": "\u7b2c 28 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 28", "contest_title_slug": "biweekly-contest-28", "contest_id": 210, "contest_start_time": 1592058600, "contest_duration": 5400, "user_num": 2144, "question_slugs": ["final-prices-with-a-special-discount-in-a-shop", "subrectangle-queries", "find-two-non-overlapping-sub-arrays-each-with-target-sum", "allocate-mailboxes"]}, {"contest_title": "\u7b2c 30 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 30", "contest_title_slug": "biweekly-contest-30", "contest_id": 222, "contest_start_time": 1594477800, "contest_duration": 5400, "user_num": 2545, "question_slugs": ["reformat-date", "range-sum-of-sorted-subarray-sums", "minimum-difference-between-largest-and-smallest-value-in-three-moves", "stone-game-iv"]}, {"contest_title": "\u7b2c 31 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 31", "contest_title_slug": "biweekly-contest-31", "contest_id": 232, "contest_start_time": 1595687400, "contest_duration": 5400, "user_num": 2767, "question_slugs": ["count-odd-numbers-in-an-interval-range", "number-of-sub-arrays-with-odd-sum", "number-of-good-ways-to-split-a-string", "minimum-number-of-increments-on-subarrays-to-form-a-target-array"]}, {"contest_title": "\u7b2c 32 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 32", "contest_title_slug": "biweekly-contest-32", "contest_id": 237, "contest_start_time": 1596897000, "contest_duration": 5400, "user_num": 2957, "question_slugs": ["kth-missing-positive-number", "can-convert-string-in-k-moves", "minimum-insertions-to-balance-a-parentheses-string", "find-longest-awesome-substring"]}, {"contest_title": "\u7b2c 33 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 33", "contest_title_slug": "biweekly-contest-33", "contest_id": 241, "contest_start_time": 1598106600, "contest_duration": 5400, "user_num": 3304, "question_slugs": ["thousand-separator", "minimum-number-of-vertices-to-reach-all-nodes", "minimum-numbers-of-function-calls-to-make-target-array", "detect-cycles-in-2d-grid"]}, {"contest_title": "\u7b2c 34 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 34", "contest_title_slug": "biweekly-contest-34", "contest_id": 256, "contest_start_time": 1599316200, "contest_duration": 5400, "user_num": 2842, "question_slugs": ["matrix-diagonal-sum", "number-of-ways-to-split-a-string", "shortest-subarray-to-be-removed-to-make-array-sorted", "count-all-possible-routes"]}, {"contest_title": "\u7b2c 35 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 35", "contest_title_slug": "biweekly-contest-35", "contest_id": 266, "contest_start_time": 1600525800, "contest_duration": 5400, "user_num": 2839, "question_slugs": ["sum-of-all-odd-length-subarrays", "maximum-sum-obtained-of-any-permutation", "make-sum-divisible-by-p", "strange-printer-ii"]}, {"contest_title": "\u7b2c 36 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 36", "contest_title_slug": "biweekly-contest-36", "contest_id": 288, "contest_start_time": 1601735400, "contest_duration": 5400, "user_num": 2204, "question_slugs": ["design-parking-system", "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period", "find-valid-matrix-given-row-and-column-sums", "find-servers-that-handled-most-number-of-requests"]}, {"contest_title": "\u7b2c 37 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 37", "contest_title_slug": "biweekly-contest-37", "contest_id": 294, "contest_start_time": 1602945000, "contest_duration": 5400, "user_num": 2104, "question_slugs": ["mean-of-array-after-removing-some-elements", "coordinate-with-maximum-network-quality", "number-of-sets-of-k-non-overlapping-line-segments", "fancy-sequence"]}, {"contest_title": "\u7b2c 38 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 38", "contest_title_slug": "biweekly-contest-38", "contest_id": 300, "contest_start_time": 1604154600, "contest_duration": 5400, "user_num": 2004, "question_slugs": ["sort-array-by-increasing-frequency", "widest-vertical-area-between-two-points-containing-no-points", "count-substrings-that-differ-by-one-character", "number-of-ways-to-form-a-target-string-given-a-dictionary"]}, {"contest_title": "\u7b2c 39 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 39", "contest_title_slug": "biweekly-contest-39", "contest_id": 306, "contest_start_time": 1605364200, "contest_duration": 5400, "user_num": 2069, "question_slugs": ["defuse-the-bomb", "minimum-deletions-to-make-string-balanced", "minimum-jumps-to-reach-home", "distribute-repeating-integers"]}, {"contest_title": "\u7b2c 40 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 40", "contest_title_slug": "biweekly-contest-40", "contest_id": 312, "contest_start_time": 1606573800, "contest_duration": 5400, "user_num": 1891, "question_slugs": ["maximum-repeating-substring", "merge-in-between-linked-lists", "design-front-middle-back-queue", "minimum-number-of-removals-to-make-mountain-array"]}, {"contest_title": "\u7b2c 41 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 41", "contest_title_slug": "biweekly-contest-41", "contest_id": 318, "contest_start_time": 1607783400, "contest_duration": 5400, "user_num": 1660, "question_slugs": ["count-the-number-of-consistent-strings", "sum-of-absolute-differences-in-a-sorted-array", "stone-game-vi", "delivering-boxes-from-storage-to-ports"]}, {"contest_title": "\u7b2c 42 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 42", "contest_title_slug": "biweekly-contest-42", "contest_id": 325, "contest_start_time": 1608993000, "contest_duration": 5400, "user_num": 1578, "question_slugs": ["number-of-students-unable-to-eat-lunch", "average-waiting-time", "maximum-binary-string-after-change", "minimum-adjacent-swaps-for-k-consecutive-ones"]}, {"contest_title": "\u7b2c 43 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 43", "contest_title_slug": "biweekly-contest-43", "contest_id": 331, "contest_start_time": 1610202600, "contest_duration": 5400, "user_num": 1631, "question_slugs": ["calculate-money-in-leetcode-bank", "maximum-score-from-removing-substrings", "construct-the-lexicographically-largest-valid-sequence", "number-of-ways-to-reconstruct-a-tree"]}, {"contest_title": "\u7b2c 44 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 44", "contest_title_slug": "biweekly-contest-44", "contest_id": 337, "contest_start_time": 1611412200, "contest_duration": 5400, "user_num": 1826, "question_slugs": ["find-the-highest-altitude", "minimum-number-of-people-to-teach", "decode-xored-permutation", "count-ways-to-make-array-with-product"]}, {"contest_title": "\u7b2c 45 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 45", "contest_title_slug": "biweekly-contest-45", "contest_id": 343, "contest_start_time": 1612621800, "contest_duration": 5400, "user_num": 1676, "question_slugs": ["sum-of-unique-elements", "maximum-absolute-sum-of-any-subarray", "minimum-length-of-string-after-deleting-similar-ends", "maximum-number-of-events-that-can-be-attended-ii"]}, {"contest_title": "\u7b2c 46 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 46", "contest_title_slug": "biweekly-contest-46", "contest_id": 349, "contest_start_time": 1613831400, "contest_duration": 5400, "user_num": 1647, "question_slugs": ["longest-nice-substring", "form-array-by-concatenating-subarrays-of-another-array", "map-of-highest-peak", "tree-of-coprimes"]}, {"contest_title": "\u7b2c 47 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 47", "contest_title_slug": "biweekly-contest-47", "contest_id": 355, "contest_start_time": 1615041000, "contest_duration": 5400, "user_num": 3085, "question_slugs": ["find-nearest-point-that-has-the-same-x-or-y-coordinate", "check-if-number-is-a-sum-of-powers-of-three", "sum-of-beauty-of-all-substrings", "count-pairs-of-nodes"]}, {"contest_title": "\u7b2c 48 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 48", "contest_title_slug": "biweekly-contest-48", "contest_id": 362, "contest_start_time": 1616250600, "contest_duration": 5400, "user_num": 2853, "question_slugs": ["second-largest-digit-in-a-string", "design-authentication-manager", "maximum-number-of-consecutive-values-you-can-make", "maximize-score-after-n-operations"]}, {"contest_title": "\u7b2c 49 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 49", "contest_title_slug": "biweekly-contest-49", "contest_id": 374, "contest_start_time": 1617460200, "contest_duration": 5400, "user_num": 3193, "question_slugs": ["determine-color-of-a-chessboard-square", "sentence-similarity-iii", "count-nice-pairs-in-an-array", "maximum-number-of-groups-getting-fresh-donuts"]}, {"contest_title": "\u7b2c 50 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 50", "contest_title_slug": "biweekly-contest-50", "contest_id": 390, "contest_start_time": 1618669800, "contest_duration": 5400, "user_num": 3608, "question_slugs": ["minimum-operations-to-make-the-array-increasing", "queries-on-number-of-points-inside-a-circle", "maximum-xor-for-each-query", "minimum-number-of-operations-to-make-string-sorted"]}, {"contest_title": "\u7b2c 51 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 51", "contest_title_slug": "biweekly-contest-51", "contest_id": 396, "contest_start_time": 1619879400, "contest_duration": 5400, "user_num": 2675, "question_slugs": ["replace-all-digits-with-characters", "seat-reservation-manager", "maximum-element-after-decreasing-and-rearranging", "closest-room"]}, {"contest_title": "\u7b2c 52 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 52", "contest_title_slug": "biweekly-contest-52", "contest_id": 402, "contest_start_time": 1621089000, "contest_duration": 5400, "user_num": 2930, "question_slugs": ["sorting-the-sentence", "incremental-memory-leak", "rotating-the-box", "sum-of-floored-pairs"]}, {"contest_title": "\u7b2c 53 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 53", "contest_title_slug": "biweekly-contest-53", "contest_id": 408, "contest_start_time": 1622298600, "contest_duration": 5400, "user_num": 3069, "question_slugs": ["substrings-of-size-three-with-distinct-characters", "minimize-maximum-pair-sum-in-array", "get-biggest-three-rhombus-sums-in-a-grid", "minimum-xor-sum-of-two-arrays"]}, {"contest_title": "\u7b2c 54 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 54", "contest_title_slug": "biweekly-contest-54", "contest_id": 414, "contest_start_time": 1623508200, "contest_duration": 5400, "user_num": 2479, "question_slugs": ["check-if-all-the-integers-in-a-range-are-covered", "find-the-student-that-will-replace-the-chalk", "largest-magic-square", "minimum-cost-to-change-the-final-value-of-expression"]}, {"contest_title": "\u7b2c 55 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 55", "contest_title_slug": "biweekly-contest-55", "contest_id": 421, "contest_start_time": 1624717800, "contest_duration": 5400, "user_num": 3277, "question_slugs": ["remove-one-element-to-make-the-array-strictly-increasing", "remove-all-occurrences-of-a-substring", "maximum-alternating-subsequence-sum", "design-movie-rental-system"]}, {"contest_title": "\u7b2c 56 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 56", "contest_title_slug": "biweekly-contest-56", "contest_id": 429, "contest_start_time": 1625927400, "contest_duration": 5400, "user_num": 2760, "question_slugs": ["count-square-sum-triples", "nearest-exit-from-entrance-in-maze", "sum-game", "minimum-cost-to-reach-destination-in-time"]}, {"contest_title": "\u7b2c 57 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 57", "contest_title_slug": "biweekly-contest-57", "contest_id": 435, "contest_start_time": 1627137000, "contest_duration": 5400, "user_num": 2933, "question_slugs": ["check-if-all-characters-have-equal-number-of-occurrences", "the-number-of-the-smallest-unoccupied-chair", "describe-the-painting", "number-of-visible-people-in-a-queue"]}, {"contest_title": "\u7b2c 86 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 86", "contest_title_slug": "weekly-contest-86", "contest_id": 8, "contest_start_time": 1527384600, "contest_duration": 5400, "user_num": 377, "question_slugs": ["magic-squares-in-grid", "keys-and-rooms", "split-array-into-fibonacci-sequence", "guess-the-word"]}, {"contest_title": "\u7b2c 90 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 90", "contest_title_slug": "weekly-contest-90", "contest_id": 13, "contest_start_time": 1529803800, "contest_duration": 5400, "user_num": 573, "question_slugs": ["buddy-strings", "score-of-parentheses", "mirror-reflection", "minimum-cost-to-hire-k-workers"]}, {"contest_title": "\u7b2c 146 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 146", "contest_title_slug": "weekly-contest-146", "contest_id": 89, "contest_start_time": 1563676200, "contest_duration": 5400, "user_num": 1189, "question_slugs": ["number-of-equivalent-domino-pairs", "shortest-path-with-alternating-colors", "minimum-cost-tree-from-leaf-values", "maximum-of-absolute-value-expression"]}, {"contest_title": "\u7b2c 147 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 147", "contest_title_slug": "weekly-contest-147", "contest_id": 90, "contest_start_time": 1564281000, "contest_duration": 5400, "user_num": 1132, "question_slugs": ["n-th-tribonacci-number", "alphabet-board-path", "largest-1-bordered-square", "stone-game-ii"]}, {"contest_title": "\u7b2c 148 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 148", "contest_title_slug": "weekly-contest-148", "contest_id": 93, "contest_start_time": 1564885800, "contest_duration": 5400, "user_num": 1251, "question_slugs": ["decrease-elements-to-make-array-zigzag", "binary-tree-coloring-game", "snapshot-array", "longest-chunked-palindrome-decomposition"]}, {"contest_title": "\u7b2c 149 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 149", "contest_title_slug": "weekly-contest-149", "contest_id": 94, "contest_start_time": 1565490600, "contest_duration": 5400, "user_num": 1351, "question_slugs": ["day-of-the-year", "number-of-dice-rolls-with-target-sum", "swap-for-longest-repeated-character-substring", "online-majority-element-in-subarray"]}, {"contest_title": "\u7b2c 150 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 150", "contest_title_slug": "weekly-contest-150", "contest_id": 96, "contest_start_time": 1566095400, "contest_duration": 5400, "user_num": 1473, "question_slugs": ["find-words-that-can-be-formed-by-characters", "maximum-level-sum-of-a-binary-tree", "as-far-from-land-as-possible", "last-substring-in-lexicographical-order"]}, {"contest_title": "\u7b2c 151 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 151", "contest_title_slug": "weekly-contest-151", "contest_id": 98, "contest_start_time": 1566700200, "contest_duration": 5400, "user_num": 1341, "question_slugs": ["invalid-transactions", "compare-strings-by-frequency-of-the-smallest-character", "remove-zero-sum-consecutive-nodes-from-linked-list", "dinner-plate-stacks"]}, {"contest_title": "\u7b2c 152 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 152", "contest_title_slug": "weekly-contest-152", "contest_id": 100, "contest_start_time": 1567305000, "contest_duration": 5400, "user_num": 1367, "question_slugs": ["prime-arrangements", "diet-plan-performance", "can-make-palindrome-from-substring", "number-of-valid-words-for-each-puzzle"]}, {"contest_title": "\u7b2c 153 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 153", "contest_title_slug": "weekly-contest-153", "contest_id": 102, "contest_start_time": 1567909800, "contest_duration": 5400, "user_num": 1434, "question_slugs": ["distance-between-bus-stops", "day-of-the-week", "maximum-subarray-sum-with-one-deletion", "make-array-strictly-increasing"]}, {"contest_title": "\u7b2c 154 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 154", "contest_title_slug": "weekly-contest-154", "contest_id": 106, "contest_start_time": 1568514600, "contest_duration": 5400, "user_num": 1299, "question_slugs": ["maximum-number-of-balloons", "reverse-substrings-between-each-pair-of-parentheses", "k-concatenation-maximum-sum", "critical-connections-in-a-network"]}, {"contest_title": "\u7b2c 155 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 155", "contest_title_slug": "weekly-contest-155", "contest_id": 107, "contest_start_time": 1569119400, "contest_duration": 5400, "user_num": 1603, "question_slugs": ["minimum-absolute-difference", "ugly-number-iii", "smallest-string-with-swaps", "sort-items-by-groups-respecting-dependencies"]}, {"contest_title": "\u7b2c 156 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 156", "contest_title_slug": "weekly-contest-156", "contest_id": 113, "contest_start_time": 1569724200, "contest_duration": 5400, "user_num": 1433, "question_slugs": ["unique-number-of-occurrences", "get-equal-substrings-within-budget", "remove-all-adjacent-duplicates-in-string-ii", "minimum-moves-to-reach-target-with-rotations"]}, {"contest_title": "\u7b2c 157 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 157", "contest_title_slug": "weekly-contest-157", "contest_id": 114, "contest_start_time": 1570329000, "contest_duration": 5400, "user_num": 1217, "question_slugs": ["minimum-cost-to-move-chips-to-the-same-position", "longest-arithmetic-subsequence-of-given-difference", "path-with-maximum-gold", "count-vowels-permutation"]}, {"contest_title": "\u7b2c 158 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 158", "contest_title_slug": "weekly-contest-158", "contest_id": 116, "contest_start_time": 1570933800, "contest_duration": 5400, "user_num": 1716, "question_slugs": ["split-a-string-in-balanced-strings", "queens-that-can-attack-the-king", "dice-roll-simulation", "maximum-equal-frequency"]}, {"contest_title": "\u7b2c 159 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 159", "contest_title_slug": "weekly-contest-159", "contest_id": 117, "contest_start_time": 1571538600, "contest_duration": 5400, "user_num": 1634, "question_slugs": ["check-if-it-is-a-straight-line", "remove-sub-folders-from-the-filesystem", "replace-the-substring-for-balanced-string", "maximum-profit-in-job-scheduling"]}, {"contest_title": "\u7b2c 160 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 160", "contest_title_slug": "weekly-contest-160", "contest_id": 119, "contest_start_time": 1572143400, "contest_duration": 5400, "user_num": 1692, "question_slugs": ["find-positive-integer-solution-for-a-given-equation", "circular-permutation-in-binary-representation", "maximum-length-of-a-concatenated-string-with-unique-characters", "tiling-a-rectangle-with-the-fewest-squares"]}, {"contest_title": "\u7b2c 161 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 161", "contest_title_slug": "weekly-contest-161", "contest_id": 120, "contest_start_time": 1572748200, "contest_duration": 5400, "user_num": 1610, "question_slugs": ["minimum-swaps-to-make-strings-equal", "count-number-of-nice-subarrays", "minimum-remove-to-make-valid-parentheses", "check-if-it-is-a-good-array"]}, {"contest_title": "\u7b2c 162 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 162", "contest_title_slug": "weekly-contest-162", "contest_id": 122, "contest_start_time": 1573353000, "contest_duration": 5400, "user_num": 1569, "question_slugs": ["cells-with-odd-values-in-a-matrix", "reconstruct-a-2-row-binary-matrix", "number-of-closed-islands", "maximum-score-words-formed-by-letters"]}, {"contest_title": "\u7b2c 163 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 163", "contest_title_slug": "weekly-contest-163", "contest_id": 123, "contest_start_time": 1573957800, "contest_duration": 5400, "user_num": 1605, "question_slugs": ["shift-2d-grid", "find-elements-in-a-contaminated-binary-tree", "greatest-sum-divisible-by-three", "minimum-moves-to-move-a-box-to-their-target-location"]}, {"contest_title": "\u7b2c 164 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 164", "contest_title_slug": "weekly-contest-164", "contest_id": 125, "contest_start_time": 1574562600, "contest_duration": 5400, "user_num": 1676, "question_slugs": ["minimum-time-visiting-all-points", "count-servers-that-communicate", "search-suggestions-system", "number-of-ways-to-stay-in-the-same-place-after-some-steps"]}, {"contest_title": "\u7b2c 165 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 165", "contest_title_slug": "weekly-contest-165", "contest_id": 128, "contest_start_time": 1575167400, "contest_duration": 5400, "user_num": 1660, "question_slugs": ["find-winner-on-a-tic-tac-toe-game", "number-of-burgers-with-no-waste-of-ingredients", "count-square-submatrices-with-all-ones", "palindrome-partitioning-iii"]}, {"contest_title": "\u7b2c 166 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 166", "contest_title_slug": "weekly-contest-166", "contest_id": 130, "contest_start_time": 1575772200, "contest_duration": 5400, "user_num": 1676, "question_slugs": ["subtract-the-product-and-sum-of-digits-of-an-integer", "group-the-people-given-the-group-size-they-belong-to", "find-the-smallest-divisor-given-a-threshold", "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"]}, {"contest_title": "\u7b2c 167 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 167", "contest_title_slug": "weekly-contest-167", "contest_id": 131, "contest_start_time": 1576377000, "contest_duration": 5400, "user_num": 1537, "question_slugs": ["convert-binary-number-in-a-linked-list-to-integer", "sequential-digits", "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold", "shortest-path-in-a-grid-with-obstacles-elimination"]}, {"contest_title": "\u7b2c 168 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 168", "contest_title_slug": "weekly-contest-168", "contest_id": 133, "contest_start_time": 1576981800, "contest_duration": 5400, "user_num": 1553, "question_slugs": ["find-numbers-with-even-number-of-digits", "divide-array-in-sets-of-k-consecutive-numbers", "maximum-number-of-occurrences-of-a-substring", "maximum-candies-you-can-get-from-boxes"]}, {"contest_title": "\u7b2c 169 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 169", "contest_title_slug": "weekly-contest-169", "contest_id": 134, "contest_start_time": 1577586600, "contest_duration": 5400, "user_num": 1568, "question_slugs": ["find-n-unique-integers-sum-up-to-zero", "all-elements-in-two-binary-search-trees", "jump-game-iii", "verbal-arithmetic-puzzle"]}, {"contest_title": "\u7b2c 170 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 170", "contest_title_slug": "weekly-contest-170", "contest_id": 136, "contest_start_time": 1578191400, "contest_duration": 5400, "user_num": 1649, "question_slugs": ["decrypt-string-from-alphabet-to-integer-mapping", "xor-queries-of-a-subarray", "get-watched-videos-by-your-friends", "minimum-insertion-steps-to-make-a-string-palindrome"]}, {"contest_title": "\u7b2c 171 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 171", "contest_title_slug": "weekly-contest-171", "contest_id": 137, "contest_start_time": 1578796200, "contest_duration": 5400, "user_num": 1708, "question_slugs": ["convert-integer-to-the-sum-of-two-no-zero-integers", "minimum-flips-to-make-a-or-b-equal-to-c", "number-of-operations-to-make-network-connected", "minimum-distance-to-type-a-word-using-two-fingers"]}, {"contest_title": "\u7b2c 172 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 172", "contest_title_slug": "weekly-contest-172", "contest_id": 139, "contest_start_time": 1579401000, "contest_duration": 5400, "user_num": 1415, "question_slugs": ["maximum-69-number", "print-words-vertically", "delete-leaves-with-a-given-value", "minimum-number-of-taps-to-open-to-water-a-garden"]}, {"contest_title": "\u7b2c 173 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 173", "contest_title_slug": "weekly-contest-173", "contest_id": 142, "contest_start_time": 1580005800, "contest_duration": 5400, "user_num": 1072, "question_slugs": ["remove-palindromic-subsequences", "filter-restaurants-by-vegan-friendly-price-and-distance", "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", "minimum-difficulty-of-a-job-schedule"]}, {"contest_title": "\u7b2c 174 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 174", "contest_title_slug": "weekly-contest-174", "contest_id": 144, "contest_start_time": 1580610600, "contest_duration": 5400, "user_num": 1660, "question_slugs": ["the-k-weakest-rows-in-a-matrix", "reduce-array-size-to-the-half", "maximum-product-of-splitted-binary-tree", "jump-game-v"]}, {"contest_title": "\u7b2c 175 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 175", "contest_title_slug": "weekly-contest-175", "contest_id": 145, "contest_start_time": 1581215400, "contest_duration": 5400, "user_num": 2048, "question_slugs": ["check-if-n-and-its-double-exist", "minimum-number-of-steps-to-make-two-strings-anagram", "tweet-counts-per-frequency", "maximum-students-taking-exam"]}, {"contest_title": "\u7b2c 176 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 176", "contest_title_slug": "weekly-contest-176", "contest_id": 147, "contest_start_time": 1581820200, "contest_duration": 5400, "user_num": 2410, "question_slugs": ["count-negative-numbers-in-a-sorted-matrix", "product-of-the-last-k-numbers", "maximum-number-of-events-that-can-be-attended", "construct-target-array-with-multiple-sums"]}, {"contest_title": "\u7b2c 177 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 177", "contest_title_slug": "weekly-contest-177", "contest_id": 148, "contest_start_time": 1582425000, "contest_duration": 5400, "user_num": 2986, "question_slugs": ["number-of-days-between-two-dates", "validate-binary-tree-nodes", "closest-divisors", "largest-multiple-of-three"]}, {"contest_title": "\u7b2c 178 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 178", "contest_title_slug": "weekly-contest-178", "contest_id": 154, "contest_start_time": 1583029800, "contest_duration": 5400, "user_num": 3305, "question_slugs": ["how-many-numbers-are-smaller-than-the-current-number", "rank-teams-by-votes", "linked-list-in-binary-tree", "minimum-cost-to-make-at-least-one-valid-path-in-a-grid"]}, {"contest_title": "\u7b2c 179 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 179", "contest_title_slug": "weekly-contest-179", "contest_id": 156, "contest_start_time": 1583634600, "contest_duration": 5400, "user_num": 3606, "question_slugs": ["generate-a-string-with-characters-that-have-odd-counts", "number-of-times-binary-string-is-prefix-aligned", "time-needed-to-inform-all-employees", "frog-position-after-t-seconds"]}, {"contest_title": "\u7b2c 180 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 180", "contest_title_slug": "weekly-contest-180", "contest_id": 160, "contest_start_time": 1584239400, "contest_duration": 5400, "user_num": 3715, "question_slugs": ["lucky-numbers-in-a-matrix", "design-a-stack-with-increment-operation", "balance-a-binary-search-tree", "maximum-performance-of-a-team"]}, {"contest_title": "\u7b2c 181 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 181", "contest_title_slug": "weekly-contest-181", "contest_id": 162, "contest_start_time": 1584844200, "contest_duration": 5400, "user_num": 4149, "question_slugs": ["create-target-array-in-the-given-order", "four-divisors", "check-if-there-is-a-valid-path-in-a-grid", "longest-happy-prefix"]}, {"contest_title": "\u7b2c 182 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 182", "contest_title_slug": "weekly-contest-182", "contest_id": 166, "contest_start_time": 1585449000, "contest_duration": 5400, "user_num": 3911, "question_slugs": ["find-lucky-integer-in-an-array", "count-number-of-teams", "design-underground-system", "find-all-good-strings"]}, {"contest_title": "\u7b2c 183 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 183", "contest_title_slug": "weekly-contest-183", "contest_id": 168, "contest_start_time": 1586053800, "contest_duration": 5400, "user_num": 3756, "question_slugs": ["minimum-subsequence-in-non-increasing-order", "number-of-steps-to-reduce-a-number-in-binary-representation-to-one", "longest-happy-string", "stone-game-iii"]}, {"contest_title": "\u7b2c 184 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 184", "contest_title_slug": "weekly-contest-184", "contest_id": 175, "contest_start_time": 1586658600, "contest_duration": 5400, "user_num": 3847, "question_slugs": ["string-matching-in-an-array", "queries-on-a-permutation-with-key", "html-entity-parser", "number-of-ways-to-paint-n-3-grid"]}, {"contest_title": "\u7b2c 185 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 185", "contest_title_slug": "weekly-contest-185", "contest_id": 177, "contest_start_time": 1587263400, "contest_duration": 5400, "user_num": 5004, "question_slugs": ["reformat-the-string", "display-table-of-food-orders-in-a-restaurant", "minimum-number-of-frogs-croaking", "build-array-where-you-can-find-the-maximum-exactly-k-comparisons"]}, {"contest_title": "\u7b2c 186 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 186", "contest_title_slug": "weekly-contest-186", "contest_id": 185, "contest_start_time": 1587868200, "contest_duration": 5400, "user_num": 3108, "question_slugs": ["maximum-score-after-splitting-a-string", "maximum-points-you-can-obtain-from-cards", "diagonal-traverse-ii", "constrained-subsequence-sum"]}, {"contest_title": "\u7b2c 187 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 187", "contest_title_slug": "weekly-contest-187", "contest_id": 191, "contest_start_time": 1588473000, "contest_duration": 5400, "user_num": 3109, "question_slugs": ["destination-city", "check-if-all-1s-are-at-least-length-k-places-away", "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit", "find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"]}, {"contest_title": "\u7b2c 188 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 188", "contest_title_slug": "weekly-contest-188", "contest_id": 195, "contest_start_time": 1589077800, "contest_duration": 5400, "user_num": 3982, "question_slugs": ["build-an-array-with-stack-operations", "count-triplets-that-can-form-two-arrays-of-equal-xor", "minimum-time-to-collect-all-apples-in-a-tree", "number-of-ways-of-cutting-a-pizza"]}, {"contest_title": "\u7b2c 189 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 189", "contest_title_slug": "weekly-contest-189", "contest_id": 197, "contest_start_time": 1589682600, "contest_duration": 5400, "user_num": 3692, "question_slugs": ["number-of-students-doing-homework-at-a-given-time", "rearrange-words-in-a-sentence", "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list", "maximum-number-of-darts-inside-of-a-circular-dartboard"]}, {"contest_title": "\u7b2c 190 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 190", "contest_title_slug": "weekly-contest-190", "contest_id": 201, "contest_start_time": 1590287400, "contest_duration": 5400, "user_num": 3352, "question_slugs": ["check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence", "maximum-number-of-vowels-in-a-substring-of-given-length", "pseudo-palindromic-paths-in-a-binary-tree", "max-dot-product-of-two-subsequences"]}, {"contest_title": "\u7b2c 191 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 191", "contest_title_slug": "weekly-contest-191", "contest_id": 203, "contest_start_time": 1590892200, "contest_duration": 5400, "user_num": 3687, "question_slugs": ["maximum-product-of-two-elements-in-an-array", "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts", "reorder-routes-to-make-all-paths-lead-to-the-city-zero", "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"]}, {"contest_title": "\u7b2c 192 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 192", "contest_title_slug": "weekly-contest-192", "contest_id": 207, "contest_start_time": 1591497000, "contest_duration": 5400, "user_num": 3615, "question_slugs": ["shuffle-the-array", "the-k-strongest-values-in-an-array", "design-browser-history", "paint-house-iii"]}, {"contest_title": "\u7b2c 193 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 193", "contest_title_slug": "weekly-contest-193", "contest_id": 209, "contest_start_time": 1592101800, "contest_duration": 5400, "user_num": 3804, "question_slugs": ["running-sum-of-1d-array", "least-number-of-unique-integers-after-k-removals", "minimum-number-of-days-to-make-m-bouquets", "kth-ancestor-of-a-tree-node"]}, {"contest_title": "\u7b2c 194 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 194", "contest_title_slug": "weekly-contest-194", "contest_id": 213, "contest_start_time": 1592706600, "contest_duration": 5400, "user_num": 4378, "question_slugs": ["xor-operation-in-an-array", "making-file-names-unique", "avoid-flood-in-the-city", "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"]}, {"contest_title": "\u7b2c 195 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 195", "contest_title_slug": "weekly-contest-195", "contest_id": 215, "contest_start_time": 1593311400, "contest_duration": 5400, "user_num": 3401, "question_slugs": ["path-crossing", "check-if-array-pairs-are-divisible-by-k", "number-of-subsequences-that-satisfy-the-given-sum-condition", "max-value-of-equation"]}, {"contest_title": "\u7b2c 196 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 196", "contest_title_slug": "weekly-contest-196", "contest_id": 219, "contest_start_time": 1593916200, "contest_duration": 5400, "user_num": 5507, "question_slugs": ["can-make-arithmetic-progression-from-sequence", "last-moment-before-all-ants-fall-out-of-a-plank", "count-submatrices-with-all-ones", "minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"]}, {"contest_title": "\u7b2c 197 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 197", "contest_title_slug": "weekly-contest-197", "contest_id": 221, "contest_start_time": 1594521000, "contest_duration": 5400, "user_num": 5275, "question_slugs": ["number-of-good-pairs", "number-of-substrings-with-only-1s", "path-with-maximum-probability", "best-position-for-a-service-centre"]}, {"contest_title": "\u7b2c 198 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 198", "contest_title_slug": "weekly-contest-198", "contest_id": 226, "contest_start_time": 1595125800, "contest_duration": 5400, "user_num": 5780, "question_slugs": ["water-bottles", "number-of-nodes-in-the-sub-tree-with-the-same-label", "maximum-number-of-non-overlapping-substrings", "find-a-value-of-a-mysterious-function-closest-to-target"]}, {"contest_title": "\u7b2c 199 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 199", "contest_title_slug": "weekly-contest-199", "contest_id": 228, "contest_start_time": 1595730600, "contest_duration": 5400, "user_num": 5232, "question_slugs": ["shuffle-string", "minimum-suffix-flips", "number-of-good-leaf-nodes-pairs", "string-compression-ii"]}, {"contest_title": "\u7b2c 200 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 200", "contest_title_slug": "weekly-contest-200", "contest_id": 235, "contest_start_time": 1596335400, "contest_duration": 5400, "user_num": 5476, "question_slugs": ["count-good-triplets", "find-the-winner-of-an-array-game", "minimum-swaps-to-arrange-a-binary-grid", "get-the-maximum-score"]}, {"contest_title": "\u7b2c 201 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 201", "contest_title_slug": "weekly-contest-201", "contest_id": 238, "contest_start_time": 1596940200, "contest_duration": 5400, "user_num": 5615, "question_slugs": ["make-the-string-great", "find-kth-bit-in-nth-binary-string", "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target", "minimum-cost-to-cut-a-stick"]}, {"contest_title": "\u7b2c 202 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 202", "contest_title_slug": "weekly-contest-202", "contest_id": 242, "contest_start_time": 1597545000, "contest_duration": 5400, "user_num": 4990, "question_slugs": ["three-consecutive-odds", "minimum-operations-to-make-array-equal", "magnetic-force-between-two-balls", "minimum-number-of-days-to-eat-n-oranges"]}, {"contest_title": "\u7b2c 203 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 203", "contest_title_slug": "weekly-contest-203", "contest_id": 244, "contest_start_time": 1598149800, "contest_duration": 5400, "user_num": 5285, "question_slugs": ["most-visited-sector-in-a-circular-track", "maximum-number-of-coins-you-can-get", "find-latest-group-of-size-m", "stone-game-v"]}, {"contest_title": "\u7b2c 204 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 204", "contest_title_slug": "weekly-contest-204", "contest_id": 257, "contest_start_time": 1598754600, "contest_duration": 5400, "user_num": 4487, "question_slugs": ["detect-pattern-of-length-m-repeated-k-or-more-times", "maximum-length-of-subarray-with-positive-product", "minimum-number-of-days-to-disconnect-island", "number-of-ways-to-reorder-array-to-get-same-bst"]}, {"contest_title": "\u7b2c 205 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 205", "contest_title_slug": "weekly-contest-205", "contest_id": 260, "contest_start_time": 1599359400, "contest_duration": 5400, "user_num": 4176, "question_slugs": ["replace-all-s-to-avoid-consecutive-repeating-characters", "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers", "minimum-time-to-make-rope-colorful", "remove-max-number-of-edges-to-keep-graph-fully-traversable"]}, {"contest_title": "\u7b2c 206 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 206", "contest_title_slug": "weekly-contest-206", "contest_id": 267, "contest_start_time": 1599964200, "contest_duration": 5400, "user_num": 4493, "question_slugs": ["special-positions-in-a-binary-matrix", "count-unhappy-friends", "min-cost-to-connect-all-points", "check-if-string-is-transformable-with-substring-sort-operations"]}, {"contest_title": "\u7b2c 207 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 207", "contest_title_slug": "weekly-contest-207", "contest_id": 278, "contest_start_time": 1600569000, "contest_duration": 5400, "user_num": 4116, "question_slugs": ["rearrange-spaces-between-words", "split-a-string-into-the-max-number-of-unique-substrings", "maximum-non-negative-product-in-a-matrix", "minimum-cost-to-connect-two-groups-of-points"]}, {"contest_title": "\u7b2c 208 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 208", "contest_title_slug": "weekly-contest-208", "contest_id": 289, "contest_start_time": 1601173800, "contest_duration": 5400, "user_num": 3582, "question_slugs": ["crawler-log-folder", "maximum-profit-of-operating-a-centennial-wheel", "throne-inheritance", "maximum-number-of-achievable-transfer-requests"]}, {"contest_title": "\u7b2c 209 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 209", "contest_title_slug": "weekly-contest-209", "contest_id": 291, "contest_start_time": 1601778600, "contest_duration": 5400, "user_num": 4023, "question_slugs": ["special-array-with-x-elements-greater-than-or-equal-x", "even-odd-tree", "maximum-number-of-visible-points", "minimum-one-bit-operations-to-make-integers-zero"]}, {"contest_title": "\u7b2c 210 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 210", "contest_title_slug": "weekly-contest-210", "contest_id": 295, "contest_start_time": 1602383400, "contest_duration": 5400, "user_num": 4007, "question_slugs": ["maximum-nesting-depth-of-the-parentheses", "maximal-network-rank", "split-two-strings-to-make-palindrome", "count-subtrees-with-max-distance-between-cities"]}, {"contest_title": "\u7b2c 211 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 211", "contest_title_slug": "weekly-contest-211", "contest_id": 297, "contest_start_time": 1602988200, "contest_duration": 5400, "user_num": 4034, "question_slugs": ["largest-substring-between-two-equal-characters", "lexicographically-smallest-string-after-applying-operations", "best-team-with-no-conflicts", "graph-connectivity-with-threshold"]}, {"contest_title": "\u7b2c 212 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 212", "contest_title_slug": "weekly-contest-212", "contest_id": 301, "contest_start_time": 1603593000, "contest_duration": 5400, "user_num": 4227, "question_slugs": ["slowest-key", "arithmetic-subarrays", "path-with-minimum-effort", "rank-transform-of-a-matrix"]}, {"contest_title": "\u7b2c 213 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 213", "contest_title_slug": "weekly-contest-213", "contest_id": 303, "contest_start_time": 1604197800, "contest_duration": 5400, "user_num": 3827, "question_slugs": ["check-array-formation-through-concatenation", "count-sorted-vowel-strings", "furthest-building-you-can-reach", "kth-smallest-instructions"]}, {"contest_title": "\u7b2c 214 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 214", "contest_title_slug": "weekly-contest-214", "contest_id": 307, "contest_start_time": 1604802600, "contest_duration": 5400, "user_num": 3598, "question_slugs": ["get-maximum-in-generated-array", "minimum-deletions-to-make-character-frequencies-unique", "sell-diminishing-valued-colored-balls", "create-sorted-array-through-instructions"]}, {"contest_title": "\u7b2c 215 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 215", "contest_title_slug": "weekly-contest-215", "contest_id": 309, "contest_start_time": 1605407400, "contest_duration": 5400, "user_num": 4429, "question_slugs": ["design-an-ordered-stream", "determine-if-two-strings-are-close", "minimum-operations-to-reduce-x-to-zero", "maximize-grid-happiness"]}, {"contest_title": "\u7b2c 216 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 216", "contest_title_slug": "weekly-contest-216", "contest_id": 313, "contest_start_time": 1606012200, "contest_duration": 5400, "user_num": 3857, "question_slugs": ["check-if-two-string-arrays-are-equivalent", "smallest-string-with-a-given-numeric-value", "ways-to-make-a-fair-array", "minimum-initial-energy-to-finish-tasks"]}, {"contest_title": "\u7b2c 217 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 217", "contest_title_slug": "weekly-contest-217", "contest_id": 315, "contest_start_time": 1606617000, "contest_duration": 5400, "user_num": 3745, "question_slugs": ["richest-customer-wealth", "find-the-most-competitive-subsequence", "minimum-moves-to-make-array-complementary", "minimize-deviation-in-array"]}, {"contest_title": "\u7b2c 218 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 218", "contest_title_slug": "weekly-contest-218", "contest_id": 319, "contest_start_time": 1607221800, "contest_duration": 5400, "user_num": 3762, "question_slugs": ["goal-parser-interpretation", "max-number-of-k-sum-pairs", "concatenation-of-consecutive-binary-numbers", "minimum-incompatibility"]}, {"contest_title": "\u7b2c 219 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 219", "contest_title_slug": "weekly-contest-219", "contest_id": 322, "contest_start_time": 1607826600, "contest_duration": 5400, "user_num": 3710, "question_slugs": ["count-of-matches-in-tournament", "partitioning-into-minimum-number-of-deci-binary-numbers", "stone-game-vii", "maximum-height-by-stacking-cuboids"]}, {"contest_title": "\u7b2c 220 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 220", "contest_title_slug": "weekly-contest-220", "contest_id": 326, "contest_start_time": 1608431400, "contest_duration": 5400, "user_num": 3691, "question_slugs": ["reformat-phone-number", "maximum-erasure-value", "jump-game-vi", "checking-existence-of-edge-length-limited-paths"]}, {"contest_title": "\u7b2c 221 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 221", "contest_title_slug": "weekly-contest-221", "contest_id": 328, "contest_start_time": 1609036200, "contest_duration": 5400, "user_num": 3398, "question_slugs": ["determine-if-string-halves-are-alike", "maximum-number-of-eaten-apples", "where-will-the-ball-fall", "maximum-xor-with-an-element-from-array"]}, {"contest_title": "\u7b2c 222 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 222", "contest_title_slug": "weekly-contest-222", "contest_id": 332, "contest_start_time": 1609641000, "contest_duration": 5400, "user_num": 3119, "question_slugs": ["maximum-units-on-a-truck", "count-good-meals", "ways-to-split-array-into-three-subarrays", "minimum-operations-to-make-a-subsequence"]}, {"contest_title": "\u7b2c 223 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 223", "contest_title_slug": "weekly-contest-223", "contest_id": 334, "contest_start_time": 1610245800, "contest_duration": 5400, "user_num": 3872, "question_slugs": ["decode-xored-array", "swapping-nodes-in-a-linked-list", "minimize-hamming-distance-after-swap-operations", "find-minimum-time-to-finish-all-jobs"]}, {"contest_title": "\u7b2c 224 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 224", "contest_title_slug": "weekly-contest-224", "contest_id": 338, "contest_start_time": 1610850600, "contest_duration": 5400, "user_num": 3795, "question_slugs": ["number-of-rectangles-that-can-form-the-largest-square", "tuple-with-same-product", "largest-submatrix-with-rearrangements", "cat-and-mouse-ii"]}, {"contest_title": "\u7b2c 225 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 225", "contest_title_slug": "weekly-contest-225", "contest_id": 340, "contest_start_time": 1611455400, "contest_duration": 5400, "user_num": 3853, "question_slugs": ["latest-time-by-replacing-hidden-digits", "change-minimum-characters-to-satisfy-one-of-three-conditions", "find-kth-largest-xor-coordinate-value", "building-boxes"]}, {"contest_title": "\u7b2c 226 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 226", "contest_title_slug": "weekly-contest-226", "contest_id": 344, "contest_start_time": 1612060200, "contest_duration": 5400, "user_num": 4034, "question_slugs": ["maximum-number-of-balls-in-a-box", "restore-the-array-from-adjacent-pairs", "can-you-eat-your-favorite-candy-on-your-favorite-day", "palindrome-partitioning-iv"]}, {"contest_title": "\u7b2c 227 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 227", "contest_title_slug": "weekly-contest-227", "contest_id": 346, "contest_start_time": 1612665000, "contest_duration": 5400, "user_num": 3546, "question_slugs": ["check-if-array-is-sorted-and-rotated", "maximum-score-from-removing-stones", "largest-merge-of-two-strings", "closest-subsequence-sum"]}, {"contest_title": "\u7b2c 228 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 228", "contest_title_slug": "weekly-contest-228", "contest_id": 350, "contest_start_time": 1613269800, "contest_duration": 5400, "user_num": 2484, "question_slugs": ["minimum-changes-to-make-alternating-binary-string", "count-number-of-homogenous-substrings", "minimum-limit-of-balls-in-a-bag", "minimum-degree-of-a-connected-trio-in-a-graph"]}, {"contest_title": "\u7b2c 229 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 229", "contest_title_slug": "weekly-contest-229", "contest_id": 352, "contest_start_time": 1613874600, "contest_duration": 5400, "user_num": 3484, "question_slugs": ["merge-strings-alternately", "minimum-number-of-operations-to-move-all-balls-to-each-box", "maximum-score-from-performing-multiplication-operations", "maximize-palindrome-length-from-subsequences"]}, {"contest_title": "\u7b2c 230 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 230", "contest_title_slug": "weekly-contest-230", "contest_id": 356, "contest_start_time": 1614479400, "contest_duration": 5400, "user_num": 3728, "question_slugs": ["count-items-matching-a-rule", "closest-dessert-cost", "equal-sum-arrays-with-minimum-number-of-operations", "car-fleet-ii"]}, {"contest_title": "\u7b2c 231 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 231", "contest_title_slug": "weekly-contest-231", "contest_id": 358, "contest_start_time": 1615084200, "contest_duration": 5400, "user_num": 4668, "question_slugs": ["check-if-binary-string-has-at-most-one-segment-of-ones", "minimum-elements-to-add-to-form-a-given-sum", "number-of-restricted-paths-from-first-to-last-node", "make-the-xor-of-all-segments-equal-to-zero"]}, {"contest_title": "\u7b2c 232 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 232", "contest_title_slug": "weekly-contest-232", "contest_id": 363, "contest_start_time": 1615689000, "contest_duration": 5400, "user_num": 4802, "question_slugs": ["check-if-one-string-swap-can-make-strings-equal", "find-center-of-star-graph", "maximum-average-pass-ratio", "maximum-score-of-a-good-subarray"]}, {"contest_title": "\u7b2c 233 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 233", "contest_title_slug": "weekly-contest-233", "contest_id": 371, "contest_start_time": 1616293800, "contest_duration": 5400, "user_num": 5010, "question_slugs": ["maximum-ascending-subarray-sum", "number-of-orders-in-the-backlog", "maximum-value-at-a-given-index-in-a-bounded-array", "count-pairs-with-xor-in-a-range"]}, {"contest_title": "\u7b2c 234 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 234", "contest_title_slug": "weekly-contest-234", "contest_id": 375, "contest_start_time": 1616898600, "contest_duration": 5400, "user_num": 4998, "question_slugs": ["number-of-different-integers-in-a-string", "minimum-number-of-operations-to-reinitialize-a-permutation", "evaluate-the-bracket-pairs-of-a-string", "maximize-number-of-nice-divisors"]}, {"contest_title": "\u7b2c 235 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 235", "contest_title_slug": "weekly-contest-235", "contest_id": 377, "contest_start_time": 1617503400, "contest_duration": 5400, "user_num": 4494, "question_slugs": ["truncate-sentence", "finding-the-users-active-minutes", "minimum-absolute-sum-difference", "number-of-different-subsequences-gcds"]}, {"contest_title": "\u7b2c 236 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 236", "contest_title_slug": "weekly-contest-236", "contest_id": 391, "contest_start_time": 1618108200, "contest_duration": 5400, "user_num": 5113, "question_slugs": ["sign-of-the-product-of-an-array", "find-the-winner-of-the-circular-game", "minimum-sideway-jumps", "finding-mk-average"]}, {"contest_title": "\u7b2c 237 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 237", "contest_title_slug": "weekly-contest-237", "contest_id": 393, "contest_start_time": 1618713000, "contest_duration": 5400, "user_num": 4577, "question_slugs": ["check-if-the-sentence-is-pangram", "maximum-ice-cream-bars", "single-threaded-cpu", "find-xor-sum-of-all-pairs-bitwise-and"]}, {"contest_title": "\u7b2c 238 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 238", "contest_title_slug": "weekly-contest-238", "contest_id": 397, "contest_start_time": 1619317800, "contest_duration": 5400, "user_num": 3978, "question_slugs": ["sum-of-digits-in-base-k", "frequency-of-the-most-frequent-element", "longest-substring-of-all-vowels-in-order", "maximum-building-height"]}, {"contest_title": "\u7b2c 239 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 239", "contest_title_slug": "weekly-contest-239", "contest_id": 399, "contest_start_time": 1619922600, "contest_duration": 5400, "user_num": 3907, "question_slugs": ["minimum-distance-to-the-target-element", "splitting-a-string-into-descending-consecutive-values", "minimum-adjacent-swaps-to-reach-the-kth-smallest-number", "minimum-interval-to-include-each-query"]}, {"contest_title": "\u7b2c 240 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 240", "contest_title_slug": "weekly-contest-240", "contest_id": 403, "contest_start_time": 1620527400, "contest_duration": 5400, "user_num": 4307, "question_slugs": ["maximum-population-year", "maximum-distance-between-a-pair-of-values", "maximum-subarray-min-product", "largest-color-value-in-a-directed-graph"]}, {"contest_title": "\u7b2c 241 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 241", "contest_title_slug": "weekly-contest-241", "contest_id": 405, "contest_start_time": 1621132200, "contest_duration": 5400, "user_num": 4491, "question_slugs": ["sum-of-all-subset-xor-totals", "minimum-number-of-swaps-to-make-the-binary-string-alternating", "finding-pairs-with-a-certain-sum", "number-of-ways-to-rearrange-sticks-with-k-sticks-visible"]}, {"contest_title": "\u7b2c 242 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 242", "contest_title_slug": "weekly-contest-242", "contest_id": 409, "contest_start_time": 1621737000, "contest_duration": 5400, "user_num": 4306, "question_slugs": ["longer-contiguous-segments-of-ones-than-zeros", "minimum-speed-to-arrive-on-time", "jump-game-vii", "stone-game-viii"]}, {"contest_title": "\u7b2c 243 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 243", "contest_title_slug": "weekly-contest-243", "contest_id": 411, "contest_start_time": 1622341800, "contest_duration": 5400, "user_num": 4493, "question_slugs": ["check-if-word-equals-summation-of-two-words", "maximum-value-after-insertion", "process-tasks-using-servers", "minimum-skips-to-arrive-at-meeting-on-time"]}, {"contest_title": "\u7b2c 244 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 244", "contest_title_slug": "weekly-contest-244", "contest_id": 415, "contest_start_time": 1622946600, "contest_duration": 5400, "user_num": 4430, "question_slugs": ["determine-whether-matrix-can-be-obtained-by-rotation", "reduction-operations-to-make-the-array-elements-equal", "minimum-number-of-flips-to-make-the-binary-string-alternating", "minimum-space-wasted-from-packaging"]}, {"contest_title": "\u7b2c 245 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 245", "contest_title_slug": "weekly-contest-245", "contest_id": 417, "contest_start_time": 1623551400, "contest_duration": 5400, "user_num": 4271, "question_slugs": ["redistribute-characters-to-make-all-strings-equal", "maximum-number-of-removable-characters", "merge-triplets-to-form-target-triplet", "the-earliest-and-latest-rounds-where-players-compete"]}, {"contest_title": "\u7b2c 246 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 246", "contest_title_slug": "weekly-contest-246", "contest_id": 422, "contest_start_time": 1624156200, "contest_duration": 5400, "user_num": 4136, "question_slugs": ["largest-odd-number-in-string", "the-number-of-full-rounds-you-have-played", "count-sub-islands", "minimum-absolute-difference-queries"]}, {"contest_title": "\u7b2c 247 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 247", "contest_title_slug": "weekly-contest-247", "contest_id": 426, "contest_start_time": 1624761000, "contest_duration": 5400, "user_num": 3981, "question_slugs": ["maximum-product-difference-between-two-pairs", "cyclically-rotating-a-grid", "number-of-wonderful-substrings", "count-ways-to-build-rooms-in-an-ant-colony"]}, {"contest_title": "\u7b2c 248 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 248", "contest_title_slug": "weekly-contest-248", "contest_id": 430, "contest_start_time": 1625365800, "contest_duration": 5400, "user_num": 4451, "question_slugs": ["build-array-from-permutation", "eliminate-maximum-number-of-monsters", "count-good-numbers", "longest-common-subpath"]}, {"contest_title": "\u7b2c 249 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 249", "contest_title_slug": "weekly-contest-249", "contest_id": 432, "contest_start_time": 1625970600, "contest_duration": 5400, "user_num": 4335, "question_slugs": ["concatenation-of-array", "unique-length-3-palindromic-subsequences", "painting-a-grid-with-three-different-colors", "merge-bsts-to-create-single-bst"]}, {"contest_title": "\u7b2c 250 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 250", "contest_title_slug": "weekly-contest-250", "contest_id": 436, "contest_start_time": 1626575400, "contest_duration": 5400, "user_num": 4315, "question_slugs": ["maximum-number-of-words-you-can-type", "add-minimum-number-of-rungs", "maximum-number-of-points-with-cost", "maximum-genetic-difference-query"]}, {"contest_title": "\u7b2c 251 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 251", "contest_title_slug": "weekly-contest-251", "contest_id": 438, "contest_start_time": 1627180200, "contest_duration": 5400, "user_num": 4747, "question_slugs": ["sum-of-digits-of-string-after-convert", "largest-number-after-mutating-substring", "maximum-compatibility-score-sum", "delete-duplicate-folders-in-system"]}, {"contest_title": "\u7b2c 252 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 252", "contest_title_slug": "weekly-contest-252", "contest_id": 442, "contest_start_time": 1627785000, "contest_duration": 5400, "user_num": 4647, "question_slugs": ["three-divisors", "maximum-number-of-weeks-for-which-you-can-work", "minimum-garden-perimeter-to-collect-enough-apples", "count-number-of-special-subsequences"]}, {"contest_title": "\u7b2c 253 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 253", "contest_title_slug": "weekly-contest-253", "contest_id": 444, "contest_start_time": 1628389800, "contest_duration": 5400, "user_num": 4570, "question_slugs": ["check-if-string-is-a-prefix-of-array", "remove-stones-to-minimize-the-total", "minimum-number-of-swaps-to-make-the-string-balanced", "find-the-longest-valid-obstacle-course-at-each-position"]}, {"contest_title": "\u7b2c 254 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 254", "contest_title_slug": "weekly-contest-254", "contest_id": 449, "contest_start_time": 1628994600, "contest_duration": 5400, "user_num": 4349, "question_slugs": ["number-of-strings-that-appear-as-substrings-in-word", "array-with-elements-not-equal-to-average-of-neighbors", "minimum-non-zero-product-of-the-array-elements", "last-day-where-you-can-still-cross"]}, {"contest_title": "\u7b2c 255 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 255", "contest_title_slug": "weekly-contest-255", "contest_id": 457, "contest_start_time": 1629599400, "contest_duration": 5400, "user_num": 4333, "question_slugs": ["find-greatest-common-divisor-of-array", "find-unique-binary-string", "minimize-the-difference-between-target-and-chosen-elements", "find-array-given-subset-sums"]}, {"contest_title": "\u7b2c 256 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 256", "contest_title_slug": "weekly-contest-256", "contest_id": 462, "contest_start_time": 1630204200, "contest_duration": 5400, "user_num": 4136, "question_slugs": ["minimum-difference-between-highest-and-lowest-of-k-scores", "find-the-kth-largest-integer-in-the-array", "minimum-number-of-work-sessions-to-finish-the-tasks", "number-of-unique-good-subsequences"]}, {"contest_title": "\u7b2c 257 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 257", "contest_title_slug": "weekly-contest-257", "contest_id": 464, "contest_start_time": 1630809000, "contest_duration": 5400, "user_num": 4278, "question_slugs": ["count-special-quadruplets", "the-number-of-weak-characters-in-the-game", "first-day-where-you-have-been-in-all-the-rooms", "gcd-sort-of-an-array"]}, {"contest_title": "\u7b2c 258 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 258", "contest_title_slug": "weekly-contest-258", "contest_id": 468, "contest_start_time": 1631413800, "contest_duration": 5400, "user_num": 4519, "question_slugs": ["reverse-prefix-of-word", "number-of-pairs-of-interchangeable-rectangles", "maximum-product-of-the-length-of-two-palindromic-subsequences", "smallest-missing-genetic-value-in-each-subtree"]}, {"contest_title": "\u7b2c 259 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 259", "contest_title_slug": "weekly-contest-259", "contest_id": 474, "contest_start_time": 1632018600, "contest_duration": 5400, "user_num": 3775, "question_slugs": ["final-value-of-variable-after-performing-operations", "sum-of-beauty-in-the-array", "detect-squares", "longest-subsequence-repeated-k-times"]}, {"contest_title": "\u7b2c 260 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 260", "contest_title_slug": "weekly-contest-260", "contest_id": 478, "contest_start_time": 1632623400, "contest_duration": 5400, "user_num": 3654, "question_slugs": ["maximum-difference-between-increasing-elements", "grid-game", "check-if-word-can-be-placed-in-crossword", "the-score-of-students-solving-math-expression"]}, {"contest_title": "\u7b2c 261 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 261", "contest_title_slug": "weekly-contest-261", "contest_id": 481, "contest_start_time": 1633228200, "contest_duration": 5400, "user_num": 3368, "question_slugs": ["minimum-moves-to-convert-string", "find-missing-observations", "stone-game-ix", "smallest-k-length-subsequence-with-occurrences-of-a-letter"]}, {"contest_title": "\u7b2c 262 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 262", "contest_title_slug": "weekly-contest-262", "contest_id": 485, "contest_start_time": 1633833000, "contest_duration": 5400, "user_num": 4261, "question_slugs": ["two-out-of-three", "minimum-operations-to-make-a-uni-value-grid", "stock-price-fluctuation", "partition-array-into-two-arrays-to-minimize-sum-difference"]}, {"contest_title": "\u7b2c 263 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 263", "contest_title_slug": "weekly-contest-263", "contest_id": 487, "contest_start_time": 1634437800, "contest_duration": 5400, "user_num": 4572, "question_slugs": ["check-if-numbers-are-ascending-in-a-sentence", "simple-bank-system", "count-number-of-maximum-bitwise-or-subsets", "second-minimum-time-to-reach-destination"]}, {"contest_title": "\u7b2c 264 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 264", "contest_title_slug": "weekly-contest-264", "contest_id": 491, "contest_start_time": 1635042600, "contest_duration": 5400, "user_num": 4659, "question_slugs": ["number-of-valid-words-in-a-sentence", "next-greater-numerically-balanced-number", "count-nodes-with-the-highest-score", "parallel-courses-iii"]}, {"contest_title": "\u7b2c 265 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 265", "contest_title_slug": "weekly-contest-265", "contest_id": 493, "contest_start_time": 1635647400, "contest_duration": 5400, "user_num": 4182, "question_slugs": ["smallest-index-with-equal-value", "find-the-minimum-and-maximum-number-of-nodes-between-critical-points", "minimum-operations-to-convert-number", "check-if-an-original-string-exists-given-two-encoded-strings"]}, {"contest_title": "\u7b2c 266 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 266", "contest_title_slug": "weekly-contest-266", "contest_id": 498, "contest_start_time": 1636252200, "contest_duration": 5400, "user_num": 4385, "question_slugs": ["count-vowel-substrings-of-a-string", "vowels-of-all-substrings", "minimized-maximum-of-products-distributed-to-any-store", "maximum-path-quality-of-a-graph"]}, {"contest_title": "\u7b2c 267 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 267", "contest_title_slug": "weekly-contest-267", "contest_id": 500, "contest_start_time": 1636857000, "contest_duration": 5400, "user_num": 4365, "question_slugs": ["time-needed-to-buy-tickets", "reverse-nodes-in-even-length-groups", "decode-the-slanted-ciphertext", "process-restricted-friend-requests"]}, {"contest_title": "\u7b2c 268 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 268", "contest_title_slug": "weekly-contest-268", "contest_id": 504, "contest_start_time": 1637461800, "contest_duration": 5400, "user_num": 4398, "question_slugs": ["two-furthest-houses-with-different-colors", "watering-plants", "range-frequency-queries", "sum-of-k-mirror-numbers"]}, {"contest_title": "\u7b2c 269 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 269", "contest_title_slug": "weekly-contest-269", "contest_id": 506, "contest_start_time": 1638066600, "contest_duration": 5400, "user_num": 4293, "question_slugs": ["find-target-indices-after-sorting-array", "k-radius-subarray-averages", "removing-minimum-and-maximum-from-array", "find-all-people-with-secret"]}, {"contest_title": "\u7b2c 270 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 270", "contest_title_slug": "weekly-contest-270", "contest_id": 510, "contest_start_time": 1638671400, "contest_duration": 5400, "user_num": 4748, "question_slugs": ["finding-3-digit-even-numbers", "delete-the-middle-node-of-a-linked-list", "step-by-step-directions-from-a-binary-tree-node-to-another", "valid-arrangement-of-pairs"]}, {"contest_title": "\u7b2c 271 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 271", "contest_title_slug": "weekly-contest-271", "contest_id": 512, "contest_start_time": 1639276200, "contest_duration": 5400, "user_num": 4562, "question_slugs": ["rings-and-rods", "sum-of-subarray-ranges", "watering-plants-ii", "maximum-fruits-harvested-after-at-most-k-steps"]}, {"contest_title": "\u7b2c 272 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 272", "contest_title_slug": "weekly-contest-272", "contest_id": 516, "contest_start_time": 1639881000, "contest_duration": 5400, "user_num": 4698, "question_slugs": ["find-first-palindromic-string-in-the-array", "adding-spaces-to-a-string", "number-of-smooth-descent-periods-of-a-stock", "minimum-operations-to-make-the-array-k-increasing"]}, {"contest_title": "\u7b2c 273 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 273", "contest_title_slug": "weekly-contest-273", "contest_id": 518, "contest_start_time": 1640485800, "contest_duration": 5400, "user_num": 4368, "question_slugs": ["a-number-after-a-double-reversal", "execution-of-all-suffix-instructions-staying-in-a-grid", "intervals-between-identical-elements", "recover-the-original-array"]}, {"contest_title": "\u7b2c 274 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 274", "contest_title_slug": "weekly-contest-274", "contest_id": 522, "contest_start_time": 1641090600, "contest_duration": 5400, "user_num": 4109, "question_slugs": ["check-if-all-as-appears-before-all-bs", "number-of-laser-beams-in-a-bank", "destroying-asteroids", "maximum-employees-to-be-invited-to-a-meeting"]}, {"contest_title": "\u7b2c 275 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 275", "contest_title_slug": "weekly-contest-275", "contest_id": 524, "contest_start_time": 1641695400, "contest_duration": 5400, "user_num": 4787, "question_slugs": ["check-if-every-row-and-column-contains-all-numbers", "minimum-swaps-to-group-all-1s-together-ii", "count-words-obtained-after-adding-a-letter", "earliest-possible-day-of-full-bloom"]}, {"contest_title": "\u7b2c 276 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 276", "contest_title_slug": "weekly-contest-276", "contest_id": 528, "contest_start_time": 1642300200, "contest_duration": 5400, "user_num": 5244, "question_slugs": ["divide-a-string-into-groups-of-size-k", "minimum-moves-to-reach-target-score", "solving-questions-with-brainpower", "maximum-running-time-of-n-computers"]}, {"contest_title": "\u7b2c 277 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 277", "contest_title_slug": "weekly-contest-277", "contest_id": 530, "contest_start_time": 1642905000, "contest_duration": 5400, "user_num": 5060, "question_slugs": ["count-elements-with-strictly-smaller-and-greater-elements", "rearrange-array-elements-by-sign", "find-all-lonely-numbers-in-the-array", "maximum-good-people-based-on-statements"]}, {"contest_title": "\u7b2c 278 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 278", "contest_title_slug": "weekly-contest-278", "contest_id": 534, "contest_start_time": 1643509800, "contest_duration": 5400, "user_num": 4643, "question_slugs": ["keep-multiplying-found-values-by-two", "all-divisions-with-the-highest-score-of-a-binary-array", "find-substring-with-given-hash-value", "groups-of-strings"]}, {"contest_title": "\u7b2c 279 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 279", "contest_title_slug": "weekly-contest-279", "contest_id": 536, "contest_start_time": 1644114600, "contest_duration": 5400, "user_num": 4132, "question_slugs": ["sort-even-and-odd-indices-independently", "smallest-value-of-the-rearranged-number", "design-bitset", "minimum-time-to-remove-all-cars-containing-illegal-goods"]}, {"contest_title": "\u7b2c 280 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 280", "contest_title_slug": "weekly-contest-280", "contest_id": 540, "contest_start_time": 1644719400, "contest_duration": 5400, "user_num": 5834, "question_slugs": ["count-operations-to-obtain-zero", "minimum-operations-to-make-the-array-alternating", "removing-minimum-number-of-magic-beans", "maximum-and-sum-of-array"]}, {"contest_title": "\u7b2c 281 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 281", "contest_title_slug": "weekly-contest-281", "contest_id": 542, "contest_start_time": 1645324200, "contest_duration": 6000, "user_num": 6005, "question_slugs": ["count-integers-with-even-digit-sum", "merge-nodes-in-between-zeros", "construct-string-with-repeat-limit", "count-array-pairs-divisible-by-k"]}, {"contest_title": "\u7b2c 282 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 282", "contest_title_slug": "weekly-contest-282", "contest_id": 546, "contest_start_time": 1645929000, "contest_duration": 5400, "user_num": 7164, "question_slugs": ["counting-words-with-a-given-prefix", "minimum-number-of-steps-to-make-two-strings-anagram-ii", "minimum-time-to-complete-trips", "minimum-time-to-finish-the-race"]}, {"contest_title": "\u7b2c 283 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 283", "contest_title_slug": "weekly-contest-283", "contest_id": 551, "contest_start_time": 1646533800, "contest_duration": 5400, "user_num": 7817, "question_slugs": ["cells-in-a-range-on-an-excel-sheet", "append-k-integers-with-minimal-sum", "create-binary-tree-from-descriptions", "replace-non-coprime-numbers-in-array"]}, {"contest_title": "\u7b2c 284 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 284", "contest_title_slug": "weekly-contest-284", "contest_id": 555, "contest_start_time": 1647138600, "contest_duration": 5400, "user_num": 8483, "question_slugs": ["find-all-k-distant-indices-in-an-array", "count-artifacts-that-can-be-extracted", "maximize-the-topmost-element-after-k-moves", "minimum-weighted-subgraph-with-the-required-paths"]}, {"contest_title": "\u7b2c 285 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 285", "contest_title_slug": "weekly-contest-285", "contest_id": 558, "contest_start_time": 1647743400, "contest_duration": 5400, "user_num": 7501, "question_slugs": ["count-hills-and-valleys-in-an-array", "count-collisions-on-a-road", "maximum-points-in-an-archery-competition", "longest-substring-of-one-repeating-character"]}, {"contest_title": "\u7b2c 286 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 286", "contest_title_slug": "weekly-contest-286", "contest_id": 564, "contest_start_time": 1648348200, "contest_duration": 5400, "user_num": 7248, "question_slugs": ["find-the-difference-of-two-arrays", "minimum-deletions-to-make-array-beautiful", "find-palindrome-with-fixed-length", "maximum-value-of-k-coins-from-piles"]}, {"contest_title": "\u7b2c 287 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 287", "contest_title_slug": "weekly-contest-287", "contest_id": 569, "contest_start_time": 1648953000, "contest_duration": 5400, "user_num": 6811, "question_slugs": ["minimum-number-of-operations-to-convert-time", "find-players-with-zero-or-one-losses", "maximum-candies-allocated-to-k-children", "encrypt-and-decrypt-strings"]}, {"contest_title": "\u7b2c 288 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 288", "contest_title_slug": "weekly-contest-288", "contest_id": 573, "contest_start_time": 1649557800, "contest_duration": 5400, "user_num": 6926, "question_slugs": ["largest-number-after-digit-swaps-by-parity", "minimize-result-by-adding-parentheses-to-expression", "maximum-product-after-k-increments", "maximum-total-beauty-of-the-gardens"]}, {"contest_title": "\u7b2c 289 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 289", "contest_title_slug": "weekly-contest-289", "contest_id": 576, "contest_start_time": 1650162600, "contest_duration": 5400, "user_num": 7293, "question_slugs": ["calculate-digit-sum-of-a-string", "minimum-rounds-to-complete-all-tasks", "maximum-trailing-zeros-in-a-cornered-path", "longest-path-with-different-adjacent-characters"]}, {"contest_title": "\u7b2c 290 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 290", "contest_title_slug": "weekly-contest-290", "contest_id": 582, "contest_start_time": 1650767400, "contest_duration": 5400, "user_num": 6275, "question_slugs": ["intersection-of-multiple-arrays", "count-lattice-points-inside-a-circle", "count-number-of-rectangles-containing-each-point", "number-of-flowers-in-full-bloom"]}, {"contest_title": "\u7b2c 291 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 291", "contest_title_slug": "weekly-contest-291", "contest_id": 587, "contest_start_time": 1651372200, "contest_duration": 5400, "user_num": 6574, "question_slugs": ["remove-digit-from-number-to-maximize-result", "minimum-consecutive-cards-to-pick-up", "k-divisible-elements-subarrays", "total-appeal-of-a-string"]}, {"contest_title": "\u7b2c 292 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 292", "contest_title_slug": "weekly-contest-292", "contest_id": 591, "contest_start_time": 1651977000, "contest_duration": 5400, "user_num": 6884, "question_slugs": ["largest-3-same-digit-number-in-string", "count-nodes-equal-to-average-of-subtree", "count-number-of-texts", "check-if-there-is-a-valid-parentheses-string-path"]}, {"contest_title": "\u7b2c 293 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 293", "contest_title_slug": "weekly-contest-293", "contest_id": 593, "contest_start_time": 1652581800, "contest_duration": 5400, "user_num": 7357, "question_slugs": ["find-resultant-array-after-removing-anagrams", "maximum-consecutive-floors-without-special-floors", "largest-combination-with-bitwise-and-greater-than-zero", "count-integers-in-intervals"]}, {"contest_title": "\u7b2c 294 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 294", "contest_title_slug": "weekly-contest-294", "contest_id": 599, "contest_start_time": 1653186600, "contest_duration": 5400, "user_num": 6640, "question_slugs": ["percentage-of-letter-in-string", "maximum-bags-with-full-capacity-of-rocks", "minimum-lines-to-represent-a-line-chart", "sum-of-total-strength-of-wizards"]}, {"contest_title": "\u7b2c 295 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 295", "contest_title_slug": "weekly-contest-295", "contest_id": 605, "contest_start_time": 1653791400, "contest_duration": 5400, "user_num": 6447, "question_slugs": ["rearrange-characters-to-make-target-string", "apply-discount-to-prices", "steps-to-make-array-non-decreasing", "minimum-obstacle-removal-to-reach-corner"]}, {"contest_title": "\u7b2c 296 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 296", "contest_title_slug": "weekly-contest-296", "contest_id": 609, "contest_start_time": 1654396200, "contest_duration": 5400, "user_num": 5721, "question_slugs": ["min-max-game", "partition-array-such-that-maximum-difference-is-k", "replace-elements-in-an-array", "design-a-text-editor"]}, {"contest_title": "\u7b2c 297 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 297", "contest_title_slug": "weekly-contest-297", "contest_id": 611, "contest_start_time": 1655001000, "contest_duration": 5400, "user_num": 5915, "question_slugs": ["calculate-amount-paid-in-taxes", "minimum-path-cost-in-a-grid", "fair-distribution-of-cookies", "naming-a-company"]}, {"contest_title": "\u7b2c 298 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 298", "contest_title_slug": "weekly-contest-298", "contest_id": 615, "contest_start_time": 1655605800, "contest_duration": 5400, "user_num": 6228, "question_slugs": ["greatest-english-letter-in-upper-and-lower-case", "sum-of-numbers-with-units-digit-k", "longest-binary-subsequence-less-than-or-equal-to-k", "selling-pieces-of-wood"]}, {"contest_title": "\u7b2c 299 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 299", "contest_title_slug": "weekly-contest-299", "contest_id": 618, "contest_start_time": 1656210600, "contest_duration": 5400, "user_num": 6108, "question_slugs": ["check-if-matrix-is-x-matrix", "count-number-of-ways-to-place-houses", "maximum-score-of-spliced-array", "minimum-score-after-removals-on-a-tree"]}, {"contest_title": "\u7b2c 300 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 300", "contest_title_slug": "weekly-contest-300", "contest_id": 647, "contest_start_time": 1656815400, "contest_duration": 5400, "user_num": 6792, "question_slugs": ["decode-the-message", "spiral-matrix-iv", "number-of-people-aware-of-a-secret", "number-of-increasing-paths-in-a-grid"]}, {"contest_title": "\u7b2c 301 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 301", "contest_title_slug": "weekly-contest-301", "contest_id": 649, "contest_start_time": 1657420200, "contest_duration": 5400, "user_num": 7133, "question_slugs": ["minimum-amount-of-time-to-fill-cups", "smallest-number-in-infinite-set", "move-pieces-to-obtain-a-string", "count-the-number-of-ideal-arrays"]}, {"contest_title": "\u7b2c 302 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 302", "contest_title_slug": "weekly-contest-302", "contest_id": 653, "contest_start_time": 1658025000, "contest_duration": 5400, "user_num": 7092, "question_slugs": ["maximum-number-of-pairs-in-array", "max-sum-of-a-pair-with-equal-sum-of-digits", "query-kth-smallest-trimmed-number", "minimum-deletions-to-make-array-divisible"]}, {"contest_title": "\u7b2c 303 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 303", "contest_title_slug": "weekly-contest-303", "contest_id": 655, "contest_start_time": 1658629800, "contest_duration": 5400, "user_num": 7032, "question_slugs": ["first-letter-to-appear-twice", "equal-row-and-column-pairs", "design-a-food-rating-system", "number-of-excellent-pairs"]}, {"contest_title": "\u7b2c 304 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 304", "contest_title_slug": "weekly-contest-304", "contest_id": 659, "contest_start_time": 1659234600, "contest_duration": 5400, "user_num": 7372, "question_slugs": ["make-array-zero-by-subtracting-equal-amounts", "maximum-number-of-groups-entering-a-competition", "find-closest-node-to-given-two-nodes", "longest-cycle-in-a-graph"]}, {"contest_title": "\u7b2c 305 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 305", "contest_title_slug": "weekly-contest-305", "contest_id": 663, "contest_start_time": 1659839400, "contest_duration": 5400, "user_num": 7465, "question_slugs": ["number-of-arithmetic-triplets", "reachable-nodes-with-restrictions", "check-if-there-is-a-valid-partition-for-the-array", "longest-ideal-subsequence"]}, {"contest_title": "\u7b2c 306 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 306", "contest_title_slug": "weekly-contest-306", "contest_id": 669, "contest_start_time": 1660444200, "contest_duration": 5400, "user_num": 7500, "question_slugs": ["largest-local-values-in-a-matrix", "node-with-highest-edge-score", "construct-smallest-number-from-di-string", "count-special-integers"]}, {"contest_title": "\u7b2c 307 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 307", "contest_title_slug": "weekly-contest-307", "contest_id": 671, "contest_start_time": 1661049000, "contest_duration": 5400, "user_num": 7064, "question_slugs": ["minimum-hours-of-training-to-win-a-competition", "largest-palindromic-number", "amount-of-time-for-binary-tree-to-be-infected", "find-the-k-sum-of-an-array"]}, {"contest_title": "\u7b2c 308 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 308", "contest_title_slug": "weekly-contest-308", "contest_id": 689, "contest_start_time": 1661653800, "contest_duration": 5400, "user_num": 6394, "question_slugs": ["longest-subsequence-with-limited-sum", "removing-stars-from-a-string", "minimum-amount-of-time-to-collect-garbage", "build-a-matrix-with-conditions"]}, {"contest_title": "\u7b2c 309 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 309", "contest_title_slug": "weekly-contest-309", "contest_id": 693, "contest_start_time": 1662258600, "contest_duration": 5400, "user_num": 7972, "question_slugs": ["check-distances-between-same-letters", "number-of-ways-to-reach-a-position-after-exactly-k-steps", "longest-nice-subarray", "meeting-rooms-iii"]}, {"contest_title": "\u7b2c 310 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 310", "contest_title_slug": "weekly-contest-310", "contest_id": 704, "contest_start_time": 1662863400, "contest_duration": 5400, "user_num": 6081, "question_slugs": ["most-frequent-even-element", "optimal-partition-of-string", "divide-intervals-into-minimum-number-of-groups", "longest-increasing-subsequence-ii"]}, {"contest_title": "\u7b2c 311 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 311", "contest_title_slug": "weekly-contest-311", "contest_id": 741, "contest_start_time": 1663468200, "contest_duration": 5400, "user_num": 6710, "question_slugs": ["smallest-even-multiple", "length-of-the-longest-alphabetical-continuous-substring", "reverse-odd-levels-of-binary-tree", "sum-of-prefix-scores-of-strings"]}, {"contest_title": "\u7b2c 312 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 312", "contest_title_slug": "weekly-contest-312", "contest_id": 746, "contest_start_time": 1664073000, "contest_duration": 5400, "user_num": 6638, "question_slugs": ["sort-the-people", "longest-subarray-with-maximum-bitwise-and", "find-all-good-indices", "number-of-good-paths"]}, {"contest_title": "\u7b2c 313 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 313", "contest_title_slug": "weekly-contest-313", "contest_id": 750, "contest_start_time": 1664677800, "contest_duration": 5400, "user_num": 5445, "question_slugs": ["number-of-common-factors", "maximum-sum-of-an-hourglass", "minimize-xor", "maximum-deletions-on-a-string"]}, {"contest_title": "\u7b2c 314 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 314", "contest_title_slug": "weekly-contest-314", "contest_id": 756, "contest_start_time": 1665282600, "contest_duration": 5400, "user_num": 4838, "question_slugs": ["the-employee-that-worked-on-the-longest-task", "find-the-original-array-of-prefix-xor", "using-a-robot-to-print-the-lexicographically-smallest-string", "paths-in-matrix-whose-sum-is-divisible-by-k"]}, {"contest_title": "\u7b2c 315 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 315", "contest_title_slug": "weekly-contest-315", "contest_id": 759, "contest_start_time": 1665887400, "contest_duration": 5400, "user_num": 6490, "question_slugs": ["largest-positive-integer-that-exists-with-its-negative", "count-number-of-distinct-integers-after-reverse-operations", "sum-of-number-and-its-reverse", "count-subarrays-with-fixed-bounds"]}, {"contest_title": "\u7b2c 316 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 316", "contest_title_slug": "weekly-contest-316", "contest_id": 764, "contest_start_time": 1666492200, "contest_duration": 5400, "user_num": 6387, "question_slugs": ["determine-if-two-events-have-conflict", "number-of-subarrays-with-gcd-equal-to-k", "minimum-cost-to-make-array-equal", "minimum-number-of-operations-to-make-arrays-similar"]}, {"contest_title": "\u7b2c 317 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 317", "contest_title_slug": "weekly-contest-317", "contest_id": 767, "contest_start_time": 1667097000, "contest_duration": 5400, "user_num": 5660, "question_slugs": ["average-value-of-even-numbers-that-are-divisible-by-three", "most-popular-video-creator", "minimum-addition-to-make-integer-beautiful", "height-of-binary-tree-after-subtree-removal-queries"]}, {"contest_title": "\u7b2c 318 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 318", "contest_title_slug": "weekly-contest-318", "contest_id": 771, "contest_start_time": 1667701800, "contest_duration": 5400, "user_num": 5670, "question_slugs": ["apply-operations-to-an-array", "maximum-sum-of-distinct-subarrays-with-length-k", "total-cost-to-hire-k-workers", "minimum-total-distance-traveled"]}, {"contest_title": "\u7b2c 319 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 319", "contest_title_slug": "weekly-contest-319", "contest_id": 773, "contest_start_time": 1668306600, "contest_duration": 5400, "user_num": 6175, "question_slugs": ["convert-the-temperature", "number-of-subarrays-with-lcm-equal-to-k", "minimum-number-of-operations-to-sort-a-binary-tree-by-level", "maximum-number-of-non-overlapping-palindrome-substrings"]}, {"contest_title": "\u7b2c 320 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 320", "contest_title_slug": "weekly-contest-320", "contest_id": 777, "contest_start_time": 1668911400, "contest_duration": 5400, "user_num": 5678, "question_slugs": ["number-of-unequal-triplets-in-array", "closest-nodes-queries-in-a-binary-search-tree", "minimum-fuel-cost-to-report-to-the-capital", "number-of-beautiful-partitions"]}, {"contest_title": "\u7b2c 321 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 321", "contest_title_slug": "weekly-contest-321", "contest_id": 779, "contest_start_time": 1669516200, "contest_duration": 5400, "user_num": 5115, "question_slugs": ["find-the-pivot-integer", "append-characters-to-string-to-make-subsequence", "remove-nodes-from-linked-list", "count-subarrays-with-median-k"]}, {"contest_title": "\u7b2c 322 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 322", "contest_title_slug": "weekly-contest-322", "contest_id": 783, "contest_start_time": 1670121000, "contest_duration": 5400, "user_num": 5085, "question_slugs": ["circular-sentence", "divide-players-into-teams-of-equal-skill", "minimum-score-of-a-path-between-two-cities", "divide-nodes-into-the-maximum-number-of-groups"]}, {"contest_title": "\u7b2c 323 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 323", "contest_title_slug": "weekly-contest-323", "contest_id": 785, "contest_start_time": 1670725800, "contest_duration": 5400, "user_num": 4671, "question_slugs": ["delete-greatest-value-in-each-row", "longest-square-streak-in-an-array", "design-memory-allocator", "maximum-number-of-points-from-grid-queries"]}, {"contest_title": "\u7b2c 324 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 324", "contest_title_slug": "weekly-contest-324", "contest_id": 790, "contest_start_time": 1671330600, "contest_duration": 5400, "user_num": 4167, "question_slugs": ["count-pairs-of-similar-strings", "smallest-value-after-replacing-with-sum-of-prime-factors", "add-edges-to-make-degrees-of-all-nodes-even", "cycle-length-queries-in-a-tree"]}, {"contest_title": "\u7b2c 325 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 325", "contest_title_slug": "weekly-contest-325", "contest_id": 795, "contest_start_time": 1671935400, "contest_duration": 5400, "user_num": 3530, "question_slugs": ["shortest-distance-to-target-string-in-a-circular-array", "take-k-of-each-character-from-left-and-right", "maximum-tastiness-of-candy-basket", "number-of-great-partitions"]}, {"contest_title": "\u7b2c 326 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 326", "contest_title_slug": "weekly-contest-326", "contest_id": 799, "contest_start_time": 1672540200, "contest_duration": 5400, "user_num": 3873, "question_slugs": ["count-the-digits-that-divide-a-number", "distinct-prime-factors-of-product-of-array", "partition-string-into-substrings-with-values-at-most-k", "closest-prime-numbers-in-range"]}, {"contest_title": "\u7b2c 327 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 327", "contest_title_slug": "weekly-contest-327", "contest_id": 801, "contest_start_time": 1673145000, "contest_duration": 5400, "user_num": 4518, "question_slugs": ["maximum-count-of-positive-integer-and-negative-integer", "maximal-score-after-applying-k-operations", "make-number-of-distinct-characters-equal", "time-to-cross-a-bridge"]}, {"contest_title": "\u7b2c 328 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 328", "contest_title_slug": "weekly-contest-328", "contest_id": 805, "contest_start_time": 1673749800, "contest_duration": 5400, "user_num": 4776, "question_slugs": ["difference-between-element-sum-and-digit-sum-of-an-array", "increment-submatrices-by-one", "count-the-number-of-good-subarrays", "difference-between-maximum-and-minimum-price-sum"]}, {"contest_title": "\u7b2c 329 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 329", "contest_title_slug": "weekly-contest-329", "contest_id": 807, "contest_start_time": 1674354600, "contest_duration": 5400, "user_num": 2591, "question_slugs": ["alternating-digit-sum", "sort-the-students-by-their-kth-score", "apply-bitwise-operations-to-make-strings-equal", "minimum-cost-to-split-an-array"]}, {"contest_title": "\u7b2c 330 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 330", "contest_title_slug": "weekly-contest-330", "contest_id": 811, "contest_start_time": 1674959400, "contest_duration": 5400, "user_num": 3399, "question_slugs": ["count-distinct-numbers-on-board", "count-collisions-of-monkeys-on-a-polygon", "put-marbles-in-bags", "count-increasing-quadruplets"]}, {"contest_title": "\u7b2c 331 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 331", "contest_title_slug": "weekly-contest-331", "contest_id": 813, "contest_start_time": 1675564200, "contest_duration": 5400, "user_num": 4256, "question_slugs": ["take-gifts-from-the-richest-pile", "count-vowel-strings-in-ranges", "house-robber-iv", "rearranging-fruits"]}, {"contest_title": "\u7b2c 332 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 332", "contest_title_slug": "weekly-contest-332", "contest_id": 817, "contest_start_time": 1676169000, "contest_duration": 5400, "user_num": 4547, "question_slugs": ["find-the-array-concatenation-value", "count-the-number-of-fair-pairs", "substring-xor-queries", "subsequence-with-the-minimum-score"]}, {"contest_title": "\u7b2c 333 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 333", "contest_title_slug": "weekly-contest-333", "contest_id": 819, "contest_start_time": 1676773800, "contest_duration": 5400, "user_num": 4969, "question_slugs": ["merge-two-2d-arrays-by-summing-values", "minimum-operations-to-reduce-an-integer-to-0", "count-the-number-of-square-free-subsets", "find-the-string-with-lcp"]}, {"contest_title": "\u7b2c 334 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 334", "contest_title_slug": "weekly-contest-334", "contest_id": 823, "contest_start_time": 1677378600, "contest_duration": 5400, "user_num": 5501, "question_slugs": ["left-and-right-sum-differences", "find-the-divisibility-array-of-a-string", "find-the-maximum-number-of-marked-indices", "minimum-time-to-visit-a-cell-in-a-grid"]}, {"contest_title": "\u7b2c 335 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 335", "contest_title_slug": "weekly-contest-335", "contest_id": 825, "contest_start_time": 1677983400, "contest_duration": 5400, "user_num": 6019, "question_slugs": ["pass-the-pillow", "kth-largest-sum-in-a-binary-tree", "split-the-array-to-make-coprime-products", "number-of-ways-to-earn-points"]}, {"contest_title": "\u7b2c 336 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 336", "contest_title_slug": "weekly-contest-336", "contest_id": 833, "contest_start_time": 1678588200, "contest_duration": 5400, "user_num": 5897, "question_slugs": ["count-the-number-of-vowel-strings-in-range", "rearrange-array-to-maximize-prefix-score", "count-the-number-of-beautiful-subarrays", "minimum-time-to-complete-all-tasks"]}, {"contest_title": "\u7b2c 337 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 337", "contest_title_slug": "weekly-contest-337", "contest_id": 839, "contest_start_time": 1679193000, "contest_duration": 5400, "user_num": 5628, "question_slugs": ["number-of-even-and-odd-bits", "check-knight-tour-configuration", "the-number-of-beautiful-subsets", "smallest-missing-non-negative-integer-after-operations"]}, {"contest_title": "\u7b2c 338 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 338", "contest_title_slug": "weekly-contest-338", "contest_id": 843, "contest_start_time": 1679797800, "contest_duration": 5400, "user_num": 5594, "question_slugs": ["k-items-with-the-maximum-sum", "prime-subtraction-operation", "minimum-operations-to-make-all-array-elements-equal", "collect-coins-in-a-tree"]}, {"contest_title": "\u7b2c 339 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 339", "contest_title_slug": "weekly-contest-339", "contest_id": 850, "contest_start_time": 1680402600, "contest_duration": 5400, "user_num": 5180, "question_slugs": ["find-the-longest-balanced-substring-of-a-binary-string", "convert-an-array-into-a-2d-array-with-conditions", "mice-and-cheese", "minimum-reverse-operations"]}, {"contest_title": "\u7b2c 340 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 340", "contest_title_slug": "weekly-contest-340", "contest_id": 854, "contest_start_time": 1681007400, "contest_duration": 5400, "user_num": 4937, "question_slugs": ["prime-in-diagonal", "sum-of-distances", "minimize-the-maximum-difference-of-pairs", "minimum-number-of-visited-cells-in-a-grid"]}, {"contest_title": "\u7b2c 341 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 341", "contest_title_slug": "weekly-contest-341", "contest_id": 856, "contest_start_time": 1681612200, "contest_duration": 5400, "user_num": 4792, "question_slugs": ["row-with-maximum-ones", "find-the-maximum-divisibility-score", "minimum-additions-to-make-valid-string", "minimize-the-total-price-of-the-trips"]}, {"contest_title": "\u7b2c 342 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 342", "contest_title_slug": "weekly-contest-342", "contest_id": 860, "contest_start_time": 1682217000, "contest_duration": 5400, "user_num": 3702, "question_slugs": ["calculate-delayed-arrival-time", "sum-multiples", "sliding-subarray-beauty", "minimum-number-of-operations-to-make-all-array-elements-equal-to-1"]}, {"contest_title": "\u7b2c 343 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 343", "contest_title_slug": "weekly-contest-343", "contest_id": 863, "contest_start_time": 1682821800, "contest_duration": 5400, "user_num": 3313, "question_slugs": ["determine-the-winner-of-a-bowling-game", "first-completely-painted-row-or-column", "minimum-cost-of-a-path-with-special-roads", "lexicographically-smallest-beautiful-string"]}, {"contest_title": "\u7b2c 344 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 344", "contest_title_slug": "weekly-contest-344", "contest_id": 867, "contest_start_time": 1683426600, "contest_duration": 5400, "user_num": 3986, "question_slugs": ["find-the-distinct-difference-array", "frequency-tracker", "number-of-adjacent-elements-with-the-same-color", "make-costs-of-paths-equal-in-a-binary-tree"]}, {"contest_title": "\u7b2c 345 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 345", "contest_title_slug": "weekly-contest-345", "contest_id": 870, "contest_start_time": 1684031400, "contest_duration": 5400, "user_num": 4165, "question_slugs": ["find-the-losers-of-the-circular-game", "neighboring-bitwise-xor", "maximum-number-of-moves-in-a-grid", "count-the-number-of-complete-components"]}, {"contest_title": "\u7b2c 346 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 346", "contest_title_slug": "weekly-contest-346", "contest_id": 874, "contest_start_time": 1684636200, "contest_duration": 5400, "user_num": 4035, "question_slugs": ["minimum-string-length-after-removing-substrings", "lexicographically-smallest-palindrome", "find-the-punishment-number-of-an-integer", "modify-graph-edge-weights"]}, {"contest_title": "\u7b2c 347 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 347", "contest_title_slug": "weekly-contest-347", "contest_id": 876, "contest_start_time": 1685241000, "contest_duration": 5400, "user_num": 3836, "question_slugs": ["remove-trailing-zeros-from-a-string", "difference-of-number-of-distinct-values-on-diagonals", "minimum-cost-to-make-all-characters-equal", "maximum-strictly-increasing-cells-in-a-matrix"]}, {"contest_title": "\u7b2c 348 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 348", "contest_title_slug": "weekly-contest-348", "contest_id": 880, "contest_start_time": 1685845800, "contest_duration": 5400, "user_num": 3909, "question_slugs": ["minimize-string-length", "semi-ordered-permutation", "sum-of-matrix-after-queries", "count-of-integers"]}, {"contest_title": "\u7b2c 349 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 349", "contest_title_slug": "weekly-contest-349", "contest_id": 882, "contest_start_time": 1686450600, "contest_duration": 5400, "user_num": 3714, "question_slugs": ["neither-minimum-nor-maximum", "lexicographically-smallest-string-after-substring-operation", "collecting-chocolates", "maximum-sum-queries"]}, {"contest_title": "\u7b2c 350 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 350", "contest_title_slug": "weekly-contest-350", "contest_id": 886, "contest_start_time": 1687055400, "contest_duration": 5400, "user_num": 3580, "question_slugs": ["total-distance-traveled", "find-the-value-of-the-partition", "special-permutations", "painting-the-walls"]}, {"contest_title": "\u7b2c 351 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 351", "contest_title_slug": "weekly-contest-351", "contest_id": 888, "contest_start_time": 1687660200, "contest_duration": 5400, "user_num": 2471, "question_slugs": ["number-of-beautiful-pairs", "minimum-operations-to-make-the-integer-zero", "ways-to-split-array-into-good-subarrays", "robot-collisions"]}, {"contest_title": "\u7b2c 352 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 352", "contest_title_slug": "weekly-contest-352", "contest_id": 892, "contest_start_time": 1688265000, "contest_duration": 5400, "user_num": 3437, "question_slugs": ["longest-even-odd-subarray-with-threshold", "prime-pairs-with-target-sum", "continuous-subarrays", "sum-of-imbalance-numbers-of-all-subarrays"]}, {"contest_title": "\u7b2c 353 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 353", "contest_title_slug": "weekly-contest-353", "contest_id": 894, "contest_start_time": 1688869800, "contest_duration": 5400, "user_num": 4113, "question_slugs": ["find-the-maximum-achievable-number", "maximum-number-of-jumps-to-reach-the-last-index", "longest-non-decreasing-subarray-from-two-arrays", "apply-operations-to-make-all-array-elements-equal-to-zero"]}, {"contest_title": "\u7b2c 354 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 354", "contest_title_slug": "weekly-contest-354", "contest_id": 898, "contest_start_time": 1689474600, "contest_duration": 5400, "user_num": 3957, "question_slugs": ["sum-of-squares-of-special-elements", "maximum-beauty-of-an-array-after-applying-operation", "minimum-index-of-a-valid-split", "length-of-the-longest-valid-substring"]}, {"contest_title": "\u7b2c 355 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 355", "contest_title_slug": "weekly-contest-355", "contest_id": 900, "contest_start_time": 1690079400, "contest_duration": 5400, "user_num": 4112, "question_slugs": ["split-strings-by-separator", "largest-element-in-an-array-after-merge-operations", "maximum-number-of-groups-with-increasing-length", "count-paths-that-can-form-a-palindrome-in-a-tree"]}, {"contest_title": "\u7b2c 356 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 356", "contest_title_slug": "weekly-contest-356", "contest_id": 904, "contest_start_time": 1690684200, "contest_duration": 5400, "user_num": 4082, "question_slugs": ["number-of-employees-who-met-the-target", "count-complete-subarrays-in-an-array", "shortest-string-that-contains-three-strings", "count-stepping-numbers-in-range"]}, {"contest_title": "\u7b2c 357 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 357", "contest_title_slug": "weekly-contest-357", "contest_id": 906, "contest_start_time": 1691289000, "contest_duration": 5400, "user_num": 4265, "question_slugs": ["faulty-keyboard", "check-if-it-is-possible-to-split-array", "find-the-safest-path-in-a-grid", "maximum-elegance-of-a-k-length-subsequence"]}, {"contest_title": "\u7b2c 358 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 358", "contest_title_slug": "weekly-contest-358", "contest_id": 910, "contest_start_time": 1691893800, "contest_duration": 5400, "user_num": 4475, "question_slugs": ["max-pair-sum-in-an-array", "double-a-number-represented-as-a-linked-list", "minimum-absolute-difference-between-elements-with-constraint", "apply-operations-to-maximize-score"]}, {"contest_title": "\u7b2c 359 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 359", "contest_title_slug": "weekly-contest-359", "contest_id": 913, "contest_start_time": 1692498600, "contest_duration": 5400, "user_num": 4101, "question_slugs": ["check-if-a-string-is-an-acronym-of-words", "determine-the-minimum-sum-of-a-k-avoiding-array", "maximize-the-profit-as-the-salesman", "find-the-longest-equal-subarray"]}, {"contest_title": "\u7b2c 360 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 360", "contest_title_slug": "weekly-contest-360", "contest_id": 918, "contest_start_time": 1693103400, "contest_duration": 5400, "user_num": 4496, "question_slugs": ["furthest-point-from-origin", "find-the-minimum-possible-sum-of-a-beautiful-array", "minimum-operations-to-form-subsequence-with-target-sum", "maximize-value-of-function-in-a-ball-passing-game"]}, {"contest_title": "\u7b2c 361 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 361", "contest_title_slug": "weekly-contest-361", "contest_id": 920, "contest_start_time": 1693708200, "contest_duration": 5400, "user_num": 4170, "question_slugs": ["count-symmetric-integers", "minimum-operations-to-make-a-special-number", "count-of-interesting-subarrays", "minimum-edge-weight-equilibrium-queries-in-a-tree"]}, {"contest_title": "\u7b2c 362 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 362", "contest_title_slug": "weekly-contest-362", "contest_id": 924, "contest_start_time": 1694313000, "contest_duration": 5400, "user_num": 4800, "question_slugs": ["points-that-intersect-with-cars", "determine-if-a-cell-is-reachable-at-a-given-time", "minimum-moves-to-spread-stones-over-grid", "string-transformation"]}, {"contest_title": "\u7b2c 363 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 363", "contest_title_slug": "weekly-contest-363", "contest_id": 926, "contest_start_time": 1694917800, "contest_duration": 5400, "user_num": 4768, "question_slugs": ["sum-of-values-at-indices-with-k-set-bits", "happy-students", "maximum-number-of-alloys", "maximum-element-sum-of-a-complete-subset-of-indices"]}, {"contest_title": "\u7b2c 364 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 364", "contest_title_slug": "weekly-contest-364", "contest_id": 930, "contest_start_time": 1695522600, "contest_duration": 5400, "user_num": 4304, "question_slugs": ["maximum-odd-binary-number", "beautiful-towers-i", "beautiful-towers-ii", "count-valid-paths-in-a-tree"]}, {"contest_title": "\u7b2c 365 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 365", "contest_title_slug": "weekly-contest-365", "contest_id": 932, "contest_start_time": 1696127400, "contest_duration": 5400, "user_num": 2909, "question_slugs": ["maximum-value-of-an-ordered-triplet-i", "maximum-value-of-an-ordered-triplet-ii", "minimum-size-subarray-in-infinite-array", "count-visited-nodes-in-a-directed-graph"]}, {"contest_title": "\u7b2c 366 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 366", "contest_title_slug": "weekly-contest-366", "contest_id": 936, "contest_start_time": 1696732200, "contest_duration": 5400, "user_num": 2790, "question_slugs": ["divisible-and-non-divisible-sums-difference", "minimum-processing-time", "apply-operations-to-make-two-strings-equal", "apply-operations-on-array-to-maximize-sum-of-squares"]}, {"contest_title": "\u7b2c 367 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 367", "contest_title_slug": "weekly-contest-367", "contest_id": 938, "contest_start_time": 1697337000, "contest_duration": 5400, "user_num": 4317, "question_slugs": ["find-indices-with-index-and-value-difference-i", "shortest-and-lexicographically-smallest-beautiful-string", "find-indices-with-index-and-value-difference-ii", "construct-product-matrix"]}, {"contest_title": "\u7b2c 368 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 368", "contest_title_slug": "weekly-contest-368", "contest_id": 942, "contest_start_time": 1697941800, "contest_duration": 5400, "user_num": 5002, "question_slugs": ["minimum-sum-of-mountain-triplets-i", "minimum-sum-of-mountain-triplets-ii", "minimum-number-of-groups-to-create-a-valid-assignment", "minimum-changes-to-make-k-semi-palindromes"]}, {"contest_title": "\u7b2c 369 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 369", "contest_title_slug": "weekly-contest-369", "contest_id": 945, "contest_start_time": 1698546600, "contest_duration": 5400, "user_num": 4121, "question_slugs": ["find-the-k-or-of-an-array", "minimum-equal-sum-of-two-arrays-after-replacing-zeros", "minimum-increment-operations-to-make-array-beautiful", "maximum-points-after-collecting-coins-from-all-nodes"]}, {"contest_title": "\u7b2c 370 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 370", "contest_title_slug": "weekly-contest-370", "contest_id": 950, "contest_start_time": 1699151400, "contest_duration": 5400, "user_num": 3983, "question_slugs": ["find-champion-i", "find-champion-ii", "maximum-score-after-applying-operations-on-a-tree", "maximum-balanced-subsequence-sum"]}, {"contest_title": "\u7b2c 371 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 371", "contest_title_slug": "weekly-contest-371", "contest_id": 952, "contest_start_time": 1699756200, "contest_duration": 5400, "user_num": 3638, "question_slugs": ["maximum-strong-pair-xor-i", "high-access-employees", "minimum-operations-to-maximize-last-elements-in-arrays", "maximum-strong-pair-xor-ii"]}, {"contest_title": "\u7b2c 372 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 372", "contest_title_slug": "weekly-contest-372", "contest_id": 956, "contest_start_time": 1700361000, "contest_duration": 5400, "user_num": 3920, "question_slugs": ["make-three-strings-equal", "separate-black-and-white-balls", "maximum-xor-product", "find-building-where-alice-and-bob-can-meet"]}, {"contest_title": "\u7b2c 373 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 373", "contest_title_slug": "weekly-contest-373", "contest_id": 958, "contest_start_time": 1700965800, "contest_duration": 5400, "user_num": 3577, "question_slugs": ["matrix-similarity-after-cyclic-shifts", "count-beautiful-substrings-i", "make-lexicographically-smallest-array-by-swapping-elements", "count-beautiful-substrings-ii"]}, {"contest_title": "\u7b2c 374 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 374", "contest_title_slug": "weekly-contest-374", "contest_id": 962, "contest_start_time": 1701570600, "contest_duration": 5400, "user_num": 4053, "question_slugs": ["find-the-peaks", "minimum-number-of-coins-to-be-added", "count-complete-substrings", "count-the-number-of-infection-sequences"]}, {"contest_title": "\u7b2c 375 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 375", "contest_title_slug": "weekly-contest-375", "contest_id": 964, "contest_start_time": 1702175400, "contest_duration": 5400, "user_num": 3518, "question_slugs": ["count-tested-devices-after-test-operations", "double-modular-exponentiation", "count-subarrays-where-max-element-appears-at-least-k-times", "count-the-number-of-good-partitions"]}, {"contest_title": "\u7b2c 376 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 376", "contest_title_slug": "weekly-contest-376", "contest_id": 968, "contest_start_time": 1702780200, "contest_duration": 5400, "user_num": 3409, "question_slugs": ["find-missing-and-repeated-values", "divide-array-into-arrays-with-max-difference", "minimum-cost-to-make-array-equalindromic", "apply-operations-to-maximize-frequency-score"]}, {"contest_title": "\u7b2c 377 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 377", "contest_title_slug": "weekly-contest-377", "contest_id": 970, "contest_start_time": 1703385000, "contest_duration": 5400, "user_num": 3148, "question_slugs": ["minimum-number-game", "maximum-square-area-by-removing-fences-from-a-field", "minimum-cost-to-convert-string-i", "minimum-cost-to-convert-string-ii"]}, {"contest_title": "\u7b2c 378 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 378", "contest_title_slug": "weekly-contest-378", "contest_id": 974, "contest_start_time": 1703989800, "contest_duration": 5400, "user_num": 2747, "question_slugs": ["check-if-bitwise-or-has-trailing-zeros", "find-longest-special-substring-that-occurs-thrice-i", "find-longest-special-substring-that-occurs-thrice-ii", "palindrome-rearrangement-queries"]}, {"contest_title": "\u7b2c 379 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 379", "contest_title_slug": "weekly-contest-379", "contest_id": 976, "contest_start_time": 1704594600, "contest_duration": 5400, "user_num": 3117, "question_slugs": ["maximum-area-of-longest-diagonal-rectangle", "minimum-moves-to-capture-the-queen", "maximum-size-of-a-set-after-removals", "maximize-the-number-of-partitions-after-operations"]}, {"contest_title": "\u7b2c 380 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 380", "contest_title_slug": "weekly-contest-380", "contest_id": 980, "contest_start_time": 1705199400, "contest_duration": 5400, "user_num": 3325, "question_slugs": ["count-elements-with-maximum-frequency", "find-beautiful-indices-in-the-given-array-i", "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k", "find-beautiful-indices-in-the-given-array-ii"]}, {"contest_title": "\u7b2c 381 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 381", "contest_title_slug": "weekly-contest-381", "contest_id": 982, "contest_start_time": 1705804200, "contest_duration": 5400, "user_num": 3737, "question_slugs": ["minimum-number-of-pushes-to-type-word-i", "count-the-number-of-houses-at-a-certain-distance-i", "minimum-number-of-pushes-to-type-word-ii", "count-the-number-of-houses-at-a-certain-distance-ii"]}, {"contest_title": "\u7b2c 382 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 382", "contest_title_slug": "weekly-contest-382", "contest_id": 986, "contest_start_time": 1706409000, "contest_duration": 5400, "user_num": 3134, "question_slugs": ["number-of-changing-keys", "find-the-maximum-number-of-elements-in-subset", "alice-and-bob-playing-flower-game", "minimize-or-of-remaining-elements-using-operations"]}, {"contest_title": "\u7b2c 383 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 383", "contest_title_slug": "weekly-contest-383", "contest_id": 988, "contest_start_time": 1707013800, "contest_duration": 5400, "user_num": 2691, "question_slugs": ["ant-on-the-boundary", "minimum-time-to-revert-word-to-initial-state-i", "find-the-grid-of-region-average", "minimum-time-to-revert-word-to-initial-state-ii"]}, {"contest_title": "\u7b2c 384 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 384", "contest_title_slug": "weekly-contest-384", "contest_id": 992, "contest_start_time": 1707618600, "contest_duration": 5400, "user_num": 1652, "question_slugs": ["modify-the-matrix", "number-of-subarrays-that-match-a-pattern-i", "maximum-palindromes-after-operations", "number-of-subarrays-that-match-a-pattern-ii"]}, {"contest_title": "\u7b2c 385 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 385", "contest_title_slug": "weekly-contest-385", "contest_id": 994, "contest_start_time": 1708223400, "contest_duration": 5400, "user_num": 2382, "question_slugs": ["count-prefix-and-suffix-pairs-i", "find-the-length-of-the-longest-common-prefix", "most-frequent-prime", "count-prefix-and-suffix-pairs-ii"]}, {"contest_title": "\u7b2c 386 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 386", "contest_title_slug": "weekly-contest-386", "contest_id": 998, "contest_start_time": 1708828200, "contest_duration": 5400, "user_num": 2731, "question_slugs": ["split-the-array", "find-the-largest-area-of-square-inside-two-rectangles", "earliest-second-to-mark-indices-i", "earliest-second-to-mark-indices-ii"]}, {"contest_title": "\u7b2c 387 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 387", "contest_title_slug": "weekly-contest-387", "contest_id": 1000, "contest_start_time": 1709433000, "contest_duration": 5400, "user_num": 3694, "question_slugs": ["distribute-elements-into-two-arrays-i", "count-submatrices-with-top-left-element-and-sum-less-than-k", "minimum-operations-to-write-the-letter-y-on-a-grid", "distribute-elements-into-two-arrays-ii"]}, {"contest_title": "\u7b2c 388 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 388", "contest_title_slug": "weekly-contest-388", "contest_id": 1004, "contest_start_time": 1710037800, "contest_duration": 5400, "user_num": 4291, "question_slugs": ["apple-redistribution-into-boxes", "maximize-happiness-of-selected-children", "shortest-uncommon-substring-in-an-array", "maximum-strength-of-k-disjoint-subarrays"]}, {"contest_title": "\u7b2c 389 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 389", "contest_title_slug": "weekly-contest-389", "contest_id": 1006, "contest_start_time": 1710642600, "contest_duration": 5400, "user_num": 4561, "question_slugs": ["existence-of-a-substring-in-a-string-and-its-reverse", "count-substrings-starting-and-ending-with-given-character", "minimum-deletions-to-make-string-k-special", "minimum-moves-to-pick-k-ones"]}, {"contest_title": "\u7b2c 390 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 390", "contest_title_slug": "weekly-contest-390", "contest_id": 1011, "contest_start_time": 1711247400, "contest_duration": 5400, "user_num": 4817, "question_slugs": ["maximum-length-substring-with-two-occurrences", "apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k", "most-frequent-ids", "longest-common-suffix-queries"]}, {"contest_title": "\u7b2c 391 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 391", "contest_title_slug": "weekly-contest-391", "contest_id": 1014, "contest_start_time": 1711852200, "contest_duration": 5400, "user_num": 4180, "question_slugs": ["harshad-number", "water-bottles-ii", "count-alternating-subarrays", "minimize-manhattan-distances"]}, {"contest_title": "\u7b2c 392 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 392", "contest_title_slug": "weekly-contest-392", "contest_id": 1018, "contest_start_time": 1712457000, "contest_duration": 5400, "user_num": 3193, "question_slugs": ["longest-strictly-increasing-or-strictly-decreasing-subarray", "lexicographically-smallest-string-after-operations-with-constraint", "minimum-operations-to-make-median-of-array-equal-to-k", "minimum-cost-walk-in-weighted-graph"]}, {"contest_title": "\u7b2c 393 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 393", "contest_title_slug": "weekly-contest-393", "contest_id": 1020, "contest_start_time": 1713061800, "contest_duration": 5400, "user_num": 4219, "question_slugs": ["latest-time-you-can-obtain-after-replacing-characters", "maximum-prime-difference", "kth-smallest-amount-with-single-denomination-combination", "minimum-sum-of-values-by-dividing-array"]}, {"contest_title": "\u7b2c 394 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 394", "contest_title_slug": "weekly-contest-394", "contest_id": 1024, "contest_start_time": 1713666600, "contest_duration": 5400, "user_num": 3958, "question_slugs": ["count-the-number-of-special-characters-i", "count-the-number-of-special-characters-ii", "minimum-number-of-operations-to-satisfy-conditions", "find-edges-in-shortest-paths"]}, {"contest_title": "\u7b2c 395 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 395", "contest_title_slug": "weekly-contest-395", "contest_id": 1026, "contest_start_time": 1714271400, "contest_duration": 5400, "user_num": 2969, "question_slugs": ["find-the-integer-added-to-array-i", "find-the-integer-added-to-array-ii", "minimum-array-end", "find-the-median-of-the-uniqueness-array"]}, {"contest_title": "\u7b2c 396 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 396", "contest_title_slug": "weekly-contest-396", "contest_id": 1030, "contest_start_time": 1714876200, "contest_duration": 5400, "user_num": 2932, "question_slugs": ["valid-word", "minimum-number-of-operations-to-make-word-k-periodic", "minimum-length-of-anagram-concatenation", "minimum-cost-to-equalize-array"]}, {"contest_title": "\u7b2c 397 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 397", "contest_title_slug": "weekly-contest-397", "contest_id": 1032, "contest_start_time": 1715481000, "contest_duration": 5400, "user_num": 3365, "question_slugs": ["permutation-difference-between-two-strings", "taking-maximum-energy-from-the-mystic-dungeon", "maximum-difference-score-in-a-grid", "find-the-minimum-cost-array-permutation"]}, {"contest_title": "\u7b2c 398 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 398", "contest_title_slug": "weekly-contest-398", "contest_id": 1036, "contest_start_time": 1716085800, "contest_duration": 5400, "user_num": 3606, "question_slugs": ["special-array-i", "special-array-ii", "sum-of-digit-differences-of-all-pairs", "find-number-of-ways-to-reach-the-k-th-stair"]}, {"contest_title": "\u7b2c 399 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 399", "contest_title_slug": "weekly-contest-399", "contest_id": 1038, "contest_start_time": 1716690600, "contest_duration": 5400, "user_num": 3424, "question_slugs": ["find-the-number-of-good-pairs-i", "string-compression-iii", "find-the-number-of-good-pairs-ii", "maximum-sum-of-subsequence-with-non-adjacent-elements"]}, {"contest_title": "\u7b2c 400 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 400", "contest_title_slug": "weekly-contest-400", "contest_id": 1043, "contest_start_time": 1717295400, "contest_duration": 5400, "user_num": 3534, "question_slugs": ["minimum-number-of-chairs-in-a-waiting-room", "count-days-without-meetings", "lexicographically-minimum-string-after-removing-stars", "find-subarray-with-bitwise-or-closest-to-k"]}, {"contest_title": "\u7b2c 401 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 401", "contest_title_slug": "weekly-contest-401", "contest_id": 1045, "contest_start_time": 1717900200, "contest_duration": 5400, "user_num": 3160, "question_slugs": ["find-the-child-who-has-the-ball-after-k-seconds", "find-the-n-th-value-after-k-seconds", "maximum-total-reward-using-operations-i", "maximum-total-reward-using-operations-ii"]}, {"contest_title": "\u7b2c 402 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 402", "contest_title_slug": "weekly-contest-402", "contest_id": 1049, "contest_start_time": 1718505000, "contest_duration": 5400, "user_num": 3283, "question_slugs": ["count-pairs-that-form-a-complete-day-i", "count-pairs-that-form-a-complete-day-ii", "maximum-total-damage-with-spell-casting", "peaks-in-array"]}, {"contest_title": "\u7b2c 403 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 403", "contest_title_slug": "weekly-contest-403", "contest_id": 1052, "contest_start_time": 1719109800, "contest_duration": 5400, "user_num": 3112, "question_slugs": ["minimum-average-of-smallest-and-largest-elements", "find-the-minimum-area-to-cover-all-ones-i", "maximize-total-cost-of-alternating-subarrays", "find-the-minimum-area-to-cover-all-ones-ii"]}, {"contest_title": "\u7b2c 404 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 404", "contest_title_slug": "weekly-contest-404", "contest_id": 1056, "contest_start_time": 1719714600, "contest_duration": 5400, "user_num": 3486, "question_slugs": ["maximum-height-of-a-triangle", "find-the-maximum-length-of-valid-subsequence-i", "find-the-maximum-length-of-valid-subsequence-ii", "find-minimum-diameter-after-merging-two-trees"]}, {"contest_title": "\u7b2c 405 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 405", "contest_title_slug": "weekly-contest-405", "contest_id": 1058, "contest_start_time": 1720319400, "contest_duration": 5400, "user_num": 3240, "question_slugs": ["find-the-encrypted-string", "generate-binary-strings-without-adjacent-zeros", "count-submatrices-with-equal-frequency-of-x-and-y", "construct-string-with-minimum-cost"]}, {"contest_title": "\u7b2c 27 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 27", "contest_title_slug": "biweekly-contest-27", "contest_id": 204, "contest_start_time": 1590849000, "contest_duration": 5400, "user_num": 1966, "question_slugs": ["make-two-arrays-equal-by-reversing-subarrays", "check-if-a-string-contains-all-binary-codes-of-size-k", "course-schedule-iv", "cherry-pickup-ii"]}, {"contest_title": "\u7b2c 29 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 29", "contest_title_slug": "biweekly-contest-29", "contest_id": 216, "contest_start_time": 1593268200, "contest_duration": 5400, "user_num": 2260, "question_slugs": ["average-salary-excluding-the-minimum-and-maximum-salary", "the-kth-factor-of-n", "longest-subarray-of-1s-after-deleting-one-element", "parallel-courses-ii"]}, {"contest_title": "\u7b2c 58 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 58", "contest_title_slug": "biweekly-contest-58", "contest_id": 441, "contest_start_time": 1628346600, "contest_duration": 5400, "user_num": 2889, "question_slugs": ["delete-characters-to-make-fancy-string", "check-if-move-is-legal", "minimum-total-space-wasted-with-k-resizing-operations", "maximum-product-of-the-length-of-two-palindromic-substrings"]}, {"contest_title": "\u7b2c 59 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 59", "contest_title_slug": "biweekly-contest-59", "contest_id": 448, "contest_start_time": 1629556200, "contest_duration": 5400, "user_num": 3030, "question_slugs": ["minimum-time-to-type-word-using-special-typewriter", "maximum-matrix-sum", "number-of-ways-to-arrive-at-destination", "number-of-ways-to-separate-numbers"]}, {"contest_title": "\u7b2c 60 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 60", "contest_title_slug": "biweekly-contest-60", "contest_id": 461, "contest_start_time": 1630765800, "contest_duration": 5400, "user_num": 2848, "question_slugs": ["find-the-middle-index-in-array", "find-all-groups-of-farmland", "operations-on-tree", "the-number-of-good-subsets"]}, {"contest_title": "\u7b2c 61 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 61", "contest_title_slug": "biweekly-contest-61", "contest_id": 467, "contest_start_time": 1631975400, "contest_duration": 5400, "user_num": 2534, "question_slugs": ["count-number-of-pairs-with-absolute-difference-k", "find-original-array-from-doubled-array", "maximum-earnings-from-taxi", "minimum-number-of-operations-to-make-array-continuous"]}, {"contest_title": "\u7b2c 62 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 62", "contest_title_slug": "biweekly-contest-62", "contest_id": 477, "contest_start_time": 1633185000, "contest_duration": 5400, "user_num": 2619, "question_slugs": ["convert-1d-array-into-2d-array", "number-of-pairs-of-strings-with-concatenation-equal-to-target", "maximize-the-confusion-of-an-exam", "maximum-number-of-ways-to-partition-an-array"]}, {"contest_title": "\u7b2c 63 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 63", "contest_title_slug": "biweekly-contest-63", "contest_id": 484, "contest_start_time": 1634394600, "contest_duration": 5400, "user_num": 2828, "question_slugs": ["minimum-number-of-moves-to-seat-everyone", "remove-colored-pieces-if-both-neighbors-are-the-same-color", "the-time-when-the-network-becomes-idle", "kth-smallest-product-of-two-sorted-arrays"]}, {"contest_title": "\u7b2c 64 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 64", "contest_title_slug": "biweekly-contest-64", "contest_id": 490, "contest_start_time": 1635604200, "contest_duration": 5400, "user_num": 2838, "question_slugs": ["kth-distinct-string-in-an-array", "two-best-non-overlapping-events", "plates-between-candles", "number-of-valid-move-combinations-on-chessboard"]}, {"contest_title": "\u7b2c 65 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 65", "contest_title_slug": "biweekly-contest-65", "contest_id": 497, "contest_start_time": 1636813800, "contest_duration": 5400, "user_num": 2676, "question_slugs": ["check-whether-two-strings-are-almost-equivalent", "walking-robot-simulation-ii", "most-beautiful-item-for-each-query", "maximum-number-of-tasks-you-can-assign"]}, {"contest_title": "\u7b2c 66 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 66", "contest_title_slug": "biweekly-contest-66", "contest_id": 503, "contest_start_time": 1638023400, "contest_duration": 5400, "user_num": 2803, "question_slugs": ["count-common-words-with-one-occurrence", "minimum-number-of-food-buckets-to-feed-the-hamsters", "minimum-cost-homecoming-of-a-robot-in-a-grid", "count-fertile-pyramids-in-a-land"]}, {"contest_title": "\u7b2c 67 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 67", "contest_title_slug": "biweekly-contest-67", "contest_id": 509, "contest_start_time": 1639233000, "contest_duration": 5400, "user_num": 2923, "question_slugs": ["find-subsequence-of-length-k-with-the-largest-sum", "find-good-days-to-rob-the-bank", "detonate-the-maximum-bombs", "sequentially-ordinal-rank-tracker"]}, {"contest_title": "\u7b2c 68 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 68", "contest_title_slug": "biweekly-contest-68", "contest_id": 515, "contest_start_time": 1640442600, "contest_duration": 5400, "user_num": 2854, "question_slugs": ["maximum-number-of-words-found-in-sentences", "find-all-possible-recipes-from-given-supplies", "check-if-a-parentheses-string-can-be-valid", "abbreviating-the-product-of-a-range"]}, {"contest_title": "\u7b2c 69 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 69", "contest_title_slug": "biweekly-contest-69", "contest_id": 521, "contest_start_time": 1641652200, "contest_duration": 5400, "user_num": 3360, "question_slugs": ["capitalize-the-title", "maximum-twin-sum-of-a-linked-list", "longest-palindrome-by-concatenating-two-letter-words", "stamping-the-grid"]}, {"contest_title": "\u7b2c 70 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 70", "contest_title_slug": "biweekly-contest-70", "contest_id": 527, "contest_start_time": 1642861800, "contest_duration": 5400, "user_num": 3640, "question_slugs": ["minimum-cost-of-buying-candies-with-discount", "count-the-hidden-sequences", "k-highest-ranked-items-within-a-price-range", "number-of-ways-to-divide-a-long-corridor"]}, {"contest_title": "\u7b2c 71 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 71", "contest_title_slug": "biweekly-contest-71", "contest_id": 533, "contest_start_time": 1644071400, "contest_duration": 5400, "user_num": 3028, "question_slugs": ["minimum-sum-of-four-digit-number-after-splitting-digits", "partition-array-according-to-given-pivot", "minimum-cost-to-set-cooking-time", "minimum-difference-in-sums-after-removal-of-elements"]}, {"contest_title": "\u7b2c 72 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 72", "contest_title_slug": "biweekly-contest-72", "contest_id": 539, "contest_start_time": 1645281000, "contest_duration": 5400, "user_num": 4400, "question_slugs": ["count-equal-and-divisible-pairs-in-an-array", "find-three-consecutive-integers-that-sum-to-a-given-number", "maximum-split-of-positive-even-integers", "count-good-triplets-in-an-array"]}, {"contest_title": "\u7b2c 73 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 73", "contest_title_slug": "biweekly-contest-73", "contest_id": 545, "contest_start_time": 1646490600, "contest_duration": 5400, "user_num": 5132, "question_slugs": ["most-frequent-number-following-key-in-an-array", "sort-the-jumbled-numbers", "all-ancestors-of-a-node-in-a-directed-acyclic-graph", "minimum-number-of-moves-to-make-palindrome"]}, {"contest_title": "\u7b2c 74 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 74", "contest_title_slug": "biweekly-contest-74", "contest_id": 554, "contest_start_time": 1647700200, "contest_duration": 5400, "user_num": 5442, "question_slugs": ["divide-array-into-equal-pairs", "maximize-number-of-subsequences-in-a-string", "minimum-operations-to-halve-array-sum", "minimum-white-tiles-after-covering-with-carpets"]}, {"contest_title": "\u7b2c 75 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 75", "contest_title_slug": "biweekly-contest-75", "contest_id": 563, "contest_start_time": 1648909800, "contest_duration": 5400, "user_num": 4335, "question_slugs": ["minimum-bit-flips-to-convert-number", "find-triangular-sum-of-an-array", "number-of-ways-to-select-buildings", "sum-of-scores-of-built-strings"]}, {"contest_title": "\u7b2c 76 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 76", "contest_title_slug": "biweekly-contest-76", "contest_id": 572, "contest_start_time": 1650119400, "contest_duration": 5400, "user_num": 4477, "question_slugs": ["find-closest-number-to-zero", "number-of-ways-to-buy-pens-and-pencils", "design-an-atm-machine", "maximum-score-of-a-node-sequence"]}, {"contest_title": "\u7b2c 77 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 77", "contest_title_slug": "biweekly-contest-77", "contest_id": 581, "contest_start_time": 1651329000, "contest_duration": 5400, "user_num": 4211, "question_slugs": ["count-prefixes-of-a-given-string", "minimum-average-difference", "count-unguarded-cells-in-the-grid", "escape-the-spreading-fire"]}, {"contest_title": "\u7b2c 78 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 78", "contest_title_slug": "biweekly-contest-78", "contest_id": 590, "contest_start_time": 1652538600, "contest_duration": 5400, "user_num": 4347, "question_slugs": ["find-the-k-beauty-of-a-number", "number-of-ways-to-split-array", "maximum-white-tiles-covered-by-a-carpet", "substring-with-largest-variance"]}, {"contest_title": "\u7b2c 79 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 79", "contest_title_slug": "biweekly-contest-79", "contest_id": 598, "contest_start_time": 1653748200, "contest_duration": 5400, "user_num": 4250, "question_slugs": ["check-if-number-has-equal-digit-count-and-digit-value", "sender-with-largest-word-count", "maximum-total-importance-of-roads", "booking-concert-tickets-in-groups"]}, {"contest_title": "\u7b2c 80 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 80", "contest_title_slug": "biweekly-contest-80", "contest_id": 608, "contest_start_time": 1654957800, "contest_duration": 5400, "user_num": 3949, "question_slugs": ["strong-password-checker-ii", "successful-pairs-of-spells-and-potions", "match-substring-after-replacement", "count-subarrays-with-score-less-than-k"]}, {"contest_title": "\u7b2c 81 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 81", "contest_title_slug": "biweekly-contest-81", "contest_id": 614, "contest_start_time": 1656167400, "contest_duration": 5400, "user_num": 3847, "question_slugs": ["count-asterisks", "count-unreachable-pairs-of-nodes-in-an-undirected-graph", "maximum-xor-after-operations", "number-of-distinct-roll-sequences"]}, {"contest_title": "\u7b2c 82 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 82", "contest_title_slug": "biweekly-contest-82", "contest_id": 646, "contest_start_time": 1657377000, "contest_duration": 5400, "user_num": 4144, "question_slugs": ["evaluate-boolean-binary-tree", "the-latest-time-to-catch-a-bus", "minimum-sum-of-squared-difference", "subarray-with-elements-greater-than-varying-threshold"]}, {"contest_title": "\u7b2c 83 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 83", "contest_title_slug": "biweekly-contest-83", "contest_id": 652, "contest_start_time": 1658586600, "contest_duration": 5400, "user_num": 4437, "question_slugs": ["best-poker-hand", "number-of-zero-filled-subarrays", "design-a-number-container-system", "shortest-impossible-sequence-of-rolls"]}, {"contest_title": "\u7b2c 84 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 84", "contest_title_slug": "biweekly-contest-84", "contest_id": 658, "contest_start_time": 1659796200, "contest_duration": 5400, "user_num": 4574, "question_slugs": ["merge-similar-items", "count-number-of-bad-pairs", "task-scheduler-ii", "minimum-replacements-to-sort-the-array"]}, {"contest_title": "\u7b2c 85 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 85", "contest_title_slug": "biweekly-contest-85", "contest_id": 668, "contest_start_time": 1661005800, "contest_duration": 5400, "user_num": 4193, "question_slugs": ["minimum-recolors-to-get-k-consecutive-black-blocks", "time-needed-to-rearrange-a-binary-string", "shifting-letters-ii", "maximum-segment-sum-after-removals"]}, {"contest_title": "\u7b2c 86 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 86", "contest_title_slug": "biweekly-contest-86", "contest_id": 688, "contest_start_time": 1662215400, "contest_duration": 5400, "user_num": 4401, "question_slugs": ["find-subarrays-with-equal-sum", "strictly-palindromic-number", "maximum-rows-covered-by-columns", "maximum-number-of-robots-within-budget"]}, {"contest_title": "\u7b2c 87 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 87", "contest_title_slug": "biweekly-contest-87", "contest_id": 703, "contest_start_time": 1663425000, "contest_duration": 5400, "user_num": 4005, "question_slugs": ["count-days-spent-together", "maximum-matching-of-players-with-trainers", "smallest-subarrays-with-maximum-bitwise-or", "minimum-money-required-before-transactions"]}, {"contest_title": "\u7b2c 88 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 88", "contest_title_slug": "biweekly-contest-88", "contest_id": 745, "contest_start_time": 1664634600, "contest_duration": 5400, "user_num": 3905, "question_slugs": ["remove-letter-to-equalize-frequency", "longest-uploaded-prefix", "bitwise-xor-of-all-pairings", "number-of-pairs-satisfying-inequality"]}, {"contest_title": "\u7b2c 89 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 89", "contest_title_slug": "biweekly-contest-89", "contest_id": 755, "contest_start_time": 1665844200, "contest_duration": 5400, "user_num": 3984, "question_slugs": ["number-of-valid-clock-times", "range-product-queries-of-powers", "minimize-maximum-of-array", "create-components-with-same-value"]}, {"contest_title": "\u7b2c 90 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 90", "contest_title_slug": "biweekly-contest-90", "contest_id": 763, "contest_start_time": 1667053800, "contest_duration": 5400, "user_num": 3624, "question_slugs": ["odd-string-difference", "words-within-two-edits-of-dictionary", "destroy-sequential-targets", "next-greater-element-iv"]}, {"contest_title": "\u7b2c 91 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 91", "contest_title_slug": "biweekly-contest-91", "contest_id": 770, "contest_start_time": 1668263400, "contest_duration": 5400, "user_num": 3535, "question_slugs": ["number-of-distinct-averages", "count-ways-to-build-good-strings", "most-profitable-path-in-a-tree", "split-message-based-on-limit"]}, {"contest_title": "\u7b2c 92 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 92", "contest_title_slug": "biweekly-contest-92", "contest_id": 776, "contest_start_time": 1669473000, "contest_duration": 5400, "user_num": 3055, "question_slugs": ["minimum-cuts-to-divide-a-circle", "difference-between-ones-and-zeros-in-row-and-column", "minimum-penalty-for-a-shop", "count-palindromic-subsequences"]}, {"contest_title": "\u7b2c 93 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 93", "contest_title_slug": "biweekly-contest-93", "contest_id": 782, "contest_start_time": 1670682600, "contest_duration": 5400, "user_num": 2929, "question_slugs": ["maximum-value-of-a-string-in-an-array", "maximum-star-sum-of-a-graph", "frog-jump-ii", "minimum-total-cost-to-make-arrays-unequal"]}, {"contest_title": "\u7b2c 94 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 94", "contest_title_slug": "biweekly-contest-94", "contest_id": 789, "contest_start_time": 1671892200, "contest_duration": 5400, "user_num": 2298, "question_slugs": ["maximum-enemy-forts-that-can-be-captured", "reward-top-k-students", "minimize-the-maximum-of-two-arrays", "count-anagrams"]}, {"contest_title": "\u7b2c 95 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 95", "contest_title_slug": "biweekly-contest-95", "contest_id": 798, "contest_start_time": 1673101800, "contest_duration": 5400, "user_num": 2880, "question_slugs": ["categorize-box-according-to-criteria", "find-consecutive-integers-from-a-data-stream", "find-xor-beauty-of-array", "maximize-the-minimum-powered-city"]}, {"contest_title": "\u7b2c 96 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 96", "contest_title_slug": "biweekly-contest-96", "contest_id": 804, "contest_start_time": 1674311400, "contest_duration": 5400, "user_num": 2103, "question_slugs": ["minimum-common-value", "minimum-operations-to-make-array-equal-ii", "maximum-subsequence-score", "check-if-point-is-reachable"]}, {"contest_title": "\u7b2c 97 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 97", "contest_title_slug": "biweekly-contest-97", "contest_id": 810, "contest_start_time": 1675521000, "contest_duration": 5400, "user_num": 2631, "question_slugs": ["separate-the-digits-in-an-array", "maximum-number-of-integers-to-choose-from-a-range-i", "maximize-win-from-two-segments", "disconnect-path-in-a-binary-matrix-by-at-most-one-flip"]}, {"contest_title": "\u7b2c 98 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 98", "contest_title_slug": "biweekly-contest-98", "contest_id": 816, "contest_start_time": 1676730600, "contest_duration": 5400, "user_num": 3250, "question_slugs": ["maximum-difference-by-remapping-a-digit", "minimum-score-by-changing-two-elements", "minimum-impossible-or", "handling-sum-queries-after-update"]}, {"contest_title": "\u7b2c 99 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 99", "contest_title_slug": "biweekly-contest-99", "contest_id": 822, "contest_start_time": 1677940200, "contest_duration": 5400, "user_num": 3467, "question_slugs": ["split-with-minimum-sum", "count-total-number-of-colored-cells", "count-ways-to-group-overlapping-ranges", "count-number-of-possible-root-nodes"]}, {"contest_title": "\u7b2c 100 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 100", "contest_title_slug": "biweekly-contest-100", "contest_id": 832, "contest_start_time": 1679149800, "contest_duration": 5400, "user_num": 3639, "question_slugs": ["distribute-money-to-maximum-children", "maximize-greatness-of-an-array", "find-score-of-an-array-after-marking-all-elements", "minimum-time-to-repair-cars"]}, {"contest_title": "\u7b2c 101 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 101", "contest_title_slug": "biweekly-contest-101", "contest_id": 842, "contest_start_time": 1680359400, "contest_duration": 5400, "user_num": 3353, "question_slugs": ["form-smallest-number-from-two-digit-arrays", "find-the-substring-with-maximum-cost", "make-k-subarray-sums-equal", "shortest-cycle-in-a-graph"]}, {"contest_title": "\u7b2c 102 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 102", "contest_title_slug": "biweekly-contest-102", "contest_id": 853, "contest_start_time": 1681569000, "contest_duration": 5400, "user_num": 3058, "question_slugs": ["find-the-width-of-columns-of-a-grid", "find-the-score-of-all-prefixes-of-an-array", "cousins-in-binary-tree-ii", "design-graph-with-shortest-path-calculator"]}, {"contest_title": "\u7b2c 103 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 103", "contest_title_slug": "biweekly-contest-103", "contest_id": 859, "contest_start_time": 1682778600, "contest_duration": 5400, "user_num": 2299, "question_slugs": ["maximum-sum-with-exactly-k-elements", "find-the-prefix-common-array-of-two-arrays", "maximum-number-of-fish-in-a-grid", "make-array-empty"]}, {"contest_title": "\u7b2c 104 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 104", "contest_title_slug": "biweekly-contest-104", "contest_id": 866, "contest_start_time": 1683988200, "contest_duration": 5400, "user_num": 2519, "question_slugs": ["number-of-senior-citizens", "sum-in-a-matrix", "maximum-or", "power-of-heroes"]}, {"contest_title": "\u7b2c 105 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 105", "contest_title_slug": "biweekly-contest-105", "contest_id": 873, "contest_start_time": 1685197800, "contest_duration": 5400, "user_num": 2604, "question_slugs": ["buy-two-chocolates", "extra-characters-in-a-string", "maximum-strength-of-a-group", "greatest-common-divisor-traversal"]}, {"contest_title": "\u7b2c 106 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 106", "contest_title_slug": "biweekly-contest-106", "contest_id": 879, "contest_start_time": 1686407400, "contest_duration": 5400, "user_num": 2346, "question_slugs": ["check-if-the-number-is-fascinating", "find-the-longest-semi-repetitive-substring", "movement-of-robots", "find-a-good-subset-of-the-matrix"]}, {"contest_title": "\u7b2c 107 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 107", "contest_title_slug": "biweekly-contest-107", "contest_id": 885, "contest_start_time": 1687617000, "contest_duration": 5400, "user_num": 1870, "question_slugs": ["find-maximum-number-of-string-pairs", "construct-the-longest-new-string", "decremental-string-concatenation", "count-zero-request-servers"]}, {"contest_title": "\u7b2c 108 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 108", "contest_title_slug": "biweekly-contest-108", "contest_id": 891, "contest_start_time": 1688826600, "contest_duration": 5400, "user_num": 2349, "question_slugs": ["longest-alternating-subarray", "relocate-marbles", "partition-string-into-minimum-beautiful-substrings", "number-of-black-blocks"]}, {"contest_title": "\u7b2c 109 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 109", "contest_title_slug": "biweekly-contest-109", "contest_id": 897, "contest_start_time": 1690036200, "contest_duration": 5400, "user_num": 2461, "question_slugs": ["check-if-array-is-good", "sort-vowels-in-a-string", "visit-array-positions-to-maximize-score", "ways-to-express-an-integer-as-sum-of-powers"]}, {"contest_title": "\u7b2c 110 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 110", "contest_title_slug": "biweekly-contest-110", "contest_id": 903, "contest_start_time": 1691245800, "contest_duration": 5400, "user_num": 2546, "question_slugs": ["account-balance-after-rounded-purchase", "insert-greatest-common-divisors-in-linked-list", "minimum-seconds-to-equalize-a-circular-array", "minimum-time-to-make-array-sum-at-most-x"]}, {"contest_title": "\u7b2c 111 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 111", "contest_title_slug": "biweekly-contest-111", "contest_id": 909, "contest_start_time": 1692455400, "contest_duration": 5400, "user_num": 2787, "question_slugs": ["count-pairs-whose-sum-is-less-than-target", "make-string-a-subsequence-using-cyclic-increments", "sorting-three-groups", "number-of-beautiful-integers-in-the-range"]}, {"contest_title": "\u7b2c 112 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 112", "contest_title_slug": "biweekly-contest-112", "contest_id": 917, "contest_start_time": 1693665000, "contest_duration": 5400, "user_num": 2900, "question_slugs": ["check-if-strings-can-be-made-equal-with-operations-i", "check-if-strings-can-be-made-equal-with-operations-ii", "maximum-sum-of-almost-unique-subarray", "count-k-subsequences-of-a-string-with-maximum-beauty"]}, {"contest_title": "\u7b2c 113 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 113", "contest_title_slug": "biweekly-contest-113", "contest_id": 923, "contest_start_time": 1694874600, "contest_duration": 5400, "user_num": 3028, "question_slugs": ["minimum-right-shifts-to-sort-the-array", "minimum-array-length-after-pair-removals", "count-pairs-of-points-with-distance-k", "minimum-edge-reversals-so-every-node-is-reachable"]}, {"contest_title": "\u7b2c 114 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 114", "contest_title_slug": "biweekly-contest-114", "contest_id": 929, "contest_start_time": 1696084200, "contest_duration": 5400, "user_num": 2406, "question_slugs": ["minimum-operations-to-collect-elements", "minimum-number-of-operations-to-make-array-empty", "split-array-into-maximum-number-of-subarrays", "maximum-number-of-k-divisible-components"]}, {"contest_title": "\u7b2c 115 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 115", "contest_title_slug": "biweekly-contest-115", "contest_id": 935, "contest_start_time": 1697293800, "contest_duration": 5400, "user_num": 2809, "question_slugs": ["last-visited-integers", "longest-unequal-adjacent-groups-subsequence-i", "longest-unequal-adjacent-groups-subsequence-ii", "count-of-sub-multisets-with-bounded-sum"]}, {"contest_title": "\u7b2c 116 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 116", "contest_title_slug": "biweekly-contest-116", "contest_id": 941, "contest_start_time": 1698503400, "contest_duration": 5400, "user_num": 2904, "question_slugs": ["subarrays-distinct-element-sum-of-squares-i", "minimum-number-of-changes-to-make-binary-string-beautiful", "length-of-the-longest-subsequence-that-sums-to-target", "subarrays-distinct-element-sum-of-squares-ii"]}, {"contest_title": "\u7b2c 117 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 117", "contest_title_slug": "biweekly-contest-117", "contest_id": 949, "contest_start_time": 1699713000, "contest_duration": 5400, "user_num": 2629, "question_slugs": ["distribute-candies-among-children-i", "distribute-candies-among-children-ii", "number-of-strings-which-can-be-rearranged-to-contain-substring", "maximum-spending-after-buying-items"]}, {"contest_title": "\u7b2c 118 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 118", "contest_title_slug": "biweekly-contest-118", "contest_id": 955, "contest_start_time": 1700922600, "contest_duration": 5400, "user_num": 2425, "question_slugs": ["find-words-containing-character", "maximize-area-of-square-hole-in-grid", "minimum-number-of-coins-for-fruits", "find-maximum-non-decreasing-array-length"]}, {"contest_title": "\u7b2c 119 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 119", "contest_title_slug": "biweekly-contest-119", "contest_id": 961, "contest_start_time": 1702132200, "contest_duration": 5400, "user_num": 2472, "question_slugs": ["find-common-elements-between-two-arrays", "remove-adjacent-almost-equal-characters", "length-of-longest-subarray-with-at-most-k-frequency", "number-of-possible-sets-of-closing-branches"]}, {"contest_title": "\u7b2c 120 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 120", "contest_title_slug": "biweekly-contest-120", "contest_id": 967, "contest_start_time": 1703341800, "contest_duration": 5400, "user_num": 2542, "question_slugs": ["count-the-number-of-incremovable-subarrays-i", "find-polygon-with-the-largest-perimeter", "count-the-number-of-incremovable-subarrays-ii", "find-number-of-coins-to-place-in-tree-nodes"]}, {"contest_title": "\u7b2c 121 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 121", "contest_title_slug": "biweekly-contest-121", "contest_id": 973, "contest_start_time": 1704551400, "contest_duration": 5400, "user_num": 2218, "question_slugs": ["smallest-missing-integer-greater-than-sequential-prefix-sum", "minimum-number-of-operations-to-make-array-xor-equal-to-k", "minimum-number-of-operations-to-make-x-and-y-equal", "count-the-number-of-powerful-integers"]}, {"contest_title": "\u7b2c 122 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 122", "contest_title_slug": "biweekly-contest-122", "contest_id": 979, "contest_start_time": 1705761000, "contest_duration": 5400, "user_num": 2547, "question_slugs": ["divide-an-array-into-subarrays-with-minimum-cost-i", "find-if-array-can-be-sorted", "minimize-length-of-array-using-operations", "divide-an-array-into-subarrays-with-minimum-cost-ii"]}, {"contest_title": "\u7b2c 123 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 123", "contest_title_slug": "biweekly-contest-123", "contest_id": 985, "contest_start_time": 1706970600, "contest_duration": 5400, "user_num": 2209, "question_slugs": ["type-of-triangle", "find-the-number-of-ways-to-place-people-i", "maximum-good-subarray-sum", "find-the-number-of-ways-to-place-people-ii"]}, {"contest_title": "\u7b2c 124 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 124", "contest_title_slug": "biweekly-contest-124", "contest_id": 991, "contest_start_time": 1708180200, "contest_duration": 5400, "user_num": 1861, "question_slugs": ["maximum-number-of-operations-with-the-same-score-i", "apply-operations-to-make-string-empty", "maximum-number-of-operations-with-the-same-score-ii", "maximize-consecutive-elements-in-an-array-after-modification"]}, {"contest_title": "\u7b2c 125 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 125", "contest_title_slug": "biweekly-contest-125", "contest_id": 997, "contest_start_time": 1709389800, "contest_duration": 5400, "user_num": 2599, "question_slugs": ["minimum-operations-to-exceed-threshold-value-i", "minimum-operations-to-exceed-threshold-value-ii", "count-pairs-of-connectable-servers-in-a-weighted-tree-network", "find-the-maximum-sum-of-node-values"]}, {"contest_title": "\u7b2c 126 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 126", "contest_title_slug": "biweekly-contest-126", "contest_id": 1003, "contest_start_time": 1710599400, "contest_duration": 5400, "user_num": 3234, "question_slugs": ["find-the-sum-of-encrypted-integers", "mark-elements-on-array-by-performing-queries", "replace-question-marks-in-string-to-minimize-its-value", "find-the-sum-of-the-power-of-all-subsequences"]}, {"contest_title": "\u7b2c 127 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 127", "contest_title_slug": "biweekly-contest-127", "contest_id": 1010, "contest_start_time": 1711809000, "contest_duration": 5400, "user_num": 2950, "question_slugs": ["shortest-subarray-with-or-at-least-k-i", "minimum-levels-to-gain-more-points", "shortest-subarray-with-or-at-least-k-ii", "find-the-sum-of-subsequence-powers"]}, {"contest_title": "\u7b2c 128 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 128", "contest_title_slug": "biweekly-contest-128", "contest_id": 1017, "contest_start_time": 1713018600, "contest_duration": 5400, "user_num": 2653, "question_slugs": ["score-of-a-string", "minimum-rectangles-to-cover-points", "minimum-time-to-visit-disappearing-nodes", "find-the-number-of-subarrays-where-boundary-elements-are-maximum"]}, {"contest_title": "\u7b2c 129 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 129", "contest_title_slug": "biweekly-contest-129", "contest_id": 1023, "contest_start_time": 1714228200, "contest_duration": 5400, "user_num": 2511, "question_slugs": ["make-a-square-with-the-same-color", "right-triangles", "find-all-possible-stable-binary-arrays-i", "find-all-possible-stable-binary-arrays-ii"]}, {"contest_title": "\u7b2c 130 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 130", "contest_title_slug": "biweekly-contest-130", "contest_id": 1029, "contest_start_time": 1715437800, "contest_duration": 5400, "user_num": 2604, "question_slugs": ["check-if-grid-satisfies-conditions", "maximum-points-inside-the-square", "minimum-substring-partition-of-equal-character-frequency", "find-products-of-elements-of-big-array"]}, {"contest_title": "\u7b2c 131 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 131", "contest_title_slug": "biweekly-contest-131", "contest_id": 1035, "contest_start_time": 1716647400, "contest_duration": 5400, "user_num": 2537, "question_slugs": ["find-the-xor-of-numbers-which-appear-twice", "find-occurrences-of-an-element-in-an-array", "find-the-number-of-distinct-colors-among-the-balls", "block-placement-queries"]}, {"contest_title": "\u7b2c 132 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 132", "contest_title_slug": "biweekly-contest-132", "contest_id": 1042, "contest_start_time": 1717857000, "contest_duration": 5400, "user_num": 2457, "question_slugs": ["clear-digits", "find-the-first-player-to-win-k-games-in-a-row", "find-the-maximum-length-of-a-good-subsequence-i", "find-the-maximum-length-of-a-good-subsequence-ii"]}, {"contest_title": "\u7b2c 133 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 133", "contest_title_slug": "biweekly-contest-133", "contest_id": 1048, "contest_start_time": 1719066600, "contest_duration": 5400, "user_num": 2326, "question_slugs": ["find-minimum-operations-to-make-all-elements-divisible-by-three", "minimum-operations-to-make-binary-array-elements-equal-to-one-i", "minimum-operations-to-make-binary-array-elements-equal-to-one-ii", "count-the-number-of-inversions"]}, {"contest_title": "\u7b2c 134 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 134", "contest_title_slug": "biweekly-contest-134", "contest_id": 1055, "contest_start_time": 1720276200, "contest_duration": 5400, "user_num": 2411, "question_slugs": ["alternating-groups-i", "maximum-points-after-enemy-battles", "alternating-groups-ii", "number-of-subarrays-with-and-value-of-k"]}] \ No newline at end of file +[{"contest_title": "\u7b2c 83 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 83", "contest_title_slug": "weekly-contest-83", "contest_id": 5, "contest_start_time": 1525570200, "contest_duration": 5400, "user_num": 58, "question_slugs": ["positions-of-large-groups", "masking-personal-information", "consecutive-numbers-sum", "count-unique-characters-of-all-substrings-of-a-given-string"]}, {"contest_title": "\u7b2c 84 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 84", "contest_title_slug": "weekly-contest-84", "contest_id": 6, "contest_start_time": 1526175000, "contest_duration": 5400, "user_num": 656, "question_slugs": ["flipping-an-image", "find-and-replace-in-string", "image-overlap", "sum-of-distances-in-tree"]}, {"contest_title": "\u7b2c 85 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 85", "contest_title_slug": "weekly-contest-85", "contest_id": 7, "contest_start_time": 1526779800, "contest_duration": 5400, "user_num": 467, "question_slugs": ["rectangle-overlap", "push-dominoes", "new-21-game", "similar-string-groups"]}, {"contest_title": "\u7b2c 87 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 87", "contest_title_slug": "weekly-contest-87", "contest_id": 9, "contest_start_time": 1527989400, "contest_duration": 5400, "user_num": 343, "question_slugs": ["backspace-string-compare", "longest-mountain-in-array", "hand-of-straights", "shortest-path-visiting-all-nodes"]}, {"contest_title": "\u7b2c 88 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 88", "contest_title_slug": "weekly-contest-88", "contest_id": 11, "contest_start_time": 1528594200, "contest_duration": 5400, "user_num": 404, "question_slugs": ["shifting-letters", "maximize-distance-to-closest-person", "loud-and-rich", "rectangle-area-ii"]}, {"contest_title": "\u7b2c 89 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 89", "contest_title_slug": "weekly-contest-89", "contest_id": 12, "contest_start_time": 1529199000, "contest_duration": 5400, "user_num": 491, "question_slugs": ["peak-index-in-a-mountain-array", "car-fleet", "exam-room", "k-similar-strings"]}, {"contest_title": "\u7b2c 91 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 91", "contest_title_slug": "weekly-contest-91", "contest_id": 14, "contest_start_time": 1530408600, "contest_duration": 5400, "user_num": 578, "question_slugs": ["lemonade-change", "all-nodes-distance-k-in-binary-tree", "score-after-flipping-matrix", "shortest-subarray-with-sum-at-least-k"]}, {"contest_title": "\u7b2c 92 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 92", "contest_title_slug": "weekly-contest-92", "contest_id": 15, "contest_start_time": 1531013400, "contest_duration": 5400, "user_num": 610, "question_slugs": ["transpose-matrix", "smallest-subtree-with-all-the-deepest-nodes", "prime-palindrome", "shortest-path-to-get-all-keys"]}, {"contest_title": "\u7b2c 93 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 93", "contest_title_slug": "weekly-contest-93", "contest_id": 16, "contest_start_time": 1531618200, "contest_duration": 5400, "user_num": 732, "question_slugs": ["binary-gap", "reordered-power-of-2", "advantage-shuffle", "minimum-number-of-refueling-stops"]}, {"contest_title": "\u7b2c 94 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 94", "contest_title_slug": "weekly-contest-94", "contest_id": 17, "contest_start_time": 1532223000, "contest_duration": 5400, "user_num": 733, "question_slugs": ["leaf-similar-trees", "walking-robot-simulation", "koko-eating-bananas", "length-of-longest-fibonacci-subsequence"]}, {"contest_title": "\u7b2c 95 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 95", "contest_title_slug": "weekly-contest-95", "contest_id": 18, "contest_start_time": 1532827800, "contest_duration": 5400, "user_num": 831, "question_slugs": ["middle-of-the-linked-list", "stone-game", "nth-magical-number", "profitable-schemes"]}, {"contest_title": "\u7b2c 96 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 96", "contest_title_slug": "weekly-contest-96", "contest_id": 19, "contest_start_time": 1533432600, "contest_duration": 5400, "user_num": 789, "question_slugs": ["projection-area-of-3d-shapes", "boats-to-save-people", "decoded-string-at-index", "reachable-nodes-in-subdivided-graph"]}, {"contest_title": "\u7b2c 97 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 97", "contest_title_slug": "weekly-contest-97", "contest_id": 20, "contest_start_time": 1534037400, "contest_duration": 5400, "user_num": 635, "question_slugs": ["uncommon-words-from-two-sentences", "spiral-matrix-iii", "possible-bipartition", "super-egg-drop"]}, {"contest_title": "\u7b2c 98 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 98", "contest_title_slug": "weekly-contest-98", "contest_id": 21, "contest_start_time": 1534642200, "contest_duration": 5400, "user_num": 670, "question_slugs": ["fair-candy-swap", "find-and-replace-pattern", "construct-binary-tree-from-preorder-and-postorder-traversal", "sum-of-subsequence-widths"]}, {"contest_title": "\u7b2c 99 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 99", "contest_title_slug": "weekly-contest-99", "contest_id": 22, "contest_start_time": 1535247000, "contest_duration": 5400, "user_num": 725, "question_slugs": ["surface-area-of-3d-shapes", "groups-of-special-equivalent-strings", "all-possible-full-binary-trees", "maximum-frequency-stack"]}, {"contest_title": "\u7b2c 100 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 100", "contest_title_slug": "weekly-contest-100", "contest_id": 23, "contest_start_time": 1535851800, "contest_duration": 5400, "user_num": 718, "question_slugs": ["monotonic-array", "increasing-order-search-tree", "bitwise-ors-of-subarrays", "orderly-queue"]}, {"contest_title": "\u7b2c 101 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 101", "contest_title_slug": "weekly-contest-101", "contest_id": 24, "contest_start_time": 1536456600, "contest_duration": 6300, "user_num": 854, "question_slugs": ["rle-iterator", "online-stock-span", "numbers-at-most-n-given-digit-set", "valid-permutations-for-di-sequence"]}, {"contest_title": "\u7b2c 102 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 102", "contest_title_slug": "weekly-contest-102", "contest_id": 25, "contest_start_time": 1537061400, "contest_duration": 5400, "user_num": 660, "question_slugs": ["sort-array-by-parity", "fruit-into-baskets", "sum-of-subarray-minimums", "super-palindromes"]}, {"contest_title": "\u7b2c 103 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 103", "contest_title_slug": "weekly-contest-103", "contest_id": 26, "contest_start_time": 1537666200, "contest_duration": 5400, "user_num": 575, "question_slugs": ["smallest-range-i", "snakes-and-ladders", "smallest-range-ii", "online-election"]}, {"contest_title": "\u7b2c 104 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 104", "contest_title_slug": "weekly-contest-104", "contest_id": 27, "contest_start_time": 1538271000, "contest_duration": 5400, "user_num": 354, "question_slugs": ["x-of-a-kind-in-a-deck-of-cards", "partition-array-into-disjoint-intervals", "word-subsets", "cat-and-mouse"]}, {"contest_title": "\u7b2c 105 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 105", "contest_title_slug": "weekly-contest-105", "contest_id": 28, "contest_start_time": 1538875800, "contest_duration": 5400, "user_num": 393, "question_slugs": ["reverse-only-letters", "maximum-sum-circular-subarray", "complete-binary-tree-inserter", "number-of-music-playlists"]}, {"contest_title": "\u7b2c 106 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 106", "contest_title_slug": "weekly-contest-106", "contest_id": 29, "contest_start_time": 1539480600, "contest_duration": 5400, "user_num": 369, "question_slugs": ["sort-array-by-parity-ii", "minimum-add-to-make-parentheses-valid", "3sum-with-multiplicity", "minimize-malware-spread"]}, {"contest_title": "\u7b2c 107 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 107", "contest_title_slug": "weekly-contest-107", "contest_id": 30, "contest_start_time": 1540085400, "contest_duration": 5400, "user_num": 504, "question_slugs": ["long-pressed-name", "flip-string-to-monotone-increasing", "three-equal-parts", "minimize-malware-spread-ii"]}, {"contest_title": "\u7b2c 108 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 108", "contest_title_slug": "weekly-contest-108", "contest_id": 31, "contest_start_time": 1540690200, "contest_duration": 5400, "user_num": 524, "question_slugs": ["unique-email-addresses", "binary-subarrays-with-sum", "minimum-falling-path-sum", "beautiful-array"]}, {"contest_title": "\u7b2c 109 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 109", "contest_title_slug": "weekly-contest-109", "contest_id": 32, "contest_start_time": 1541295000, "contest_duration": 5400, "user_num": 439, "question_slugs": ["number-of-recent-calls", "knight-dialer", "shortest-bridge", "stamping-the-sequence"]}, {"contest_title": "\u7b2c 110 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 110", "contest_title_slug": "weekly-contest-110", "contest_id": 33, "contest_start_time": 1541903400, "contest_duration": 5400, "user_num": 346, "question_slugs": ["reorder-data-in-log-files", "range-sum-of-bst", "minimum-area-rectangle", "distinct-subsequences-ii"]}, {"contest_title": "\u7b2c 111 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 111", "contest_title_slug": "weekly-contest-111", "contest_id": 34, "contest_start_time": 1542508200, "contest_duration": 5400, "user_num": 353, "question_slugs": ["valid-mountain-array", "delete-columns-to-make-sorted", "di-string-match", "find-the-shortest-superstring"]}, {"contest_title": "\u7b2c 112 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 112", "contest_title_slug": "weekly-contest-112", "contest_id": 35, "contest_start_time": 1543113000, "contest_duration": 5400, "user_num": 299, "question_slugs": ["minimum-increment-to-make-array-unique", "validate-stack-sequences", "most-stones-removed-with-same-row-or-column", "bag-of-tokens"]}, {"contest_title": "\u7b2c 113 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 113", "contest_title_slug": "weekly-contest-113", "contest_id": 36, "contest_start_time": 1543717800, "contest_duration": 5400, "user_num": 462, "question_slugs": ["largest-time-for-given-digits", "flip-equivalent-binary-trees", "reveal-cards-in-increasing-order", "largest-component-size-by-common-factor"]}, {"contest_title": "\u7b2c 114 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 114", "contest_title_slug": "weekly-contest-114", "contest_id": 37, "contest_start_time": 1544322600, "contest_duration": 5400, "user_num": 391, "question_slugs": ["verifying-an-alien-dictionary", "array-of-doubled-pairs", "delete-columns-to-make-sorted-ii", "tallest-billboard"]}, {"contest_title": "\u7b2c 115 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 115", "contest_title_slug": "weekly-contest-115", "contest_id": 38, "contest_start_time": 1544927400, "contest_duration": 5400, "user_num": 383, "question_slugs": ["prison-cells-after-n-days", "check-completeness-of-a-binary-tree", "regions-cut-by-slashes", "delete-columns-to-make-sorted-iii"]}, {"contest_title": "\u7b2c 116 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 116", "contest_title_slug": "weekly-contest-116", "contest_id": 39, "contest_start_time": 1545532200, "contest_duration": 5400, "user_num": 369, "question_slugs": ["n-repeated-element-in-size-2n-array", "maximum-width-ramp", "minimum-area-rectangle-ii", "least-operators-to-express-number"]}, {"contest_title": "\u7b2c 117 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 117", "contest_title_slug": "weekly-contest-117", "contest_id": 41, "contest_start_time": 1546137000, "contest_duration": 5400, "user_num": 657, "question_slugs": ["univalued-binary-tree", "numbers-with-same-consecutive-differences", "vowel-spellchecker", "binary-tree-cameras"]}, {"contest_title": "\u7b2c 118 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 118", "contest_title_slug": "weekly-contest-118", "contest_id": 42, "contest_start_time": 1546741800, "contest_duration": 5400, "user_num": 383, "question_slugs": ["powerful-integers", "pancake-sorting", "flip-binary-tree-to-match-preorder-traversal", "equal-rational-numbers"]}, {"contest_title": "\u7b2c 119 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 119", "contest_title_slug": "weekly-contest-119", "contest_id": 43, "contest_start_time": 1547346600, "contest_duration": 5400, "user_num": 513, "question_slugs": ["k-closest-points-to-origin", "largest-perimeter-triangle", "subarray-sums-divisible-by-k", "odd-even-jump"]}, {"contest_title": "\u7b2c 120 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 120", "contest_title_slug": "weekly-contest-120", "contest_id": 44, "contest_start_time": 1547951400, "contest_duration": 5400, "user_num": 382, "question_slugs": ["squares-of-a-sorted-array", "longest-turbulent-subarray", "distribute-coins-in-binary-tree", "unique-paths-iii"]}, {"contest_title": "\u7b2c 121 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 121", "contest_title_slug": "weekly-contest-121", "contest_id": 45, "contest_start_time": 1548556200, "contest_duration": 5400, "user_num": 384, "question_slugs": ["string-without-aaa-or-bbb", "time-based-key-value-store", "minimum-cost-for-tickets", "triples-with-bitwise-and-equal-to-zero"]}, {"contest_title": "\u7b2c 122 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 122", "contest_title_slug": "weekly-contest-122", "contest_id": 46, "contest_start_time": 1549161000, "contest_duration": 5400, "user_num": 280, "question_slugs": ["sum-of-even-numbers-after-queries", "smallest-string-starting-from-leaf", "interval-list-intersections", "vertical-order-traversal-of-a-binary-tree"]}, {"contest_title": "\u7b2c 123 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 123", "contest_title_slug": "weekly-contest-123", "contest_id": 47, "contest_start_time": 1549765800, "contest_duration": 5400, "user_num": 247, "question_slugs": ["add-to-array-form-of-integer", "satisfiability-of-equality-equations", "broken-calculator", "subarrays-with-k-different-integers"]}, {"contest_title": "\u7b2c 124 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 124", "contest_title_slug": "weekly-contest-124", "contest_id": 48, "contest_start_time": 1550370600, "contest_duration": 5400, "user_num": 417, "question_slugs": ["cousins-in-binary-tree", "rotting-oranges", "minimum-number-of-k-consecutive-bit-flips", "number-of-squareful-arrays"]}, {"contest_title": "\u7b2c 125 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 125", "contest_title_slug": "weekly-contest-125", "contest_id": 49, "contest_start_time": 1550975400, "contest_duration": 5400, "user_num": 469, "question_slugs": ["find-the-town-judge", "available-captures-for-rook", "maximum-binary-tree-ii", "grid-illumination"]}, {"contest_title": "\u7b2c 126 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 126", "contest_title_slug": "weekly-contest-126", "contest_id": 50, "contest_start_time": 1551580200, "contest_duration": 5400, "user_num": 591, "question_slugs": ["find-common-characters", "check-if-word-is-valid-after-substitutions", "max-consecutive-ones-iii", "minimum-cost-to-merge-stones"]}, {"contest_title": "\u7b2c 127 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 127", "contest_title_slug": "weekly-contest-127", "contest_id": 52, "contest_start_time": 1552185000, "contest_duration": 5400, "user_num": 664, "question_slugs": ["maximize-sum-of-array-after-k-negations", "clumsy-factorial", "minimum-domino-rotations-for-equal-row", "construct-binary-search-tree-from-preorder-traversal"]}, {"contest_title": "\u7b2c 128 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 128", "contest_title_slug": "weekly-contest-128", "contest_id": 53, "contest_start_time": 1552789800, "contest_duration": 5400, "user_num": 1251, "question_slugs": ["complement-of-base-10-integer", "pairs-of-songs-with-total-durations-divisible-by-60", "capacity-to-ship-packages-within-d-days", "numbers-with-repeated-digits"]}, {"contest_title": "\u7b2c 129 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 129", "contest_title_slug": "weekly-contest-129", "contest_id": 54, "contest_start_time": 1553391000, "contest_duration": 5400, "user_num": 759, "question_slugs": ["partition-array-into-three-parts-with-equal-sum", "smallest-integer-divisible-by-k", "best-sightseeing-pair", "binary-string-with-substrings-representing-1-to-n"]}, {"contest_title": "\u7b2c 130 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 130", "contest_title_slug": "weekly-contest-130", "contest_id": 55, "contest_start_time": 1553999400, "contest_duration": 5400, "user_num": 1294, "question_slugs": ["binary-prefix-divisible-by-5", "convert-to-base-2", "next-greater-node-in-linked-list", "number-of-enclaves"]}, {"contest_title": "\u7b2c 131 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 131", "contest_title_slug": "weekly-contest-131", "contest_id": 56, "contest_start_time": 1554604200, "contest_duration": 5400, "user_num": 918, "question_slugs": ["remove-outermost-parentheses", "sum-of-root-to-leaf-binary-numbers", "camelcase-matching", "video-stitching"]}, {"contest_title": "\u7b2c 132 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 132", "contest_title_slug": "weekly-contest-132", "contest_id": 57, "contest_start_time": 1555209000, "contest_duration": 5400, "user_num": 1050, "question_slugs": ["divisor-game", "maximum-difference-between-node-and-ancestor", "longest-arithmetic-subsequence", "recover-a-tree-from-preorder-traversal"]}, {"contest_title": "\u7b2c 133 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 133", "contest_title_slug": "weekly-contest-133", "contest_id": 59, "contest_start_time": 1555813800, "contest_duration": 5400, "user_num": 999, "question_slugs": ["two-city-scheduling", "matrix-cells-in-distance-order", "maximum-sum-of-two-non-overlapping-subarrays", "stream-of-characters"]}, {"contest_title": "\u7b2c 134 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 134", "contest_title_slug": "weekly-contest-134", "contest_id": 64, "contest_start_time": 1556418600, "contest_duration": 5400, "user_num": 728, "question_slugs": ["moving-stones-until-consecutive", "coloring-a-border", "uncrossed-lines", "escape-a-large-maze"]}, {"contest_title": "\u7b2c 135 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 135", "contest_title_slug": "weekly-contest-135", "contest_id": 65, "contest_start_time": 1557023400, "contest_duration": 5400, "user_num": 548, "question_slugs": ["valid-boomerang", "binary-search-tree-to-greater-sum-tree", "minimum-score-triangulation-of-polygon", "moving-stones-until-consecutive-ii"]}, {"contest_title": "\u7b2c 136 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 136", "contest_title_slug": "weekly-contest-136", "contest_id": 66, "contest_start_time": 1557628200, "contest_duration": 5400, "user_num": 790, "question_slugs": ["robot-bounded-in-circle", "flower-planting-with-no-adjacent", "partition-array-for-maximum-sum", "longest-duplicate-substring"]}, {"contest_title": "\u7b2c 137 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 137", "contest_title_slug": "weekly-contest-137", "contest_id": 67, "contest_start_time": 1558233000, "contest_duration": 5400, "user_num": 766, "question_slugs": ["last-stone-weight", "remove-all-adjacent-duplicates-in-string", "longest-string-chain", "last-stone-weight-ii"]}, {"contest_title": "\u7b2c 138 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 138", "contest_title_slug": "weekly-contest-138", "contest_id": 68, "contest_start_time": 1558837800, "contest_duration": 5400, "user_num": 752, "question_slugs": ["height-checker", "grumpy-bookstore-owner", "previous-permutation-with-one-swap", "distant-barcodes"]}, {"contest_title": "\u7b2c 139 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 139", "contest_title_slug": "weekly-contest-139", "contest_id": 69, "contest_start_time": 1559442600, "contest_duration": 5400, "user_num": 785, "question_slugs": ["greatest-common-divisor-of-strings", "flip-columns-for-maximum-number-of-equal-rows", "adding-two-negabinary-numbers", "number-of-submatrices-that-sum-to-target"]}, {"contest_title": "\u7b2c 140 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 140", "contest_title_slug": "weekly-contest-140", "contest_id": 71, "contest_start_time": 1560047400, "contest_duration": 5400, "user_num": 660, "question_slugs": ["occurrences-after-bigram", "letter-tile-possibilities", "insufficient-nodes-in-root-to-leaf-paths", "smallest-subsequence-of-distinct-characters"]}, {"contest_title": "\u7b2c 141 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 141", "contest_title_slug": "weekly-contest-141", "contest_id": 72, "contest_start_time": 1560652200, "contest_duration": 5400, "user_num": 763, "question_slugs": ["duplicate-zeros", "largest-values-from-labels", "shortest-path-in-binary-matrix", "shortest-common-supersequence"]}, {"contest_title": "\u7b2c 142 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 142", "contest_title_slug": "weekly-contest-142", "contest_id": 74, "contest_start_time": 1561257000, "contest_duration": 5400, "user_num": 801, "question_slugs": ["statistics-from-a-large-sample", "car-pooling", "find-in-mountain-array", "brace-expansion-ii"]}, {"contest_title": "\u7b2c 143 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 143", "contest_title_slug": "weekly-contest-143", "contest_id": 84, "contest_start_time": 1561861800, "contest_duration": 5400, "user_num": 803, "question_slugs": ["distribute-candies-to-people", "path-in-zigzag-labelled-binary-tree", "filling-bookcase-shelves", "parsing-a-boolean-expression"]}, {"contest_title": "\u7b2c 144 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 144", "contest_title_slug": "weekly-contest-144", "contest_id": 86, "contest_start_time": 1562466600, "contest_duration": 5400, "user_num": 777, "question_slugs": ["defanging-an-ip-address", "corporate-flight-bookings", "delete-nodes-and-return-forest", "maximum-nesting-depth-of-two-valid-parentheses-strings"]}, {"contest_title": "\u7b2c 145 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 145", "contest_title_slug": "weekly-contest-145", "contest_id": 87, "contest_start_time": 1563071400, "contest_duration": 5400, "user_num": 1114, "question_slugs": ["relative-sort-array", "lowest-common-ancestor-of-deepest-leaves", "longest-well-performing-interval", "smallest-sufficient-team"]}, {"contest_title": "\u7b2c 1 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 1", "contest_title_slug": "biweekly-contest-1", "contest_id": 70, "contest_start_time": 1559399400, "contest_duration": 7200, "user_num": 197, "question_slugs": ["fixed-point", "index-pairs-of-a-string", "campus-bikes-ii", "digit-count-in-range"]}, {"contest_title": "\u7b2c 2 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 2", "contest_title_slug": "biweekly-contest-2", "contest_id": 73, "contest_start_time": 1560609000, "contest_duration": 5400, "user_num": 256, "question_slugs": ["sum-of-digits-in-the-minimum-number", "high-five", "brace-expansion", "confusing-number-ii"]}, {"contest_title": "\u7b2c 3 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 3", "contest_title_slug": "biweekly-contest-3", "contest_id": 85, "contest_start_time": 1561818600, "contest_duration": 5400, "user_num": 312, "question_slugs": ["two-sum-less-than-k", "find-k-length-substrings-with-no-repeated-characters", "the-earliest-moment-when-everyone-become-friends", "path-with-maximum-minimum-value"]}, {"contest_title": "\u7b2c 4 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 4", "contest_title_slug": "biweekly-contest-4", "contest_id": 88, "contest_start_time": 1563028200, "contest_duration": 5400, "user_num": 438, "question_slugs": ["number-of-days-in-a-month", "remove-vowels-from-a-string", "maximum-average-subtree", "divide-array-into-increasing-sequences"]}, {"contest_title": "\u7b2c 5 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 5", "contest_title_slug": "biweekly-contest-5", "contest_id": 91, "contest_start_time": 1564237800, "contest_duration": 5400, "user_num": 495, "question_slugs": ["largest-unique-number", "armstrong-number", "connecting-cities-with-minimum-cost", "parallel-courses"]}, {"contest_title": "\u7b2c 6 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 6", "contest_title_slug": "biweekly-contest-6", "contest_id": 95, "contest_start_time": 1565447400, "contest_duration": 5400, "user_num": 513, "question_slugs": ["check-if-a-number-is-majority-element-in-a-sorted-array", "minimum-swaps-to-group-all-1s-together", "analyze-user-website-visit-pattern", "string-transforms-into-another-string"]}, {"contest_title": "\u7b2c 7 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 7", "contest_title_slug": "biweekly-contest-7", "contest_id": 99, "contest_start_time": 1566657000, "contest_duration": 5400, "user_num": 561, "question_slugs": ["single-row-keyboard", "design-file-system", "minimum-cost-to-connect-sticks", "optimize-water-distribution-in-a-village"]}, {"contest_title": "\u7b2c 8 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 8", "contest_title_slug": "biweekly-contest-8", "contest_id": 103, "contest_start_time": 1567866600, "contest_duration": 5400, "user_num": 630, "question_slugs": ["count-substrings-with-only-one-distinct-letter", "before-and-after-puzzle", "shortest-distance-to-target-color", "maximum-number-of-ones"]}, {"contest_title": "\u7b2c 9 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 9", "contest_title_slug": "biweekly-contest-9", "contest_id": 108, "contest_start_time": 1569076200, "contest_duration": 5700, "user_num": 929, "question_slugs": ["how-many-apples-can-you-put-into-the-basket", "minimum-knight-moves", "find-smallest-common-element-in-all-rows", "minimum-time-to-build-blocks"]}, {"contest_title": "\u7b2c 10 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 10", "contest_title_slug": "biweekly-contest-10", "contest_id": 115, "contest_start_time": 1570285800, "contest_duration": 5400, "user_num": 738, "question_slugs": ["intersection-of-three-sorted-arrays", "two-sum-bsts", "stepping-numbers", "valid-palindrome-iii"]}, {"contest_title": "\u7b2c 11 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 11", "contest_title_slug": "biweekly-contest-11", "contest_id": 118, "contest_start_time": 1571495400, "contest_duration": 5400, "user_num": 913, "question_slugs": ["missing-number-in-arithmetic-progression", "meeting-scheduler", "toss-strange-coins", "divide-chocolate"]}, {"contest_title": "\u7b2c 12 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 12", "contest_title_slug": "biweekly-contest-12", "contest_id": 121, "contest_start_time": 1572705000, "contest_duration": 5400, "user_num": 911, "question_slugs": ["design-a-leaderboard", "array-transformation", "tree-diameter", "palindrome-removal"]}, {"contest_title": "\u7b2c 13 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 13", "contest_title_slug": "biweekly-contest-13", "contest_id": 124, "contest_start_time": 1573914600, "contest_duration": 5400, "user_num": 810, "question_slugs": ["encode-number", "smallest-common-region", "synonymous-sentences", "handshakes-that-dont-cross"]}, {"contest_title": "\u7b2c 14 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 14", "contest_title_slug": "biweekly-contest-14", "contest_id": 129, "contest_start_time": 1575124200, "contest_duration": 5400, "user_num": 871, "question_slugs": ["hexspeak", "remove-interval", "delete-tree-nodes", "number-of-ships-in-a-rectangle"]}, {"contest_title": "\u7b2c 15 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 15", "contest_title_slug": "biweekly-contest-15", "contest_id": 132, "contest_start_time": 1576333800, "contest_duration": 5400, "user_num": 797, "question_slugs": ["element-appearing-more-than-25-in-sorted-array", "remove-covered-intervals", "iterator-for-combination", "minimum-falling-path-sum-ii"]}, {"contest_title": "\u7b2c 16 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 16", "contest_title_slug": "biweekly-contest-16", "contest_id": 135, "contest_start_time": 1577543400, "contest_duration": 5400, "user_num": 822, "question_slugs": ["replace-elements-with-greatest-element-on-right-side", "sum-of-mutated-array-closest-to-target", "deepest-leaves-sum", "number-of-paths-with-max-score"]}, {"contest_title": "\u7b2c 17 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 17", "contest_title_slug": "biweekly-contest-17", "contest_id": 138, "contest_start_time": 1578753000, "contest_duration": 5400, "user_num": 897, "question_slugs": ["decompress-run-length-encoded-list", "matrix-block-sum", "sum-of-nodes-with-even-valued-grandparent", "distinct-echo-substrings"]}, {"contest_title": "\u7b2c 18 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 18", "contest_title_slug": "biweekly-contest-18", "contest_id": 143, "contest_start_time": 1579962600, "contest_duration": 5400, "user_num": 587, "question_slugs": ["rank-transform-of-an-array", "break-a-palindrome", "sort-the-matrix-diagonally", "reverse-subarray-to-maximize-array-value"]}, {"contest_title": "\u7b2c 19 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 19", "contest_title_slug": "biweekly-contest-19", "contest_id": 146, "contest_start_time": 1581172200, "contest_duration": 5400, "user_num": 1120, "question_slugs": ["number-of-steps-to-reduce-a-number-to-zero", "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold", "angle-between-hands-of-a-clock", "jump-game-iv"]}, {"contest_title": "\u7b2c 20 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 20", "contest_title_slug": "biweekly-contest-20", "contest_id": 149, "contest_start_time": 1582381800, "contest_duration": 5400, "user_num": 1541, "question_slugs": ["sort-integers-by-the-number-of-1-bits", "apply-discount-every-n-orders", "number-of-substrings-containing-all-three-characters", "count-all-valid-pickup-and-delivery-options"]}, {"contest_title": "\u7b2c 21 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 21", "contest_title_slug": "biweekly-contest-21", "contest_id": 157, "contest_start_time": 1583591400, "contest_duration": 5400, "user_num": 1913, "question_slugs": ["increasing-decreasing-string", "find-the-longest-substring-containing-vowels-in-even-counts", "longest-zigzag-path-in-a-binary-tree", "maximum-sum-bst-in-binary-tree"]}, {"contest_title": "\u7b2c 22 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 22", "contest_title_slug": "biweekly-contest-22", "contest_id": 163, "contest_start_time": 1584801000, "contest_duration": 5400, "user_num": 2042, "question_slugs": ["find-the-distance-value-between-two-arrays", "cinema-seat-allocation", "sort-integers-by-the-power-value", "pizza-with-3n-slices"]}, {"contest_title": "\u7b2c 23 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 23", "contest_title_slug": "biweekly-contest-23", "contest_id": 169, "contest_start_time": 1586010600, "contest_duration": 5400, "user_num": 2045, "question_slugs": ["count-largest-group", "construct-k-palindrome-strings", "circle-and-rectangle-overlapping", "reducing-dishes"]}, {"contest_title": "\u7b2c 24 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 24", "contest_title_slug": "biweekly-contest-24", "contest_id": 178, "contest_start_time": 1587220200, "contest_duration": 5400, "user_num": 1898, "question_slugs": ["minimum-value-to-get-positive-step-by-step-sum", "find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k", "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n", "restore-the-array"]}, {"contest_title": "\u7b2c 25 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 25", "contest_title_slug": "biweekly-contest-25", "contest_id": 192, "contest_start_time": 1588429800, "contest_duration": 5400, "user_num": 1832, "question_slugs": ["kids-with-the-greatest-number-of-candies", "max-difference-you-can-get-from-changing-an-integer", "check-if-a-string-can-break-another-string", "number-of-ways-to-wear-different-hats-to-each-other"]}, {"contest_title": "\u7b2c 26 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 26", "contest_title_slug": "biweekly-contest-26", "contest_id": 198, "contest_start_time": 1589639400, "contest_duration": 5400, "user_num": 1971, "question_slugs": ["consecutive-characters", "simplified-fractions", "count-good-nodes-in-binary-tree", "form-largest-integer-with-digits-that-add-up-to-target"]}, {"contest_title": "\u7b2c 28 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 28", "contest_title_slug": "biweekly-contest-28", "contest_id": 210, "contest_start_time": 1592058600, "contest_duration": 5400, "user_num": 2144, "question_slugs": ["final-prices-with-a-special-discount-in-a-shop", "subrectangle-queries", "find-two-non-overlapping-sub-arrays-each-with-target-sum", "allocate-mailboxes"]}, {"contest_title": "\u7b2c 30 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 30", "contest_title_slug": "biweekly-contest-30", "contest_id": 222, "contest_start_time": 1594477800, "contest_duration": 5400, "user_num": 2545, "question_slugs": ["reformat-date", "range-sum-of-sorted-subarray-sums", "minimum-difference-between-largest-and-smallest-value-in-three-moves", "stone-game-iv"]}, {"contest_title": "\u7b2c 31 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 31", "contest_title_slug": "biweekly-contest-31", "contest_id": 232, "contest_start_time": 1595687400, "contest_duration": 5400, "user_num": 2767, "question_slugs": ["count-odd-numbers-in-an-interval-range", "number-of-sub-arrays-with-odd-sum", "number-of-good-ways-to-split-a-string", "minimum-number-of-increments-on-subarrays-to-form-a-target-array"]}, {"contest_title": "\u7b2c 32 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 32", "contest_title_slug": "biweekly-contest-32", "contest_id": 237, "contest_start_time": 1596897000, "contest_duration": 5400, "user_num": 2957, "question_slugs": ["kth-missing-positive-number", "can-convert-string-in-k-moves", "minimum-insertions-to-balance-a-parentheses-string", "find-longest-awesome-substring"]}, {"contest_title": "\u7b2c 33 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 33", "contest_title_slug": "biweekly-contest-33", "contest_id": 241, "contest_start_time": 1598106600, "contest_duration": 5400, "user_num": 3304, "question_slugs": ["thousand-separator", "minimum-number-of-vertices-to-reach-all-nodes", "minimum-numbers-of-function-calls-to-make-target-array", "detect-cycles-in-2d-grid"]}, {"contest_title": "\u7b2c 34 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 34", "contest_title_slug": "biweekly-contest-34", "contest_id": 256, "contest_start_time": 1599316200, "contest_duration": 5400, "user_num": 2842, "question_slugs": ["matrix-diagonal-sum", "number-of-ways-to-split-a-string", "shortest-subarray-to-be-removed-to-make-array-sorted", "count-all-possible-routes"]}, {"contest_title": "\u7b2c 35 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 35", "contest_title_slug": "biweekly-contest-35", "contest_id": 266, "contest_start_time": 1600525800, "contest_duration": 5400, "user_num": 2839, "question_slugs": ["sum-of-all-odd-length-subarrays", "maximum-sum-obtained-of-any-permutation", "make-sum-divisible-by-p", "strange-printer-ii"]}, {"contest_title": "\u7b2c 36 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 36", "contest_title_slug": "biweekly-contest-36", "contest_id": 288, "contest_start_time": 1601735400, "contest_duration": 5400, "user_num": 2204, "question_slugs": ["design-parking-system", "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period", "find-valid-matrix-given-row-and-column-sums", "find-servers-that-handled-most-number-of-requests"]}, {"contest_title": "\u7b2c 37 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 37", "contest_title_slug": "biweekly-contest-37", "contest_id": 294, "contest_start_time": 1602945000, "contest_duration": 5400, "user_num": 2104, "question_slugs": ["mean-of-array-after-removing-some-elements", "coordinate-with-maximum-network-quality", "number-of-sets-of-k-non-overlapping-line-segments", "fancy-sequence"]}, {"contest_title": "\u7b2c 38 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 38", "contest_title_slug": "biweekly-contest-38", "contest_id": 300, "contest_start_time": 1604154600, "contest_duration": 5400, "user_num": 2004, "question_slugs": ["sort-array-by-increasing-frequency", "widest-vertical-area-between-two-points-containing-no-points", "count-substrings-that-differ-by-one-character", "number-of-ways-to-form-a-target-string-given-a-dictionary"]}, {"contest_title": "\u7b2c 39 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 39", "contest_title_slug": "biweekly-contest-39", "contest_id": 306, "contest_start_time": 1605364200, "contest_duration": 5400, "user_num": 2069, "question_slugs": ["defuse-the-bomb", "minimum-deletions-to-make-string-balanced", "minimum-jumps-to-reach-home", "distribute-repeating-integers"]}, {"contest_title": "\u7b2c 40 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 40", "contest_title_slug": "biweekly-contest-40", "contest_id": 312, "contest_start_time": 1606573800, "contest_duration": 5400, "user_num": 1891, "question_slugs": ["maximum-repeating-substring", "merge-in-between-linked-lists", "design-front-middle-back-queue", "minimum-number-of-removals-to-make-mountain-array"]}, {"contest_title": "\u7b2c 41 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 41", "contest_title_slug": "biweekly-contest-41", "contest_id": 318, "contest_start_time": 1607783400, "contest_duration": 5400, "user_num": 1660, "question_slugs": ["count-the-number-of-consistent-strings", "sum-of-absolute-differences-in-a-sorted-array", "stone-game-vi", "delivering-boxes-from-storage-to-ports"]}, {"contest_title": "\u7b2c 42 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 42", "contest_title_slug": "biweekly-contest-42", "contest_id": 325, "contest_start_time": 1608993000, "contest_duration": 5400, "user_num": 1578, "question_slugs": ["number-of-students-unable-to-eat-lunch", "average-waiting-time", "maximum-binary-string-after-change", "minimum-adjacent-swaps-for-k-consecutive-ones"]}, {"contest_title": "\u7b2c 43 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 43", "contest_title_slug": "biweekly-contest-43", "contest_id": 331, "contest_start_time": 1610202600, "contest_duration": 5400, "user_num": 1631, "question_slugs": ["calculate-money-in-leetcode-bank", "maximum-score-from-removing-substrings", "construct-the-lexicographically-largest-valid-sequence", "number-of-ways-to-reconstruct-a-tree"]}, {"contest_title": "\u7b2c 44 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 44", "contest_title_slug": "biweekly-contest-44", "contest_id": 337, "contest_start_time": 1611412200, "contest_duration": 5400, "user_num": 1826, "question_slugs": ["find-the-highest-altitude", "minimum-number-of-people-to-teach", "decode-xored-permutation", "count-ways-to-make-array-with-product"]}, {"contest_title": "\u7b2c 45 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 45", "contest_title_slug": "biweekly-contest-45", "contest_id": 343, "contest_start_time": 1612621800, "contest_duration": 5400, "user_num": 1676, "question_slugs": ["sum-of-unique-elements", "maximum-absolute-sum-of-any-subarray", "minimum-length-of-string-after-deleting-similar-ends", "maximum-number-of-events-that-can-be-attended-ii"]}, {"contest_title": "\u7b2c 46 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 46", "contest_title_slug": "biweekly-contest-46", "contest_id": 349, "contest_start_time": 1613831400, "contest_duration": 5400, "user_num": 1647, "question_slugs": ["longest-nice-substring", "form-array-by-concatenating-subarrays-of-another-array", "map-of-highest-peak", "tree-of-coprimes"]}, {"contest_title": "\u7b2c 47 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 47", "contest_title_slug": "biweekly-contest-47", "contest_id": 355, "contest_start_time": 1615041000, "contest_duration": 5400, "user_num": 3085, "question_slugs": ["find-nearest-point-that-has-the-same-x-or-y-coordinate", "check-if-number-is-a-sum-of-powers-of-three", "sum-of-beauty-of-all-substrings", "count-pairs-of-nodes"]}, {"contest_title": "\u7b2c 48 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 48", "contest_title_slug": "biweekly-contest-48", "contest_id": 362, "contest_start_time": 1616250600, "contest_duration": 5400, "user_num": 2853, "question_slugs": ["second-largest-digit-in-a-string", "design-authentication-manager", "maximum-number-of-consecutive-values-you-can-make", "maximize-score-after-n-operations"]}, {"contest_title": "\u7b2c 49 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 49", "contest_title_slug": "biweekly-contest-49", "contest_id": 374, "contest_start_time": 1617460200, "contest_duration": 5400, "user_num": 3193, "question_slugs": ["determine-color-of-a-chessboard-square", "sentence-similarity-iii", "count-nice-pairs-in-an-array", "maximum-number-of-groups-getting-fresh-donuts"]}, {"contest_title": "\u7b2c 50 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 50", "contest_title_slug": "biweekly-contest-50", "contest_id": 390, "contest_start_time": 1618669800, "contest_duration": 5400, "user_num": 3608, "question_slugs": ["minimum-operations-to-make-the-array-increasing", "queries-on-number-of-points-inside-a-circle", "maximum-xor-for-each-query", "minimum-number-of-operations-to-make-string-sorted"]}, {"contest_title": "\u7b2c 51 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 51", "contest_title_slug": "biweekly-contest-51", "contest_id": 396, "contest_start_time": 1619879400, "contest_duration": 5400, "user_num": 2675, "question_slugs": ["replace-all-digits-with-characters", "seat-reservation-manager", "maximum-element-after-decreasing-and-rearranging", "closest-room"]}, {"contest_title": "\u7b2c 52 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 52", "contest_title_slug": "biweekly-contest-52", "contest_id": 402, "contest_start_time": 1621089000, "contest_duration": 5400, "user_num": 2930, "question_slugs": ["sorting-the-sentence", "incremental-memory-leak", "rotating-the-box", "sum-of-floored-pairs"]}, {"contest_title": "\u7b2c 53 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 53", "contest_title_slug": "biweekly-contest-53", "contest_id": 408, "contest_start_time": 1622298600, "contest_duration": 5400, "user_num": 3069, "question_slugs": ["substrings-of-size-three-with-distinct-characters", "minimize-maximum-pair-sum-in-array", "get-biggest-three-rhombus-sums-in-a-grid", "minimum-xor-sum-of-two-arrays"]}, {"contest_title": "\u7b2c 54 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 54", "contest_title_slug": "biweekly-contest-54", "contest_id": 414, "contest_start_time": 1623508200, "contest_duration": 5400, "user_num": 2479, "question_slugs": ["check-if-all-the-integers-in-a-range-are-covered", "find-the-student-that-will-replace-the-chalk", "largest-magic-square", "minimum-cost-to-change-the-final-value-of-expression"]}, {"contest_title": "\u7b2c 55 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 55", "contest_title_slug": "biweekly-contest-55", "contest_id": 421, "contest_start_time": 1624717800, "contest_duration": 5400, "user_num": 3277, "question_slugs": ["remove-one-element-to-make-the-array-strictly-increasing", "remove-all-occurrences-of-a-substring", "maximum-alternating-subsequence-sum", "design-movie-rental-system"]}, {"contest_title": "\u7b2c 56 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 56", "contest_title_slug": "biweekly-contest-56", "contest_id": 429, "contest_start_time": 1625927400, "contest_duration": 5400, "user_num": 2760, "question_slugs": ["count-square-sum-triples", "nearest-exit-from-entrance-in-maze", "sum-game", "minimum-cost-to-reach-destination-in-time"]}, {"contest_title": "\u7b2c 57 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 57", "contest_title_slug": "biweekly-contest-57", "contest_id": 435, "contest_start_time": 1627137000, "contest_duration": 5400, "user_num": 2933, "question_slugs": ["check-if-all-characters-have-equal-number-of-occurrences", "the-number-of-the-smallest-unoccupied-chair", "describe-the-painting", "number-of-visible-people-in-a-queue"]}, {"contest_title": "\u7b2c 86 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 86", "contest_title_slug": "weekly-contest-86", "contest_id": 8, "contest_start_time": 1527384600, "contest_duration": 5400, "user_num": 377, "question_slugs": ["magic-squares-in-grid", "keys-and-rooms", "split-array-into-fibonacci-sequence", "guess-the-word"]}, {"contest_title": "\u7b2c 90 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 90", "contest_title_slug": "weekly-contest-90", "contest_id": 13, "contest_start_time": 1529803800, "contest_duration": 5400, "user_num": 573, "question_slugs": ["buddy-strings", "score-of-parentheses", "mirror-reflection", "minimum-cost-to-hire-k-workers"]}, {"contest_title": "\u7b2c 146 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 146", "contest_title_slug": "weekly-contest-146", "contest_id": 89, "contest_start_time": 1563676200, "contest_duration": 5400, "user_num": 1189, "question_slugs": ["number-of-equivalent-domino-pairs", "shortest-path-with-alternating-colors", "minimum-cost-tree-from-leaf-values", "maximum-of-absolute-value-expression"]}, {"contest_title": "\u7b2c 147 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 147", "contest_title_slug": "weekly-contest-147", "contest_id": 90, "contest_start_time": 1564281000, "contest_duration": 5400, "user_num": 1132, "question_slugs": ["n-th-tribonacci-number", "alphabet-board-path", "largest-1-bordered-square", "stone-game-ii"]}, {"contest_title": "\u7b2c 148 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 148", "contest_title_slug": "weekly-contest-148", "contest_id": 93, "contest_start_time": 1564885800, "contest_duration": 5400, "user_num": 1251, "question_slugs": ["decrease-elements-to-make-array-zigzag", "binary-tree-coloring-game", "snapshot-array", "longest-chunked-palindrome-decomposition"]}, {"contest_title": "\u7b2c 149 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 149", "contest_title_slug": "weekly-contest-149", "contest_id": 94, "contest_start_time": 1565490600, "contest_duration": 5400, "user_num": 1351, "question_slugs": ["day-of-the-year", "number-of-dice-rolls-with-target-sum", "swap-for-longest-repeated-character-substring", "online-majority-element-in-subarray"]}, {"contest_title": "\u7b2c 150 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 150", "contest_title_slug": "weekly-contest-150", "contest_id": 96, "contest_start_time": 1566095400, "contest_duration": 5400, "user_num": 1473, "question_slugs": ["find-words-that-can-be-formed-by-characters", "maximum-level-sum-of-a-binary-tree", "as-far-from-land-as-possible", "last-substring-in-lexicographical-order"]}, {"contest_title": "\u7b2c 151 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 151", "contest_title_slug": "weekly-contest-151", "contest_id": 98, "contest_start_time": 1566700200, "contest_duration": 5400, "user_num": 1341, "question_slugs": ["invalid-transactions", "compare-strings-by-frequency-of-the-smallest-character", "remove-zero-sum-consecutive-nodes-from-linked-list", "dinner-plate-stacks"]}, {"contest_title": "\u7b2c 152 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 152", "contest_title_slug": "weekly-contest-152", "contest_id": 100, "contest_start_time": 1567305000, "contest_duration": 5400, "user_num": 1367, "question_slugs": ["prime-arrangements", "diet-plan-performance", "can-make-palindrome-from-substring", "number-of-valid-words-for-each-puzzle"]}, {"contest_title": "\u7b2c 153 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 153", "contest_title_slug": "weekly-contest-153", "contest_id": 102, "contest_start_time": 1567909800, "contest_duration": 5400, "user_num": 1434, "question_slugs": ["distance-between-bus-stops", "day-of-the-week", "maximum-subarray-sum-with-one-deletion", "make-array-strictly-increasing"]}, {"contest_title": "\u7b2c 154 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 154", "contest_title_slug": "weekly-contest-154", "contest_id": 106, "contest_start_time": 1568514600, "contest_duration": 5400, "user_num": 1299, "question_slugs": ["maximum-number-of-balloons", "reverse-substrings-between-each-pair-of-parentheses", "k-concatenation-maximum-sum", "critical-connections-in-a-network"]}, {"contest_title": "\u7b2c 155 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 155", "contest_title_slug": "weekly-contest-155", "contest_id": 107, "contest_start_time": 1569119400, "contest_duration": 5400, "user_num": 1603, "question_slugs": ["minimum-absolute-difference", "ugly-number-iii", "smallest-string-with-swaps", "sort-items-by-groups-respecting-dependencies"]}, {"contest_title": "\u7b2c 156 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 156", "contest_title_slug": "weekly-contest-156", "contest_id": 113, "contest_start_time": 1569724200, "contest_duration": 5400, "user_num": 1433, "question_slugs": ["unique-number-of-occurrences", "get-equal-substrings-within-budget", "remove-all-adjacent-duplicates-in-string-ii", "minimum-moves-to-reach-target-with-rotations"]}, {"contest_title": "\u7b2c 157 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 157", "contest_title_slug": "weekly-contest-157", "contest_id": 114, "contest_start_time": 1570329000, "contest_duration": 5400, "user_num": 1217, "question_slugs": ["minimum-cost-to-move-chips-to-the-same-position", "longest-arithmetic-subsequence-of-given-difference", "path-with-maximum-gold", "count-vowels-permutation"]}, {"contest_title": "\u7b2c 158 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 158", "contest_title_slug": "weekly-contest-158", "contest_id": 116, "contest_start_time": 1570933800, "contest_duration": 5400, "user_num": 1716, "question_slugs": ["split-a-string-in-balanced-strings", "queens-that-can-attack-the-king", "dice-roll-simulation", "maximum-equal-frequency"]}, {"contest_title": "\u7b2c 159 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 159", "contest_title_slug": "weekly-contest-159", "contest_id": 117, "contest_start_time": 1571538600, "contest_duration": 5400, "user_num": 1634, "question_slugs": ["check-if-it-is-a-straight-line", "remove-sub-folders-from-the-filesystem", "replace-the-substring-for-balanced-string", "maximum-profit-in-job-scheduling"]}, {"contest_title": "\u7b2c 160 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 160", "contest_title_slug": "weekly-contest-160", "contest_id": 119, "contest_start_time": 1572143400, "contest_duration": 5400, "user_num": 1692, "question_slugs": ["find-positive-integer-solution-for-a-given-equation", "circular-permutation-in-binary-representation", "maximum-length-of-a-concatenated-string-with-unique-characters", "tiling-a-rectangle-with-the-fewest-squares"]}, {"contest_title": "\u7b2c 161 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 161", "contest_title_slug": "weekly-contest-161", "contest_id": 120, "contest_start_time": 1572748200, "contest_duration": 5400, "user_num": 1610, "question_slugs": ["minimum-swaps-to-make-strings-equal", "count-number-of-nice-subarrays", "minimum-remove-to-make-valid-parentheses", "check-if-it-is-a-good-array"]}, {"contest_title": "\u7b2c 162 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 162", "contest_title_slug": "weekly-contest-162", "contest_id": 122, "contest_start_time": 1573353000, "contest_duration": 5400, "user_num": 1569, "question_slugs": ["cells-with-odd-values-in-a-matrix", "reconstruct-a-2-row-binary-matrix", "number-of-closed-islands", "maximum-score-words-formed-by-letters"]}, {"contest_title": "\u7b2c 163 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 163", "contest_title_slug": "weekly-contest-163", "contest_id": 123, "contest_start_time": 1573957800, "contest_duration": 5400, "user_num": 1605, "question_slugs": ["shift-2d-grid", "find-elements-in-a-contaminated-binary-tree", "greatest-sum-divisible-by-three", "minimum-moves-to-move-a-box-to-their-target-location"]}, {"contest_title": "\u7b2c 164 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 164", "contest_title_slug": "weekly-contest-164", "contest_id": 125, "contest_start_time": 1574562600, "contest_duration": 5400, "user_num": 1676, "question_slugs": ["minimum-time-visiting-all-points", "count-servers-that-communicate", "search-suggestions-system", "number-of-ways-to-stay-in-the-same-place-after-some-steps"]}, {"contest_title": "\u7b2c 165 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 165", "contest_title_slug": "weekly-contest-165", "contest_id": 128, "contest_start_time": 1575167400, "contest_duration": 5400, "user_num": 1660, "question_slugs": ["find-winner-on-a-tic-tac-toe-game", "number-of-burgers-with-no-waste-of-ingredients", "count-square-submatrices-with-all-ones", "palindrome-partitioning-iii"]}, {"contest_title": "\u7b2c 166 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 166", "contest_title_slug": "weekly-contest-166", "contest_id": 130, "contest_start_time": 1575772200, "contest_duration": 5400, "user_num": 1676, "question_slugs": ["subtract-the-product-and-sum-of-digits-of-an-integer", "group-the-people-given-the-group-size-they-belong-to", "find-the-smallest-divisor-given-a-threshold", "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"]}, {"contest_title": "\u7b2c 167 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 167", "contest_title_slug": "weekly-contest-167", "contest_id": 131, "contest_start_time": 1576377000, "contest_duration": 5400, "user_num": 1537, "question_slugs": ["convert-binary-number-in-a-linked-list-to-integer", "sequential-digits", "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold", "shortest-path-in-a-grid-with-obstacles-elimination"]}, {"contest_title": "\u7b2c 168 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 168", "contest_title_slug": "weekly-contest-168", "contest_id": 133, "contest_start_time": 1576981800, "contest_duration": 5400, "user_num": 1553, "question_slugs": ["find-numbers-with-even-number-of-digits", "divide-array-in-sets-of-k-consecutive-numbers", "maximum-number-of-occurrences-of-a-substring", "maximum-candies-you-can-get-from-boxes"]}, {"contest_title": "\u7b2c 169 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 169", "contest_title_slug": "weekly-contest-169", "contest_id": 134, "contest_start_time": 1577586600, "contest_duration": 5400, "user_num": 1568, "question_slugs": ["find-n-unique-integers-sum-up-to-zero", "all-elements-in-two-binary-search-trees", "jump-game-iii", "verbal-arithmetic-puzzle"]}, {"contest_title": "\u7b2c 170 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 170", "contest_title_slug": "weekly-contest-170", "contest_id": 136, "contest_start_time": 1578191400, "contest_duration": 5400, "user_num": 1649, "question_slugs": ["decrypt-string-from-alphabet-to-integer-mapping", "xor-queries-of-a-subarray", "get-watched-videos-by-your-friends", "minimum-insertion-steps-to-make-a-string-palindrome"]}, {"contest_title": "\u7b2c 171 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 171", "contest_title_slug": "weekly-contest-171", "contest_id": 137, "contest_start_time": 1578796200, "contest_duration": 5400, "user_num": 1708, "question_slugs": ["convert-integer-to-the-sum-of-two-no-zero-integers", "minimum-flips-to-make-a-or-b-equal-to-c", "number-of-operations-to-make-network-connected", "minimum-distance-to-type-a-word-using-two-fingers"]}, {"contest_title": "\u7b2c 172 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 172", "contest_title_slug": "weekly-contest-172", "contest_id": 139, "contest_start_time": 1579401000, "contest_duration": 5400, "user_num": 1415, "question_slugs": ["maximum-69-number", "print-words-vertically", "delete-leaves-with-a-given-value", "minimum-number-of-taps-to-open-to-water-a-garden"]}, {"contest_title": "\u7b2c 173 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 173", "contest_title_slug": "weekly-contest-173", "contest_id": 142, "contest_start_time": 1580005800, "contest_duration": 5400, "user_num": 1072, "question_slugs": ["remove-palindromic-subsequences", "filter-restaurants-by-vegan-friendly-price-and-distance", "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", "minimum-difficulty-of-a-job-schedule"]}, {"contest_title": "\u7b2c 174 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 174", "contest_title_slug": "weekly-contest-174", "contest_id": 144, "contest_start_time": 1580610600, "contest_duration": 5400, "user_num": 1660, "question_slugs": ["the-k-weakest-rows-in-a-matrix", "reduce-array-size-to-the-half", "maximum-product-of-splitted-binary-tree", "jump-game-v"]}, {"contest_title": "\u7b2c 175 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 175", "contest_title_slug": "weekly-contest-175", "contest_id": 145, "contest_start_time": 1581215400, "contest_duration": 5400, "user_num": 2048, "question_slugs": ["check-if-n-and-its-double-exist", "minimum-number-of-steps-to-make-two-strings-anagram", "tweet-counts-per-frequency", "maximum-students-taking-exam"]}, {"contest_title": "\u7b2c 176 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 176", "contest_title_slug": "weekly-contest-176", "contest_id": 147, "contest_start_time": 1581820200, "contest_duration": 5400, "user_num": 2410, "question_slugs": ["count-negative-numbers-in-a-sorted-matrix", "product-of-the-last-k-numbers", "maximum-number-of-events-that-can-be-attended", "construct-target-array-with-multiple-sums"]}, {"contest_title": "\u7b2c 177 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 177", "contest_title_slug": "weekly-contest-177", "contest_id": 148, "contest_start_time": 1582425000, "contest_duration": 5400, "user_num": 2986, "question_slugs": ["number-of-days-between-two-dates", "validate-binary-tree-nodes", "closest-divisors", "largest-multiple-of-three"]}, {"contest_title": "\u7b2c 178 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 178", "contest_title_slug": "weekly-contest-178", "contest_id": 154, "contest_start_time": 1583029800, "contest_duration": 5400, "user_num": 3305, "question_slugs": ["how-many-numbers-are-smaller-than-the-current-number", "rank-teams-by-votes", "linked-list-in-binary-tree", "minimum-cost-to-make-at-least-one-valid-path-in-a-grid"]}, {"contest_title": "\u7b2c 179 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 179", "contest_title_slug": "weekly-contest-179", "contest_id": 156, "contest_start_time": 1583634600, "contest_duration": 5400, "user_num": 3606, "question_slugs": ["generate-a-string-with-characters-that-have-odd-counts", "number-of-times-binary-string-is-prefix-aligned", "time-needed-to-inform-all-employees", "frog-position-after-t-seconds"]}, {"contest_title": "\u7b2c 180 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 180", "contest_title_slug": "weekly-contest-180", "contest_id": 160, "contest_start_time": 1584239400, "contest_duration": 5400, "user_num": 3715, "question_slugs": ["lucky-numbers-in-a-matrix", "design-a-stack-with-increment-operation", "balance-a-binary-search-tree", "maximum-performance-of-a-team"]}, {"contest_title": "\u7b2c 181 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 181", "contest_title_slug": "weekly-contest-181", "contest_id": 162, "contest_start_time": 1584844200, "contest_duration": 5400, "user_num": 4149, "question_slugs": ["create-target-array-in-the-given-order", "four-divisors", "check-if-there-is-a-valid-path-in-a-grid", "longest-happy-prefix"]}, {"contest_title": "\u7b2c 182 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 182", "contest_title_slug": "weekly-contest-182", "contest_id": 166, "contest_start_time": 1585449000, "contest_duration": 5400, "user_num": 3911, "question_slugs": ["find-lucky-integer-in-an-array", "count-number-of-teams", "design-underground-system", "find-all-good-strings"]}, {"contest_title": "\u7b2c 183 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 183", "contest_title_slug": "weekly-contest-183", "contest_id": 168, "contest_start_time": 1586053800, "contest_duration": 5400, "user_num": 3756, "question_slugs": ["minimum-subsequence-in-non-increasing-order", "number-of-steps-to-reduce-a-number-in-binary-representation-to-one", "longest-happy-string", "stone-game-iii"]}, {"contest_title": "\u7b2c 184 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 184", "contest_title_slug": "weekly-contest-184", "contest_id": 175, "contest_start_time": 1586658600, "contest_duration": 5400, "user_num": 3847, "question_slugs": ["string-matching-in-an-array", "queries-on-a-permutation-with-key", "html-entity-parser", "number-of-ways-to-paint-n-3-grid"]}, {"contest_title": "\u7b2c 185 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 185", "contest_title_slug": "weekly-contest-185", "contest_id": 177, "contest_start_time": 1587263400, "contest_duration": 5400, "user_num": 5004, "question_slugs": ["reformat-the-string", "display-table-of-food-orders-in-a-restaurant", "minimum-number-of-frogs-croaking", "build-array-where-you-can-find-the-maximum-exactly-k-comparisons"]}, {"contest_title": "\u7b2c 186 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 186", "contest_title_slug": "weekly-contest-186", "contest_id": 185, "contest_start_time": 1587868200, "contest_duration": 5400, "user_num": 3108, "question_slugs": ["maximum-score-after-splitting-a-string", "maximum-points-you-can-obtain-from-cards", "diagonal-traverse-ii", "constrained-subsequence-sum"]}, {"contest_title": "\u7b2c 187 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 187", "contest_title_slug": "weekly-contest-187", "contest_id": 191, "contest_start_time": 1588473000, "contest_duration": 5400, "user_num": 3109, "question_slugs": ["destination-city", "check-if-all-1s-are-at-least-length-k-places-away", "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit", "find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"]}, {"contest_title": "\u7b2c 188 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 188", "contest_title_slug": "weekly-contest-188", "contest_id": 195, "contest_start_time": 1589077800, "contest_duration": 5400, "user_num": 3982, "question_slugs": ["build-an-array-with-stack-operations", "count-triplets-that-can-form-two-arrays-of-equal-xor", "minimum-time-to-collect-all-apples-in-a-tree", "number-of-ways-of-cutting-a-pizza"]}, {"contest_title": "\u7b2c 189 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 189", "contest_title_slug": "weekly-contest-189", "contest_id": 197, "contest_start_time": 1589682600, "contest_duration": 5400, "user_num": 3692, "question_slugs": ["number-of-students-doing-homework-at-a-given-time", "rearrange-words-in-a-sentence", "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list", "maximum-number-of-darts-inside-of-a-circular-dartboard"]}, {"contest_title": "\u7b2c 190 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 190", "contest_title_slug": "weekly-contest-190", "contest_id": 201, "contest_start_time": 1590287400, "contest_duration": 5400, "user_num": 3352, "question_slugs": ["check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence", "maximum-number-of-vowels-in-a-substring-of-given-length", "pseudo-palindromic-paths-in-a-binary-tree", "max-dot-product-of-two-subsequences"]}, {"contest_title": "\u7b2c 191 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 191", "contest_title_slug": "weekly-contest-191", "contest_id": 203, "contest_start_time": 1590892200, "contest_duration": 5400, "user_num": 3687, "question_slugs": ["maximum-product-of-two-elements-in-an-array", "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts", "reorder-routes-to-make-all-paths-lead-to-the-city-zero", "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"]}, {"contest_title": "\u7b2c 192 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 192", "contest_title_slug": "weekly-contest-192", "contest_id": 207, "contest_start_time": 1591497000, "contest_duration": 5400, "user_num": 3615, "question_slugs": ["shuffle-the-array", "the-k-strongest-values-in-an-array", "design-browser-history", "paint-house-iii"]}, {"contest_title": "\u7b2c 193 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 193", "contest_title_slug": "weekly-contest-193", "contest_id": 209, "contest_start_time": 1592101800, "contest_duration": 5400, "user_num": 3804, "question_slugs": ["running-sum-of-1d-array", "least-number-of-unique-integers-after-k-removals", "minimum-number-of-days-to-make-m-bouquets", "kth-ancestor-of-a-tree-node"]}, {"contest_title": "\u7b2c 194 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 194", "contest_title_slug": "weekly-contest-194", "contest_id": 213, "contest_start_time": 1592706600, "contest_duration": 5400, "user_num": 4378, "question_slugs": ["xor-operation-in-an-array", "making-file-names-unique", "avoid-flood-in-the-city", "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"]}, {"contest_title": "\u7b2c 195 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 195", "contest_title_slug": "weekly-contest-195", "contest_id": 215, "contest_start_time": 1593311400, "contest_duration": 5400, "user_num": 3401, "question_slugs": ["path-crossing", "check-if-array-pairs-are-divisible-by-k", "number-of-subsequences-that-satisfy-the-given-sum-condition", "max-value-of-equation"]}, {"contest_title": "\u7b2c 196 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 196", "contest_title_slug": "weekly-contest-196", "contest_id": 219, "contest_start_time": 1593916200, "contest_duration": 5400, "user_num": 5507, "question_slugs": ["can-make-arithmetic-progression-from-sequence", "last-moment-before-all-ants-fall-out-of-a-plank", "count-submatrices-with-all-ones", "minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"]}, {"contest_title": "\u7b2c 197 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 197", "contest_title_slug": "weekly-contest-197", "contest_id": 221, "contest_start_time": 1594521000, "contest_duration": 5400, "user_num": 5275, "question_slugs": ["number-of-good-pairs", "number-of-substrings-with-only-1s", "path-with-maximum-probability", "best-position-for-a-service-centre"]}, {"contest_title": "\u7b2c 198 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 198", "contest_title_slug": "weekly-contest-198", "contest_id": 226, "contest_start_time": 1595125800, "contest_duration": 5400, "user_num": 5780, "question_slugs": ["water-bottles", "number-of-nodes-in-the-sub-tree-with-the-same-label", "maximum-number-of-non-overlapping-substrings", "find-a-value-of-a-mysterious-function-closest-to-target"]}, {"contest_title": "\u7b2c 199 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 199", "contest_title_slug": "weekly-contest-199", "contest_id": 228, "contest_start_time": 1595730600, "contest_duration": 5400, "user_num": 5232, "question_slugs": ["shuffle-string", "minimum-suffix-flips", "number-of-good-leaf-nodes-pairs", "string-compression-ii"]}, {"contest_title": "\u7b2c 200 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 200", "contest_title_slug": "weekly-contest-200", "contest_id": 235, "contest_start_time": 1596335400, "contest_duration": 5400, "user_num": 5476, "question_slugs": ["count-good-triplets", "find-the-winner-of-an-array-game", "minimum-swaps-to-arrange-a-binary-grid", "get-the-maximum-score"]}, {"contest_title": "\u7b2c 201 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 201", "contest_title_slug": "weekly-contest-201", "contest_id": 238, "contest_start_time": 1596940200, "contest_duration": 5400, "user_num": 5615, "question_slugs": ["make-the-string-great", "find-kth-bit-in-nth-binary-string", "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target", "minimum-cost-to-cut-a-stick"]}, {"contest_title": "\u7b2c 202 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 202", "contest_title_slug": "weekly-contest-202", "contest_id": 242, "contest_start_time": 1597545000, "contest_duration": 5400, "user_num": 4990, "question_slugs": ["three-consecutive-odds", "minimum-operations-to-make-array-equal", "magnetic-force-between-two-balls", "minimum-number-of-days-to-eat-n-oranges"]}, {"contest_title": "\u7b2c 203 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 203", "contest_title_slug": "weekly-contest-203", "contest_id": 244, "contest_start_time": 1598149800, "contest_duration": 5400, "user_num": 5285, "question_slugs": ["most-visited-sector-in-a-circular-track", "maximum-number-of-coins-you-can-get", "find-latest-group-of-size-m", "stone-game-v"]}, {"contest_title": "\u7b2c 204 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 204", "contest_title_slug": "weekly-contest-204", "contest_id": 257, "contest_start_time": 1598754600, "contest_duration": 5400, "user_num": 4487, "question_slugs": ["detect-pattern-of-length-m-repeated-k-or-more-times", "maximum-length-of-subarray-with-positive-product", "minimum-number-of-days-to-disconnect-island", "number-of-ways-to-reorder-array-to-get-same-bst"]}, {"contest_title": "\u7b2c 205 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 205", "contest_title_slug": "weekly-contest-205", "contest_id": 260, "contest_start_time": 1599359400, "contest_duration": 5400, "user_num": 4176, "question_slugs": ["replace-all-s-to-avoid-consecutive-repeating-characters", "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers", "minimum-time-to-make-rope-colorful", "remove-max-number-of-edges-to-keep-graph-fully-traversable"]}, {"contest_title": "\u7b2c 206 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 206", "contest_title_slug": "weekly-contest-206", "contest_id": 267, "contest_start_time": 1599964200, "contest_duration": 5400, "user_num": 4493, "question_slugs": ["special-positions-in-a-binary-matrix", "count-unhappy-friends", "min-cost-to-connect-all-points", "check-if-string-is-transformable-with-substring-sort-operations"]}, {"contest_title": "\u7b2c 207 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 207", "contest_title_slug": "weekly-contest-207", "contest_id": 278, "contest_start_time": 1600569000, "contest_duration": 5400, "user_num": 4116, "question_slugs": ["rearrange-spaces-between-words", "split-a-string-into-the-max-number-of-unique-substrings", "maximum-non-negative-product-in-a-matrix", "minimum-cost-to-connect-two-groups-of-points"]}, {"contest_title": "\u7b2c 208 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 208", "contest_title_slug": "weekly-contest-208", "contest_id": 289, "contest_start_time": 1601173800, "contest_duration": 5400, "user_num": 3582, "question_slugs": ["crawler-log-folder", "maximum-profit-of-operating-a-centennial-wheel", "throne-inheritance", "maximum-number-of-achievable-transfer-requests"]}, {"contest_title": "\u7b2c 209 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 209", "contest_title_slug": "weekly-contest-209", "contest_id": 291, "contest_start_time": 1601778600, "contest_duration": 5400, "user_num": 4023, "question_slugs": ["special-array-with-x-elements-greater-than-or-equal-x", "even-odd-tree", "maximum-number-of-visible-points", "minimum-one-bit-operations-to-make-integers-zero"]}, {"contest_title": "\u7b2c 210 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 210", "contest_title_slug": "weekly-contest-210", "contest_id": 295, "contest_start_time": 1602383400, "contest_duration": 5400, "user_num": 4007, "question_slugs": ["maximum-nesting-depth-of-the-parentheses", "maximal-network-rank", "split-two-strings-to-make-palindrome", "count-subtrees-with-max-distance-between-cities"]}, {"contest_title": "\u7b2c 211 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 211", "contest_title_slug": "weekly-contest-211", "contest_id": 297, "contest_start_time": 1602988200, "contest_duration": 5400, "user_num": 4034, "question_slugs": ["largest-substring-between-two-equal-characters", "lexicographically-smallest-string-after-applying-operations", "best-team-with-no-conflicts", "graph-connectivity-with-threshold"]}, {"contest_title": "\u7b2c 212 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 212", "contest_title_slug": "weekly-contest-212", "contest_id": 301, "contest_start_time": 1603593000, "contest_duration": 5400, "user_num": 4227, "question_slugs": ["slowest-key", "arithmetic-subarrays", "path-with-minimum-effort", "rank-transform-of-a-matrix"]}, {"contest_title": "\u7b2c 213 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 213", "contest_title_slug": "weekly-contest-213", "contest_id": 303, "contest_start_time": 1604197800, "contest_duration": 5400, "user_num": 3827, "question_slugs": ["check-array-formation-through-concatenation", "count-sorted-vowel-strings", "furthest-building-you-can-reach", "kth-smallest-instructions"]}, {"contest_title": "\u7b2c 214 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 214", "contest_title_slug": "weekly-contest-214", "contest_id": 307, "contest_start_time": 1604802600, "contest_duration": 5400, "user_num": 3598, "question_slugs": ["get-maximum-in-generated-array", "minimum-deletions-to-make-character-frequencies-unique", "sell-diminishing-valued-colored-balls", "create-sorted-array-through-instructions"]}, {"contest_title": "\u7b2c 215 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 215", "contest_title_slug": "weekly-contest-215", "contest_id": 309, "contest_start_time": 1605407400, "contest_duration": 5400, "user_num": 4429, "question_slugs": ["design-an-ordered-stream", "determine-if-two-strings-are-close", "minimum-operations-to-reduce-x-to-zero", "maximize-grid-happiness"]}, {"contest_title": "\u7b2c 216 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 216", "contest_title_slug": "weekly-contest-216", "contest_id": 313, "contest_start_time": 1606012200, "contest_duration": 5400, "user_num": 3857, "question_slugs": ["check-if-two-string-arrays-are-equivalent", "smallest-string-with-a-given-numeric-value", "ways-to-make-a-fair-array", "minimum-initial-energy-to-finish-tasks"]}, {"contest_title": "\u7b2c 217 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 217", "contest_title_slug": "weekly-contest-217", "contest_id": 315, "contest_start_time": 1606617000, "contest_duration": 5400, "user_num": 3745, "question_slugs": ["richest-customer-wealth", "find-the-most-competitive-subsequence", "minimum-moves-to-make-array-complementary", "minimize-deviation-in-array"]}, {"contest_title": "\u7b2c 218 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 218", "contest_title_slug": "weekly-contest-218", "contest_id": 319, "contest_start_time": 1607221800, "contest_duration": 5400, "user_num": 3762, "question_slugs": ["goal-parser-interpretation", "max-number-of-k-sum-pairs", "concatenation-of-consecutive-binary-numbers", "minimum-incompatibility"]}, {"contest_title": "\u7b2c 219 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 219", "contest_title_slug": "weekly-contest-219", "contest_id": 322, "contest_start_time": 1607826600, "contest_duration": 5400, "user_num": 3710, "question_slugs": ["count-of-matches-in-tournament", "partitioning-into-minimum-number-of-deci-binary-numbers", "stone-game-vii", "maximum-height-by-stacking-cuboids"]}, {"contest_title": "\u7b2c 220 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 220", "contest_title_slug": "weekly-contest-220", "contest_id": 326, "contest_start_time": 1608431400, "contest_duration": 5400, "user_num": 3691, "question_slugs": ["reformat-phone-number", "maximum-erasure-value", "jump-game-vi", "checking-existence-of-edge-length-limited-paths"]}, {"contest_title": "\u7b2c 221 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 221", "contest_title_slug": "weekly-contest-221", "contest_id": 328, "contest_start_time": 1609036200, "contest_duration": 5400, "user_num": 3398, "question_slugs": ["determine-if-string-halves-are-alike", "maximum-number-of-eaten-apples", "where-will-the-ball-fall", "maximum-xor-with-an-element-from-array"]}, {"contest_title": "\u7b2c 222 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 222", "contest_title_slug": "weekly-contest-222", "contest_id": 332, "contest_start_time": 1609641000, "contest_duration": 5400, "user_num": 3119, "question_slugs": ["maximum-units-on-a-truck", "count-good-meals", "ways-to-split-array-into-three-subarrays", "minimum-operations-to-make-a-subsequence"]}, {"contest_title": "\u7b2c 223 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 223", "contest_title_slug": "weekly-contest-223", "contest_id": 334, "contest_start_time": 1610245800, "contest_duration": 5400, "user_num": 3872, "question_slugs": ["decode-xored-array", "swapping-nodes-in-a-linked-list", "minimize-hamming-distance-after-swap-operations", "find-minimum-time-to-finish-all-jobs"]}, {"contest_title": "\u7b2c 224 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 224", "contest_title_slug": "weekly-contest-224", "contest_id": 338, "contest_start_time": 1610850600, "contest_duration": 5400, "user_num": 3795, "question_slugs": ["number-of-rectangles-that-can-form-the-largest-square", "tuple-with-same-product", "largest-submatrix-with-rearrangements", "cat-and-mouse-ii"]}, {"contest_title": "\u7b2c 225 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 225", "contest_title_slug": "weekly-contest-225", "contest_id": 340, "contest_start_time": 1611455400, "contest_duration": 5400, "user_num": 3853, "question_slugs": ["latest-time-by-replacing-hidden-digits", "change-minimum-characters-to-satisfy-one-of-three-conditions", "find-kth-largest-xor-coordinate-value", "building-boxes"]}, {"contest_title": "\u7b2c 226 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 226", "contest_title_slug": "weekly-contest-226", "contest_id": 344, "contest_start_time": 1612060200, "contest_duration": 5400, "user_num": 4034, "question_slugs": ["maximum-number-of-balls-in-a-box", "restore-the-array-from-adjacent-pairs", "can-you-eat-your-favorite-candy-on-your-favorite-day", "palindrome-partitioning-iv"]}, {"contest_title": "\u7b2c 227 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 227", "contest_title_slug": "weekly-contest-227", "contest_id": 346, "contest_start_time": 1612665000, "contest_duration": 5400, "user_num": 3546, "question_slugs": ["check-if-array-is-sorted-and-rotated", "maximum-score-from-removing-stones", "largest-merge-of-two-strings", "closest-subsequence-sum"]}, {"contest_title": "\u7b2c 228 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 228", "contest_title_slug": "weekly-contest-228", "contest_id": 350, "contest_start_time": 1613269800, "contest_duration": 5400, "user_num": 2484, "question_slugs": ["minimum-changes-to-make-alternating-binary-string", "count-number-of-homogenous-substrings", "minimum-limit-of-balls-in-a-bag", "minimum-degree-of-a-connected-trio-in-a-graph"]}, {"contest_title": "\u7b2c 229 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 229", "contest_title_slug": "weekly-contest-229", "contest_id": 352, "contest_start_time": 1613874600, "contest_duration": 5400, "user_num": 3484, "question_slugs": ["merge-strings-alternately", "minimum-number-of-operations-to-move-all-balls-to-each-box", "maximum-score-from-performing-multiplication-operations", "maximize-palindrome-length-from-subsequences"]}, {"contest_title": "\u7b2c 230 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 230", "contest_title_slug": "weekly-contest-230", "contest_id": 356, "contest_start_time": 1614479400, "contest_duration": 5400, "user_num": 3728, "question_slugs": ["count-items-matching-a-rule", "closest-dessert-cost", "equal-sum-arrays-with-minimum-number-of-operations", "car-fleet-ii"]}, {"contest_title": "\u7b2c 231 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 231", "contest_title_slug": "weekly-contest-231", "contest_id": 358, "contest_start_time": 1615084200, "contest_duration": 5400, "user_num": 4668, "question_slugs": ["check-if-binary-string-has-at-most-one-segment-of-ones", "minimum-elements-to-add-to-form-a-given-sum", "number-of-restricted-paths-from-first-to-last-node", "make-the-xor-of-all-segments-equal-to-zero"]}, {"contest_title": "\u7b2c 232 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 232", "contest_title_slug": "weekly-contest-232", "contest_id": 363, "contest_start_time": 1615689000, "contest_duration": 5400, "user_num": 4802, "question_slugs": ["check-if-one-string-swap-can-make-strings-equal", "find-center-of-star-graph", "maximum-average-pass-ratio", "maximum-score-of-a-good-subarray"]}, {"contest_title": "\u7b2c 233 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 233", "contest_title_slug": "weekly-contest-233", "contest_id": 371, "contest_start_time": 1616293800, "contest_duration": 5400, "user_num": 5010, "question_slugs": ["maximum-ascending-subarray-sum", "number-of-orders-in-the-backlog", "maximum-value-at-a-given-index-in-a-bounded-array", "count-pairs-with-xor-in-a-range"]}, {"contest_title": "\u7b2c 234 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 234", "contest_title_slug": "weekly-contest-234", "contest_id": 375, "contest_start_time": 1616898600, "contest_duration": 5400, "user_num": 4998, "question_slugs": ["number-of-different-integers-in-a-string", "minimum-number-of-operations-to-reinitialize-a-permutation", "evaluate-the-bracket-pairs-of-a-string", "maximize-number-of-nice-divisors"]}, {"contest_title": "\u7b2c 235 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 235", "contest_title_slug": "weekly-contest-235", "contest_id": 377, "contest_start_time": 1617503400, "contest_duration": 5400, "user_num": 4494, "question_slugs": ["truncate-sentence", "finding-the-users-active-minutes", "minimum-absolute-sum-difference", "number-of-different-subsequences-gcds"]}, {"contest_title": "\u7b2c 236 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 236", "contest_title_slug": "weekly-contest-236", "contest_id": 391, "contest_start_time": 1618108200, "contest_duration": 5400, "user_num": 5113, "question_slugs": ["sign-of-the-product-of-an-array", "find-the-winner-of-the-circular-game", "minimum-sideway-jumps", "finding-mk-average"]}, {"contest_title": "\u7b2c 237 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 237", "contest_title_slug": "weekly-contest-237", "contest_id": 393, "contest_start_time": 1618713000, "contest_duration": 5400, "user_num": 4577, "question_slugs": ["check-if-the-sentence-is-pangram", "maximum-ice-cream-bars", "single-threaded-cpu", "find-xor-sum-of-all-pairs-bitwise-and"]}, {"contest_title": "\u7b2c 238 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 238", "contest_title_slug": "weekly-contest-238", "contest_id": 397, "contest_start_time": 1619317800, "contest_duration": 5400, "user_num": 3978, "question_slugs": ["sum-of-digits-in-base-k", "frequency-of-the-most-frequent-element", "longest-substring-of-all-vowels-in-order", "maximum-building-height"]}, {"contest_title": "\u7b2c 239 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 239", "contest_title_slug": "weekly-contest-239", "contest_id": 399, "contest_start_time": 1619922600, "contest_duration": 5400, "user_num": 3907, "question_slugs": ["minimum-distance-to-the-target-element", "splitting-a-string-into-descending-consecutive-values", "minimum-adjacent-swaps-to-reach-the-kth-smallest-number", "minimum-interval-to-include-each-query"]}, {"contest_title": "\u7b2c 240 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 240", "contest_title_slug": "weekly-contest-240", "contest_id": 403, "contest_start_time": 1620527400, "contest_duration": 5400, "user_num": 4307, "question_slugs": ["maximum-population-year", "maximum-distance-between-a-pair-of-values", "maximum-subarray-min-product", "largest-color-value-in-a-directed-graph"]}, {"contest_title": "\u7b2c 241 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 241", "contest_title_slug": "weekly-contest-241", "contest_id": 405, "contest_start_time": 1621132200, "contest_duration": 5400, "user_num": 4491, "question_slugs": ["sum-of-all-subset-xor-totals", "minimum-number-of-swaps-to-make-the-binary-string-alternating", "finding-pairs-with-a-certain-sum", "number-of-ways-to-rearrange-sticks-with-k-sticks-visible"]}, {"contest_title": "\u7b2c 242 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 242", "contest_title_slug": "weekly-contest-242", "contest_id": 409, "contest_start_time": 1621737000, "contest_duration": 5400, "user_num": 4306, "question_slugs": ["longer-contiguous-segments-of-ones-than-zeros", "minimum-speed-to-arrive-on-time", "jump-game-vii", "stone-game-viii"]}, {"contest_title": "\u7b2c 243 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 243", "contest_title_slug": "weekly-contest-243", "contest_id": 411, "contest_start_time": 1622341800, "contest_duration": 5400, "user_num": 4493, "question_slugs": ["check-if-word-equals-summation-of-two-words", "maximum-value-after-insertion", "process-tasks-using-servers", "minimum-skips-to-arrive-at-meeting-on-time"]}, {"contest_title": "\u7b2c 244 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 244", "contest_title_slug": "weekly-contest-244", "contest_id": 415, "contest_start_time": 1622946600, "contest_duration": 5400, "user_num": 4430, "question_slugs": ["determine-whether-matrix-can-be-obtained-by-rotation", "reduction-operations-to-make-the-array-elements-equal", "minimum-number-of-flips-to-make-the-binary-string-alternating", "minimum-space-wasted-from-packaging"]}, {"contest_title": "\u7b2c 245 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 245", "contest_title_slug": "weekly-contest-245", "contest_id": 417, "contest_start_time": 1623551400, "contest_duration": 5400, "user_num": 4271, "question_slugs": ["redistribute-characters-to-make-all-strings-equal", "maximum-number-of-removable-characters", "merge-triplets-to-form-target-triplet", "the-earliest-and-latest-rounds-where-players-compete"]}, {"contest_title": "\u7b2c 246 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 246", "contest_title_slug": "weekly-contest-246", "contest_id": 422, "contest_start_time": 1624156200, "contest_duration": 5400, "user_num": 4136, "question_slugs": ["largest-odd-number-in-string", "the-number-of-full-rounds-you-have-played", "count-sub-islands", "minimum-absolute-difference-queries"]}, {"contest_title": "\u7b2c 247 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 247", "contest_title_slug": "weekly-contest-247", "contest_id": 426, "contest_start_time": 1624761000, "contest_duration": 5400, "user_num": 3981, "question_slugs": ["maximum-product-difference-between-two-pairs", "cyclically-rotating-a-grid", "number-of-wonderful-substrings", "count-ways-to-build-rooms-in-an-ant-colony"]}, {"contest_title": "\u7b2c 248 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 248", "contest_title_slug": "weekly-contest-248", "contest_id": 430, "contest_start_time": 1625365800, "contest_duration": 5400, "user_num": 4451, "question_slugs": ["build-array-from-permutation", "eliminate-maximum-number-of-monsters", "count-good-numbers", "longest-common-subpath"]}, {"contest_title": "\u7b2c 249 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 249", "contest_title_slug": "weekly-contest-249", "contest_id": 432, "contest_start_time": 1625970600, "contest_duration": 5400, "user_num": 4335, "question_slugs": ["concatenation-of-array", "unique-length-3-palindromic-subsequences", "painting-a-grid-with-three-different-colors", "merge-bsts-to-create-single-bst"]}, {"contest_title": "\u7b2c 250 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 250", "contest_title_slug": "weekly-contest-250", "contest_id": 436, "contest_start_time": 1626575400, "contest_duration": 5400, "user_num": 4315, "question_slugs": ["maximum-number-of-words-you-can-type", "add-minimum-number-of-rungs", "maximum-number-of-points-with-cost", "maximum-genetic-difference-query"]}, {"contest_title": "\u7b2c 251 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 251", "contest_title_slug": "weekly-contest-251", "contest_id": 438, "contest_start_time": 1627180200, "contest_duration": 5400, "user_num": 4747, "question_slugs": ["sum-of-digits-of-string-after-convert", "largest-number-after-mutating-substring", "maximum-compatibility-score-sum", "delete-duplicate-folders-in-system"]}, {"contest_title": "\u7b2c 252 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 252", "contest_title_slug": "weekly-contest-252", "contest_id": 442, "contest_start_time": 1627785000, "contest_duration": 5400, "user_num": 4647, "question_slugs": ["three-divisors", "maximum-number-of-weeks-for-which-you-can-work", "minimum-garden-perimeter-to-collect-enough-apples", "count-number-of-special-subsequences"]}, {"contest_title": "\u7b2c 253 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 253", "contest_title_slug": "weekly-contest-253", "contest_id": 444, "contest_start_time": 1628389800, "contest_duration": 5400, "user_num": 4570, "question_slugs": ["check-if-string-is-a-prefix-of-array", "remove-stones-to-minimize-the-total", "minimum-number-of-swaps-to-make-the-string-balanced", "find-the-longest-valid-obstacle-course-at-each-position"]}, {"contest_title": "\u7b2c 254 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 254", "contest_title_slug": "weekly-contest-254", "contest_id": 449, "contest_start_time": 1628994600, "contest_duration": 5400, "user_num": 4349, "question_slugs": ["number-of-strings-that-appear-as-substrings-in-word", "array-with-elements-not-equal-to-average-of-neighbors", "minimum-non-zero-product-of-the-array-elements", "last-day-where-you-can-still-cross"]}, {"contest_title": "\u7b2c 255 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 255", "contest_title_slug": "weekly-contest-255", "contest_id": 457, "contest_start_time": 1629599400, "contest_duration": 5400, "user_num": 4333, "question_slugs": ["find-greatest-common-divisor-of-array", "find-unique-binary-string", "minimize-the-difference-between-target-and-chosen-elements", "find-array-given-subset-sums"]}, {"contest_title": "\u7b2c 256 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 256", "contest_title_slug": "weekly-contest-256", "contest_id": 462, "contest_start_time": 1630204200, "contest_duration": 5400, "user_num": 4136, "question_slugs": ["minimum-difference-between-highest-and-lowest-of-k-scores", "find-the-kth-largest-integer-in-the-array", "minimum-number-of-work-sessions-to-finish-the-tasks", "number-of-unique-good-subsequences"]}, {"contest_title": "\u7b2c 257 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 257", "contest_title_slug": "weekly-contest-257", "contest_id": 464, "contest_start_time": 1630809000, "contest_duration": 5400, "user_num": 4278, "question_slugs": ["count-special-quadruplets", "the-number-of-weak-characters-in-the-game", "first-day-where-you-have-been-in-all-the-rooms", "gcd-sort-of-an-array"]}, {"contest_title": "\u7b2c 258 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 258", "contest_title_slug": "weekly-contest-258", "contest_id": 468, "contest_start_time": 1631413800, "contest_duration": 5400, "user_num": 4519, "question_slugs": ["reverse-prefix-of-word", "number-of-pairs-of-interchangeable-rectangles", "maximum-product-of-the-length-of-two-palindromic-subsequences", "smallest-missing-genetic-value-in-each-subtree"]}, {"contest_title": "\u7b2c 259 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 259", "contest_title_slug": "weekly-contest-259", "contest_id": 474, "contest_start_time": 1632018600, "contest_duration": 5400, "user_num": 3775, "question_slugs": ["final-value-of-variable-after-performing-operations", "sum-of-beauty-in-the-array", "detect-squares", "longest-subsequence-repeated-k-times"]}, {"contest_title": "\u7b2c 260 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 260", "contest_title_slug": "weekly-contest-260", "contest_id": 478, "contest_start_time": 1632623400, "contest_duration": 5400, "user_num": 3654, "question_slugs": ["maximum-difference-between-increasing-elements", "grid-game", "check-if-word-can-be-placed-in-crossword", "the-score-of-students-solving-math-expression"]}, {"contest_title": "\u7b2c 261 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 261", "contest_title_slug": "weekly-contest-261", "contest_id": 481, "contest_start_time": 1633228200, "contest_duration": 5400, "user_num": 3368, "question_slugs": ["minimum-moves-to-convert-string", "find-missing-observations", "stone-game-ix", "smallest-k-length-subsequence-with-occurrences-of-a-letter"]}, {"contest_title": "\u7b2c 262 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 262", "contest_title_slug": "weekly-contest-262", "contest_id": 485, "contest_start_time": 1633833000, "contest_duration": 5400, "user_num": 4261, "question_slugs": ["two-out-of-three", "minimum-operations-to-make-a-uni-value-grid", "stock-price-fluctuation", "partition-array-into-two-arrays-to-minimize-sum-difference"]}, {"contest_title": "\u7b2c 263 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 263", "contest_title_slug": "weekly-contest-263", "contest_id": 487, "contest_start_time": 1634437800, "contest_duration": 5400, "user_num": 4572, "question_slugs": ["check-if-numbers-are-ascending-in-a-sentence", "simple-bank-system", "count-number-of-maximum-bitwise-or-subsets", "second-minimum-time-to-reach-destination"]}, {"contest_title": "\u7b2c 264 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 264", "contest_title_slug": "weekly-contest-264", "contest_id": 491, "contest_start_time": 1635042600, "contest_duration": 5400, "user_num": 4659, "question_slugs": ["number-of-valid-words-in-a-sentence", "next-greater-numerically-balanced-number", "count-nodes-with-the-highest-score", "parallel-courses-iii"]}, {"contest_title": "\u7b2c 265 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 265", "contest_title_slug": "weekly-contest-265", "contest_id": 493, "contest_start_time": 1635647400, "contest_duration": 5400, "user_num": 4182, "question_slugs": ["smallest-index-with-equal-value", "find-the-minimum-and-maximum-number-of-nodes-between-critical-points", "minimum-operations-to-convert-number", "check-if-an-original-string-exists-given-two-encoded-strings"]}, {"contest_title": "\u7b2c 266 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 266", "contest_title_slug": "weekly-contest-266", "contest_id": 498, "contest_start_time": 1636252200, "contest_duration": 5400, "user_num": 4385, "question_slugs": ["count-vowel-substrings-of-a-string", "vowels-of-all-substrings", "minimized-maximum-of-products-distributed-to-any-store", "maximum-path-quality-of-a-graph"]}, {"contest_title": "\u7b2c 267 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 267", "contest_title_slug": "weekly-contest-267", "contest_id": 500, "contest_start_time": 1636857000, "contest_duration": 5400, "user_num": 4365, "question_slugs": ["time-needed-to-buy-tickets", "reverse-nodes-in-even-length-groups", "decode-the-slanted-ciphertext", "process-restricted-friend-requests"]}, {"contest_title": "\u7b2c 268 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 268", "contest_title_slug": "weekly-contest-268", "contest_id": 504, "contest_start_time": 1637461800, "contest_duration": 5400, "user_num": 4398, "question_slugs": ["two-furthest-houses-with-different-colors", "watering-plants", "range-frequency-queries", "sum-of-k-mirror-numbers"]}, {"contest_title": "\u7b2c 269 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 269", "contest_title_slug": "weekly-contest-269", "contest_id": 506, "contest_start_time": 1638066600, "contest_duration": 5400, "user_num": 4293, "question_slugs": ["find-target-indices-after-sorting-array", "k-radius-subarray-averages", "removing-minimum-and-maximum-from-array", "find-all-people-with-secret"]}, {"contest_title": "\u7b2c 270 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 270", "contest_title_slug": "weekly-contest-270", "contest_id": 510, "contest_start_time": 1638671400, "contest_duration": 5400, "user_num": 4748, "question_slugs": ["finding-3-digit-even-numbers", "delete-the-middle-node-of-a-linked-list", "step-by-step-directions-from-a-binary-tree-node-to-another", "valid-arrangement-of-pairs"]}, {"contest_title": "\u7b2c 271 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 271", "contest_title_slug": "weekly-contest-271", "contest_id": 512, "contest_start_time": 1639276200, "contest_duration": 5400, "user_num": 4562, "question_slugs": ["rings-and-rods", "sum-of-subarray-ranges", "watering-plants-ii", "maximum-fruits-harvested-after-at-most-k-steps"]}, {"contest_title": "\u7b2c 272 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 272", "contest_title_slug": "weekly-contest-272", "contest_id": 516, "contest_start_time": 1639881000, "contest_duration": 5400, "user_num": 4698, "question_slugs": ["find-first-palindromic-string-in-the-array", "adding-spaces-to-a-string", "number-of-smooth-descent-periods-of-a-stock", "minimum-operations-to-make-the-array-k-increasing"]}, {"contest_title": "\u7b2c 273 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 273", "contest_title_slug": "weekly-contest-273", "contest_id": 518, "contest_start_time": 1640485800, "contest_duration": 5400, "user_num": 4368, "question_slugs": ["a-number-after-a-double-reversal", "execution-of-all-suffix-instructions-staying-in-a-grid", "intervals-between-identical-elements", "recover-the-original-array"]}, {"contest_title": "\u7b2c 274 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 274", "contest_title_slug": "weekly-contest-274", "contest_id": 522, "contest_start_time": 1641090600, "contest_duration": 5400, "user_num": 4109, "question_slugs": ["check-if-all-as-appears-before-all-bs", "number-of-laser-beams-in-a-bank", "destroying-asteroids", "maximum-employees-to-be-invited-to-a-meeting"]}, {"contest_title": "\u7b2c 275 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 275", "contest_title_slug": "weekly-contest-275", "contest_id": 524, "contest_start_time": 1641695400, "contest_duration": 5400, "user_num": 4787, "question_slugs": ["check-if-every-row-and-column-contains-all-numbers", "minimum-swaps-to-group-all-1s-together-ii", "count-words-obtained-after-adding-a-letter", "earliest-possible-day-of-full-bloom"]}, {"contest_title": "\u7b2c 276 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 276", "contest_title_slug": "weekly-contest-276", "contest_id": 528, "contest_start_time": 1642300200, "contest_duration": 5400, "user_num": 5244, "question_slugs": ["divide-a-string-into-groups-of-size-k", "minimum-moves-to-reach-target-score", "solving-questions-with-brainpower", "maximum-running-time-of-n-computers"]}, {"contest_title": "\u7b2c 277 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 277", "contest_title_slug": "weekly-contest-277", "contest_id": 530, "contest_start_time": 1642905000, "contest_duration": 5400, "user_num": 5060, "question_slugs": ["count-elements-with-strictly-smaller-and-greater-elements", "rearrange-array-elements-by-sign", "find-all-lonely-numbers-in-the-array", "maximum-good-people-based-on-statements"]}, {"contest_title": "\u7b2c 278 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 278", "contest_title_slug": "weekly-contest-278", "contest_id": 534, "contest_start_time": 1643509800, "contest_duration": 5400, "user_num": 4643, "question_slugs": ["keep-multiplying-found-values-by-two", "all-divisions-with-the-highest-score-of-a-binary-array", "find-substring-with-given-hash-value", "groups-of-strings"]}, {"contest_title": "\u7b2c 279 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 279", "contest_title_slug": "weekly-contest-279", "contest_id": 536, "contest_start_time": 1644114600, "contest_duration": 5400, "user_num": 4132, "question_slugs": ["sort-even-and-odd-indices-independently", "smallest-value-of-the-rearranged-number", "design-bitset", "minimum-time-to-remove-all-cars-containing-illegal-goods"]}, {"contest_title": "\u7b2c 280 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 280", "contest_title_slug": "weekly-contest-280", "contest_id": 540, "contest_start_time": 1644719400, "contest_duration": 5400, "user_num": 5834, "question_slugs": ["count-operations-to-obtain-zero", "minimum-operations-to-make-the-array-alternating", "removing-minimum-number-of-magic-beans", "maximum-and-sum-of-array"]}, {"contest_title": "\u7b2c 281 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 281", "contest_title_slug": "weekly-contest-281", "contest_id": 542, "contest_start_time": 1645324200, "contest_duration": 6000, "user_num": 6005, "question_slugs": ["count-integers-with-even-digit-sum", "merge-nodes-in-between-zeros", "construct-string-with-repeat-limit", "count-array-pairs-divisible-by-k"]}, {"contest_title": "\u7b2c 282 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 282", "contest_title_slug": "weekly-contest-282", "contest_id": 546, "contest_start_time": 1645929000, "contest_duration": 5400, "user_num": 7164, "question_slugs": ["counting-words-with-a-given-prefix", "minimum-number-of-steps-to-make-two-strings-anagram-ii", "minimum-time-to-complete-trips", "minimum-time-to-finish-the-race"]}, {"contest_title": "\u7b2c 283 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 283", "contest_title_slug": "weekly-contest-283", "contest_id": 551, "contest_start_time": 1646533800, "contest_duration": 5400, "user_num": 7817, "question_slugs": ["cells-in-a-range-on-an-excel-sheet", "append-k-integers-with-minimal-sum", "create-binary-tree-from-descriptions", "replace-non-coprime-numbers-in-array"]}, {"contest_title": "\u7b2c 284 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 284", "contest_title_slug": "weekly-contest-284", "contest_id": 555, "contest_start_time": 1647138600, "contest_duration": 5400, "user_num": 8483, "question_slugs": ["find-all-k-distant-indices-in-an-array", "count-artifacts-that-can-be-extracted", "maximize-the-topmost-element-after-k-moves", "minimum-weighted-subgraph-with-the-required-paths"]}, {"contest_title": "\u7b2c 285 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 285", "contest_title_slug": "weekly-contest-285", "contest_id": 558, "contest_start_time": 1647743400, "contest_duration": 5400, "user_num": 7501, "question_slugs": ["count-hills-and-valleys-in-an-array", "count-collisions-on-a-road", "maximum-points-in-an-archery-competition", "longest-substring-of-one-repeating-character"]}, {"contest_title": "\u7b2c 286 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 286", "contest_title_slug": "weekly-contest-286", "contest_id": 564, "contest_start_time": 1648348200, "contest_duration": 5400, "user_num": 7248, "question_slugs": ["find-the-difference-of-two-arrays", "minimum-deletions-to-make-array-beautiful", "find-palindrome-with-fixed-length", "maximum-value-of-k-coins-from-piles"]}, {"contest_title": "\u7b2c 287 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 287", "contest_title_slug": "weekly-contest-287", "contest_id": 569, "contest_start_time": 1648953000, "contest_duration": 5400, "user_num": 6811, "question_slugs": ["minimum-number-of-operations-to-convert-time", "find-players-with-zero-or-one-losses", "maximum-candies-allocated-to-k-children", "encrypt-and-decrypt-strings"]}, {"contest_title": "\u7b2c 288 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 288", "contest_title_slug": "weekly-contest-288", "contest_id": 573, "contest_start_time": 1649557800, "contest_duration": 5400, "user_num": 6926, "question_slugs": ["largest-number-after-digit-swaps-by-parity", "minimize-result-by-adding-parentheses-to-expression", "maximum-product-after-k-increments", "maximum-total-beauty-of-the-gardens"]}, {"contest_title": "\u7b2c 289 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 289", "contest_title_slug": "weekly-contest-289", "contest_id": 576, "contest_start_time": 1650162600, "contest_duration": 5400, "user_num": 7293, "question_slugs": ["calculate-digit-sum-of-a-string", "minimum-rounds-to-complete-all-tasks", "maximum-trailing-zeros-in-a-cornered-path", "longest-path-with-different-adjacent-characters"]}, {"contest_title": "\u7b2c 290 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 290", "contest_title_slug": "weekly-contest-290", "contest_id": 582, "contest_start_time": 1650767400, "contest_duration": 5400, "user_num": 6275, "question_slugs": ["intersection-of-multiple-arrays", "count-lattice-points-inside-a-circle", "count-number-of-rectangles-containing-each-point", "number-of-flowers-in-full-bloom"]}, {"contest_title": "\u7b2c 291 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 291", "contest_title_slug": "weekly-contest-291", "contest_id": 587, "contest_start_time": 1651372200, "contest_duration": 5400, "user_num": 6574, "question_slugs": ["remove-digit-from-number-to-maximize-result", "minimum-consecutive-cards-to-pick-up", "k-divisible-elements-subarrays", "total-appeal-of-a-string"]}, {"contest_title": "\u7b2c 292 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 292", "contest_title_slug": "weekly-contest-292", "contest_id": 591, "contest_start_time": 1651977000, "contest_duration": 5400, "user_num": 6884, "question_slugs": ["largest-3-same-digit-number-in-string", "count-nodes-equal-to-average-of-subtree", "count-number-of-texts", "check-if-there-is-a-valid-parentheses-string-path"]}, {"contest_title": "\u7b2c 293 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 293", "contest_title_slug": "weekly-contest-293", "contest_id": 593, "contest_start_time": 1652581800, "contest_duration": 5400, "user_num": 7357, "question_slugs": ["find-resultant-array-after-removing-anagrams", "maximum-consecutive-floors-without-special-floors", "largest-combination-with-bitwise-and-greater-than-zero", "count-integers-in-intervals"]}, {"contest_title": "\u7b2c 294 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 294", "contest_title_slug": "weekly-contest-294", "contest_id": 599, "contest_start_time": 1653186600, "contest_duration": 5400, "user_num": 6640, "question_slugs": ["percentage-of-letter-in-string", "maximum-bags-with-full-capacity-of-rocks", "minimum-lines-to-represent-a-line-chart", "sum-of-total-strength-of-wizards"]}, {"contest_title": "\u7b2c 295 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 295", "contest_title_slug": "weekly-contest-295", "contest_id": 605, "contest_start_time": 1653791400, "contest_duration": 5400, "user_num": 6447, "question_slugs": ["rearrange-characters-to-make-target-string", "apply-discount-to-prices", "steps-to-make-array-non-decreasing", "minimum-obstacle-removal-to-reach-corner"]}, {"contest_title": "\u7b2c 296 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 296", "contest_title_slug": "weekly-contest-296", "contest_id": 609, "contest_start_time": 1654396200, "contest_duration": 5400, "user_num": 5721, "question_slugs": ["min-max-game", "partition-array-such-that-maximum-difference-is-k", "replace-elements-in-an-array", "design-a-text-editor"]}, {"contest_title": "\u7b2c 297 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 297", "contest_title_slug": "weekly-contest-297", "contest_id": 611, "contest_start_time": 1655001000, "contest_duration": 5400, "user_num": 5915, "question_slugs": ["calculate-amount-paid-in-taxes", "minimum-path-cost-in-a-grid", "fair-distribution-of-cookies", "naming-a-company"]}, {"contest_title": "\u7b2c 298 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 298", "contest_title_slug": "weekly-contest-298", "contest_id": 615, "contest_start_time": 1655605800, "contest_duration": 5400, "user_num": 6228, "question_slugs": ["greatest-english-letter-in-upper-and-lower-case", "sum-of-numbers-with-units-digit-k", "longest-binary-subsequence-less-than-or-equal-to-k", "selling-pieces-of-wood"]}, {"contest_title": "\u7b2c 299 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 299", "contest_title_slug": "weekly-contest-299", "contest_id": 618, "contest_start_time": 1656210600, "contest_duration": 5400, "user_num": 6108, "question_slugs": ["check-if-matrix-is-x-matrix", "count-number-of-ways-to-place-houses", "maximum-score-of-spliced-array", "minimum-score-after-removals-on-a-tree"]}, {"contest_title": "\u7b2c 300 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 300", "contest_title_slug": "weekly-contest-300", "contest_id": 647, "contest_start_time": 1656815400, "contest_duration": 5400, "user_num": 6792, "question_slugs": ["decode-the-message", "spiral-matrix-iv", "number-of-people-aware-of-a-secret", "number-of-increasing-paths-in-a-grid"]}, {"contest_title": "\u7b2c 301 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 301", "contest_title_slug": "weekly-contest-301", "contest_id": 649, "contest_start_time": 1657420200, "contest_duration": 5400, "user_num": 7133, "question_slugs": ["minimum-amount-of-time-to-fill-cups", "smallest-number-in-infinite-set", "move-pieces-to-obtain-a-string", "count-the-number-of-ideal-arrays"]}, {"contest_title": "\u7b2c 302 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 302", "contest_title_slug": "weekly-contest-302", "contest_id": 653, "contest_start_time": 1658025000, "contest_duration": 5400, "user_num": 7092, "question_slugs": ["maximum-number-of-pairs-in-array", "max-sum-of-a-pair-with-equal-sum-of-digits", "query-kth-smallest-trimmed-number", "minimum-deletions-to-make-array-divisible"]}, {"contest_title": "\u7b2c 303 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 303", "contest_title_slug": "weekly-contest-303", "contest_id": 655, "contest_start_time": 1658629800, "contest_duration": 5400, "user_num": 7032, "question_slugs": ["first-letter-to-appear-twice", "equal-row-and-column-pairs", "design-a-food-rating-system", "number-of-excellent-pairs"]}, {"contest_title": "\u7b2c 304 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 304", "contest_title_slug": "weekly-contest-304", "contest_id": 659, "contest_start_time": 1659234600, "contest_duration": 5400, "user_num": 7372, "question_slugs": ["make-array-zero-by-subtracting-equal-amounts", "maximum-number-of-groups-entering-a-competition", "find-closest-node-to-given-two-nodes", "longest-cycle-in-a-graph"]}, {"contest_title": "\u7b2c 305 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 305", "contest_title_slug": "weekly-contest-305", "contest_id": 663, "contest_start_time": 1659839400, "contest_duration": 5400, "user_num": 7465, "question_slugs": ["number-of-arithmetic-triplets", "reachable-nodes-with-restrictions", "check-if-there-is-a-valid-partition-for-the-array", "longest-ideal-subsequence"]}, {"contest_title": "\u7b2c 306 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 306", "contest_title_slug": "weekly-contest-306", "contest_id": 669, "contest_start_time": 1660444200, "contest_duration": 5400, "user_num": 7500, "question_slugs": ["largest-local-values-in-a-matrix", "node-with-highest-edge-score", "construct-smallest-number-from-di-string", "count-special-integers"]}, {"contest_title": "\u7b2c 307 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 307", "contest_title_slug": "weekly-contest-307", "contest_id": 671, "contest_start_time": 1661049000, "contest_duration": 5400, "user_num": 7064, "question_slugs": ["minimum-hours-of-training-to-win-a-competition", "largest-palindromic-number", "amount-of-time-for-binary-tree-to-be-infected", "find-the-k-sum-of-an-array"]}, {"contest_title": "\u7b2c 308 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 308", "contest_title_slug": "weekly-contest-308", "contest_id": 689, "contest_start_time": 1661653800, "contest_duration": 5400, "user_num": 6394, "question_slugs": ["longest-subsequence-with-limited-sum", "removing-stars-from-a-string", "minimum-amount-of-time-to-collect-garbage", "build-a-matrix-with-conditions"]}, {"contest_title": "\u7b2c 309 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 309", "contest_title_slug": "weekly-contest-309", "contest_id": 693, "contest_start_time": 1662258600, "contest_duration": 5400, "user_num": 7972, "question_slugs": ["check-distances-between-same-letters", "number-of-ways-to-reach-a-position-after-exactly-k-steps", "longest-nice-subarray", "meeting-rooms-iii"]}, {"contest_title": "\u7b2c 310 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 310", "contest_title_slug": "weekly-contest-310", "contest_id": 704, "contest_start_time": 1662863400, "contest_duration": 5400, "user_num": 6081, "question_slugs": ["most-frequent-even-element", "optimal-partition-of-string", "divide-intervals-into-minimum-number-of-groups", "longest-increasing-subsequence-ii"]}, {"contest_title": "\u7b2c 311 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 311", "contest_title_slug": "weekly-contest-311", "contest_id": 741, "contest_start_time": 1663468200, "contest_duration": 5400, "user_num": 6710, "question_slugs": ["smallest-even-multiple", "length-of-the-longest-alphabetical-continuous-substring", "reverse-odd-levels-of-binary-tree", "sum-of-prefix-scores-of-strings"]}, {"contest_title": "\u7b2c 312 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 312", "contest_title_slug": "weekly-contest-312", "contest_id": 746, "contest_start_time": 1664073000, "contest_duration": 5400, "user_num": 6638, "question_slugs": ["sort-the-people", "longest-subarray-with-maximum-bitwise-and", "find-all-good-indices", "number-of-good-paths"]}, {"contest_title": "\u7b2c 313 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 313", "contest_title_slug": "weekly-contest-313", "contest_id": 750, "contest_start_time": 1664677800, "contest_duration": 5400, "user_num": 5445, "question_slugs": ["number-of-common-factors", "maximum-sum-of-an-hourglass", "minimize-xor", "maximum-deletions-on-a-string"]}, {"contest_title": "\u7b2c 314 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 314", "contest_title_slug": "weekly-contest-314", "contest_id": 756, "contest_start_time": 1665282600, "contest_duration": 5400, "user_num": 4838, "question_slugs": ["the-employee-that-worked-on-the-longest-task", "find-the-original-array-of-prefix-xor", "using-a-robot-to-print-the-lexicographically-smallest-string", "paths-in-matrix-whose-sum-is-divisible-by-k"]}, {"contest_title": "\u7b2c 315 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 315", "contest_title_slug": "weekly-contest-315", "contest_id": 759, "contest_start_time": 1665887400, "contest_duration": 5400, "user_num": 6490, "question_slugs": ["largest-positive-integer-that-exists-with-its-negative", "count-number-of-distinct-integers-after-reverse-operations", "sum-of-number-and-its-reverse", "count-subarrays-with-fixed-bounds"]}, {"contest_title": "\u7b2c 316 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 316", "contest_title_slug": "weekly-contest-316", "contest_id": 764, "contest_start_time": 1666492200, "contest_duration": 5400, "user_num": 6387, "question_slugs": ["determine-if-two-events-have-conflict", "number-of-subarrays-with-gcd-equal-to-k", "minimum-cost-to-make-array-equal", "minimum-number-of-operations-to-make-arrays-similar"]}, {"contest_title": "\u7b2c 317 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 317", "contest_title_slug": "weekly-contest-317", "contest_id": 767, "contest_start_time": 1667097000, "contest_duration": 5400, "user_num": 5660, "question_slugs": ["average-value-of-even-numbers-that-are-divisible-by-three", "most-popular-video-creator", "minimum-addition-to-make-integer-beautiful", "height-of-binary-tree-after-subtree-removal-queries"]}, {"contest_title": "\u7b2c 318 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 318", "contest_title_slug": "weekly-contest-318", "contest_id": 771, "contest_start_time": 1667701800, "contest_duration": 5400, "user_num": 5670, "question_slugs": ["apply-operations-to-an-array", "maximum-sum-of-distinct-subarrays-with-length-k", "total-cost-to-hire-k-workers", "minimum-total-distance-traveled"]}, {"contest_title": "\u7b2c 319 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 319", "contest_title_slug": "weekly-contest-319", "contest_id": 773, "contest_start_time": 1668306600, "contest_duration": 5400, "user_num": 6175, "question_slugs": ["convert-the-temperature", "number-of-subarrays-with-lcm-equal-to-k", "minimum-number-of-operations-to-sort-a-binary-tree-by-level", "maximum-number-of-non-overlapping-palindrome-substrings"]}, {"contest_title": "\u7b2c 320 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 320", "contest_title_slug": "weekly-contest-320", "contest_id": 777, "contest_start_time": 1668911400, "contest_duration": 5400, "user_num": 5678, "question_slugs": ["number-of-unequal-triplets-in-array", "closest-nodes-queries-in-a-binary-search-tree", "minimum-fuel-cost-to-report-to-the-capital", "number-of-beautiful-partitions"]}, {"contest_title": "\u7b2c 321 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 321", "contest_title_slug": "weekly-contest-321", "contest_id": 779, "contest_start_time": 1669516200, "contest_duration": 5400, "user_num": 5115, "question_slugs": ["find-the-pivot-integer", "append-characters-to-string-to-make-subsequence", "remove-nodes-from-linked-list", "count-subarrays-with-median-k"]}, {"contest_title": "\u7b2c 322 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 322", "contest_title_slug": "weekly-contest-322", "contest_id": 783, "contest_start_time": 1670121000, "contest_duration": 5400, "user_num": 5085, "question_slugs": ["circular-sentence", "divide-players-into-teams-of-equal-skill", "minimum-score-of-a-path-between-two-cities", "divide-nodes-into-the-maximum-number-of-groups"]}, {"contest_title": "\u7b2c 323 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 323", "contest_title_slug": "weekly-contest-323", "contest_id": 785, "contest_start_time": 1670725800, "contest_duration": 5400, "user_num": 4671, "question_slugs": ["delete-greatest-value-in-each-row", "longest-square-streak-in-an-array", "design-memory-allocator", "maximum-number-of-points-from-grid-queries"]}, {"contest_title": "\u7b2c 324 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 324", "contest_title_slug": "weekly-contest-324", "contest_id": 790, "contest_start_time": 1671330600, "contest_duration": 5400, "user_num": 4167, "question_slugs": ["count-pairs-of-similar-strings", "smallest-value-after-replacing-with-sum-of-prime-factors", "add-edges-to-make-degrees-of-all-nodes-even", "cycle-length-queries-in-a-tree"]}, {"contest_title": "\u7b2c 325 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 325", "contest_title_slug": "weekly-contest-325", "contest_id": 795, "contest_start_time": 1671935400, "contest_duration": 5400, "user_num": 3530, "question_slugs": ["shortest-distance-to-target-string-in-a-circular-array", "take-k-of-each-character-from-left-and-right", "maximum-tastiness-of-candy-basket", "number-of-great-partitions"]}, {"contest_title": "\u7b2c 326 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 326", "contest_title_slug": "weekly-contest-326", "contest_id": 799, "contest_start_time": 1672540200, "contest_duration": 5400, "user_num": 3873, "question_slugs": ["count-the-digits-that-divide-a-number", "distinct-prime-factors-of-product-of-array", "partition-string-into-substrings-with-values-at-most-k", "closest-prime-numbers-in-range"]}, {"contest_title": "\u7b2c 327 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 327", "contest_title_slug": "weekly-contest-327", "contest_id": 801, "contest_start_time": 1673145000, "contest_duration": 5400, "user_num": 4518, "question_slugs": ["maximum-count-of-positive-integer-and-negative-integer", "maximal-score-after-applying-k-operations", "make-number-of-distinct-characters-equal", "time-to-cross-a-bridge"]}, {"contest_title": "\u7b2c 328 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 328", "contest_title_slug": "weekly-contest-328", "contest_id": 805, "contest_start_time": 1673749800, "contest_duration": 5400, "user_num": 4776, "question_slugs": ["difference-between-element-sum-and-digit-sum-of-an-array", "increment-submatrices-by-one", "count-the-number-of-good-subarrays", "difference-between-maximum-and-minimum-price-sum"]}, {"contest_title": "\u7b2c 329 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 329", "contest_title_slug": "weekly-contest-329", "contest_id": 807, "contest_start_time": 1674354600, "contest_duration": 5400, "user_num": 2591, "question_slugs": ["alternating-digit-sum", "sort-the-students-by-their-kth-score", "apply-bitwise-operations-to-make-strings-equal", "minimum-cost-to-split-an-array"]}, {"contest_title": "\u7b2c 330 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 330", "contest_title_slug": "weekly-contest-330", "contest_id": 811, "contest_start_time": 1674959400, "contest_duration": 5400, "user_num": 3399, "question_slugs": ["count-distinct-numbers-on-board", "count-collisions-of-monkeys-on-a-polygon", "put-marbles-in-bags", "count-increasing-quadruplets"]}, {"contest_title": "\u7b2c 331 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 331", "contest_title_slug": "weekly-contest-331", "contest_id": 813, "contest_start_time": 1675564200, "contest_duration": 5400, "user_num": 4256, "question_slugs": ["take-gifts-from-the-richest-pile", "count-vowel-strings-in-ranges", "house-robber-iv", "rearranging-fruits"]}, {"contest_title": "\u7b2c 332 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 332", "contest_title_slug": "weekly-contest-332", "contest_id": 817, "contest_start_time": 1676169000, "contest_duration": 5400, "user_num": 4547, "question_slugs": ["find-the-array-concatenation-value", "count-the-number-of-fair-pairs", "substring-xor-queries", "subsequence-with-the-minimum-score"]}, {"contest_title": "\u7b2c 333 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 333", "contest_title_slug": "weekly-contest-333", "contest_id": 819, "contest_start_time": 1676773800, "contest_duration": 5400, "user_num": 4969, "question_slugs": ["merge-two-2d-arrays-by-summing-values", "minimum-operations-to-reduce-an-integer-to-0", "count-the-number-of-square-free-subsets", "find-the-string-with-lcp"]}, {"contest_title": "\u7b2c 334 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 334", "contest_title_slug": "weekly-contest-334", "contest_id": 823, "contest_start_time": 1677378600, "contest_duration": 5400, "user_num": 5501, "question_slugs": ["left-and-right-sum-differences", "find-the-divisibility-array-of-a-string", "find-the-maximum-number-of-marked-indices", "minimum-time-to-visit-a-cell-in-a-grid"]}, {"contest_title": "\u7b2c 335 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 335", "contest_title_slug": "weekly-contest-335", "contest_id": 825, "contest_start_time": 1677983400, "contest_duration": 5400, "user_num": 6019, "question_slugs": ["pass-the-pillow", "kth-largest-sum-in-a-binary-tree", "split-the-array-to-make-coprime-products", "number-of-ways-to-earn-points"]}, {"contest_title": "\u7b2c 336 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 336", "contest_title_slug": "weekly-contest-336", "contest_id": 833, "contest_start_time": 1678588200, "contest_duration": 5400, "user_num": 5897, "question_slugs": ["count-the-number-of-vowel-strings-in-range", "rearrange-array-to-maximize-prefix-score", "count-the-number-of-beautiful-subarrays", "minimum-time-to-complete-all-tasks"]}, {"contest_title": "\u7b2c 337 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 337", "contest_title_slug": "weekly-contest-337", "contest_id": 839, "contest_start_time": 1679193000, "contest_duration": 5400, "user_num": 5628, "question_slugs": ["number-of-even-and-odd-bits", "check-knight-tour-configuration", "the-number-of-beautiful-subsets", "smallest-missing-non-negative-integer-after-operations"]}, {"contest_title": "\u7b2c 338 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 338", "contest_title_slug": "weekly-contest-338", "contest_id": 843, "contest_start_time": 1679797800, "contest_duration": 5400, "user_num": 5594, "question_slugs": ["k-items-with-the-maximum-sum", "prime-subtraction-operation", "minimum-operations-to-make-all-array-elements-equal", "collect-coins-in-a-tree"]}, {"contest_title": "\u7b2c 339 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 339", "contest_title_slug": "weekly-contest-339", "contest_id": 850, "contest_start_time": 1680402600, "contest_duration": 5400, "user_num": 5180, "question_slugs": ["find-the-longest-balanced-substring-of-a-binary-string", "convert-an-array-into-a-2d-array-with-conditions", "mice-and-cheese", "minimum-reverse-operations"]}, {"contest_title": "\u7b2c 340 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 340", "contest_title_slug": "weekly-contest-340", "contest_id": 854, "contest_start_time": 1681007400, "contest_duration": 5400, "user_num": 4937, "question_slugs": ["prime-in-diagonal", "sum-of-distances", "minimize-the-maximum-difference-of-pairs", "minimum-number-of-visited-cells-in-a-grid"]}, {"contest_title": "\u7b2c 341 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 341", "contest_title_slug": "weekly-contest-341", "contest_id": 856, "contest_start_time": 1681612200, "contest_duration": 5400, "user_num": 4792, "question_slugs": ["row-with-maximum-ones", "find-the-maximum-divisibility-score", "minimum-additions-to-make-valid-string", "minimize-the-total-price-of-the-trips"]}, {"contest_title": "\u7b2c 342 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 342", "contest_title_slug": "weekly-contest-342", "contest_id": 860, "contest_start_time": 1682217000, "contest_duration": 5400, "user_num": 3702, "question_slugs": ["calculate-delayed-arrival-time", "sum-multiples", "sliding-subarray-beauty", "minimum-number-of-operations-to-make-all-array-elements-equal-to-1"]}, {"contest_title": "\u7b2c 343 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 343", "contest_title_slug": "weekly-contest-343", "contest_id": 863, "contest_start_time": 1682821800, "contest_duration": 5400, "user_num": 3313, "question_slugs": ["determine-the-winner-of-a-bowling-game", "first-completely-painted-row-or-column", "minimum-cost-of-a-path-with-special-roads", "lexicographically-smallest-beautiful-string"]}, {"contest_title": "\u7b2c 344 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 344", "contest_title_slug": "weekly-contest-344", "contest_id": 867, "contest_start_time": 1683426600, "contest_duration": 5400, "user_num": 3986, "question_slugs": ["find-the-distinct-difference-array", "frequency-tracker", "number-of-adjacent-elements-with-the-same-color", "make-costs-of-paths-equal-in-a-binary-tree"]}, {"contest_title": "\u7b2c 345 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 345", "contest_title_slug": "weekly-contest-345", "contest_id": 870, "contest_start_time": 1684031400, "contest_duration": 5400, "user_num": 4165, "question_slugs": ["find-the-losers-of-the-circular-game", "neighboring-bitwise-xor", "maximum-number-of-moves-in-a-grid", "count-the-number-of-complete-components"]}, {"contest_title": "\u7b2c 346 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 346", "contest_title_slug": "weekly-contest-346", "contest_id": 874, "contest_start_time": 1684636200, "contest_duration": 5400, "user_num": 4035, "question_slugs": ["minimum-string-length-after-removing-substrings", "lexicographically-smallest-palindrome", "find-the-punishment-number-of-an-integer", "modify-graph-edge-weights"]}, {"contest_title": "\u7b2c 347 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 347", "contest_title_slug": "weekly-contest-347", "contest_id": 876, "contest_start_time": 1685241000, "contest_duration": 5400, "user_num": 3836, "question_slugs": ["remove-trailing-zeros-from-a-string", "difference-of-number-of-distinct-values-on-diagonals", "minimum-cost-to-make-all-characters-equal", "maximum-strictly-increasing-cells-in-a-matrix"]}, {"contest_title": "\u7b2c 348 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 348", "contest_title_slug": "weekly-contest-348", "contest_id": 880, "contest_start_time": 1685845800, "contest_duration": 5400, "user_num": 3909, "question_slugs": ["minimize-string-length", "semi-ordered-permutation", "sum-of-matrix-after-queries", "count-of-integers"]}, {"contest_title": "\u7b2c 349 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 349", "contest_title_slug": "weekly-contest-349", "contest_id": 882, "contest_start_time": 1686450600, "contest_duration": 5400, "user_num": 3714, "question_slugs": ["neither-minimum-nor-maximum", "lexicographically-smallest-string-after-substring-operation", "collecting-chocolates", "maximum-sum-queries"]}, {"contest_title": "\u7b2c 350 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 350", "contest_title_slug": "weekly-contest-350", "contest_id": 886, "contest_start_time": 1687055400, "contest_duration": 5400, "user_num": 3580, "question_slugs": ["total-distance-traveled", "find-the-value-of-the-partition", "special-permutations", "painting-the-walls"]}, {"contest_title": "\u7b2c 351 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 351", "contest_title_slug": "weekly-contest-351", "contest_id": 888, "contest_start_time": 1687660200, "contest_duration": 5400, "user_num": 2471, "question_slugs": ["number-of-beautiful-pairs", "minimum-operations-to-make-the-integer-zero", "ways-to-split-array-into-good-subarrays", "robot-collisions"]}, {"contest_title": "\u7b2c 352 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 352", "contest_title_slug": "weekly-contest-352", "contest_id": 892, "contest_start_time": 1688265000, "contest_duration": 5400, "user_num": 3437, "question_slugs": ["longest-even-odd-subarray-with-threshold", "prime-pairs-with-target-sum", "continuous-subarrays", "sum-of-imbalance-numbers-of-all-subarrays"]}, {"contest_title": "\u7b2c 353 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 353", "contest_title_slug": "weekly-contest-353", "contest_id": 894, "contest_start_time": 1688869800, "contest_duration": 5400, "user_num": 4113, "question_slugs": ["find-the-maximum-achievable-number", "maximum-number-of-jumps-to-reach-the-last-index", "longest-non-decreasing-subarray-from-two-arrays", "apply-operations-to-make-all-array-elements-equal-to-zero"]}, {"contest_title": "\u7b2c 354 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 354", "contest_title_slug": "weekly-contest-354", "contest_id": 898, "contest_start_time": 1689474600, "contest_duration": 5400, "user_num": 3957, "question_slugs": ["sum-of-squares-of-special-elements", "maximum-beauty-of-an-array-after-applying-operation", "minimum-index-of-a-valid-split", "length-of-the-longest-valid-substring"]}, {"contest_title": "\u7b2c 355 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 355", "contest_title_slug": "weekly-contest-355", "contest_id": 900, "contest_start_time": 1690079400, "contest_duration": 5400, "user_num": 4112, "question_slugs": ["split-strings-by-separator", "largest-element-in-an-array-after-merge-operations", "maximum-number-of-groups-with-increasing-length", "count-paths-that-can-form-a-palindrome-in-a-tree"]}, {"contest_title": "\u7b2c 356 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 356", "contest_title_slug": "weekly-contest-356", "contest_id": 904, "contest_start_time": 1690684200, "contest_duration": 5400, "user_num": 4082, "question_slugs": ["number-of-employees-who-met-the-target", "count-complete-subarrays-in-an-array", "shortest-string-that-contains-three-strings", "count-stepping-numbers-in-range"]}, {"contest_title": "\u7b2c 357 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 357", "contest_title_slug": "weekly-contest-357", "contest_id": 906, "contest_start_time": 1691289000, "contest_duration": 5400, "user_num": 4265, "question_slugs": ["faulty-keyboard", "check-if-it-is-possible-to-split-array", "find-the-safest-path-in-a-grid", "maximum-elegance-of-a-k-length-subsequence"]}, {"contest_title": "\u7b2c 358 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 358", "contest_title_slug": "weekly-contest-358", "contest_id": 910, "contest_start_time": 1691893800, "contest_duration": 5400, "user_num": 4475, "question_slugs": ["max-pair-sum-in-an-array", "double-a-number-represented-as-a-linked-list", "minimum-absolute-difference-between-elements-with-constraint", "apply-operations-to-maximize-score"]}, {"contest_title": "\u7b2c 359 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 359", "contest_title_slug": "weekly-contest-359", "contest_id": 913, "contest_start_time": 1692498600, "contest_duration": 5400, "user_num": 4101, "question_slugs": ["check-if-a-string-is-an-acronym-of-words", "determine-the-minimum-sum-of-a-k-avoiding-array", "maximize-the-profit-as-the-salesman", "find-the-longest-equal-subarray"]}, {"contest_title": "\u7b2c 360 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 360", "contest_title_slug": "weekly-contest-360", "contest_id": 918, "contest_start_time": 1693103400, "contest_duration": 5400, "user_num": 4496, "question_slugs": ["furthest-point-from-origin", "find-the-minimum-possible-sum-of-a-beautiful-array", "minimum-operations-to-form-subsequence-with-target-sum", "maximize-value-of-function-in-a-ball-passing-game"]}, {"contest_title": "\u7b2c 361 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 361", "contest_title_slug": "weekly-contest-361", "contest_id": 920, "contest_start_time": 1693708200, "contest_duration": 5400, "user_num": 4170, "question_slugs": ["count-symmetric-integers", "minimum-operations-to-make-a-special-number", "count-of-interesting-subarrays", "minimum-edge-weight-equilibrium-queries-in-a-tree"]}, {"contest_title": "\u7b2c 362 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 362", "contest_title_slug": "weekly-contest-362", "contest_id": 924, "contest_start_time": 1694313000, "contest_duration": 5400, "user_num": 4800, "question_slugs": ["points-that-intersect-with-cars", "determine-if-a-cell-is-reachable-at-a-given-time", "minimum-moves-to-spread-stones-over-grid", "string-transformation"]}, {"contest_title": "\u7b2c 363 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 363", "contest_title_slug": "weekly-contest-363", "contest_id": 926, "contest_start_time": 1694917800, "contest_duration": 5400, "user_num": 4768, "question_slugs": ["sum-of-values-at-indices-with-k-set-bits", "happy-students", "maximum-number-of-alloys", "maximum-element-sum-of-a-complete-subset-of-indices"]}, {"contest_title": "\u7b2c 364 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 364", "contest_title_slug": "weekly-contest-364", "contest_id": 930, "contest_start_time": 1695522600, "contest_duration": 5400, "user_num": 4304, "question_slugs": ["maximum-odd-binary-number", "beautiful-towers-i", "beautiful-towers-ii", "count-valid-paths-in-a-tree"]}, {"contest_title": "\u7b2c 365 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 365", "contest_title_slug": "weekly-contest-365", "contest_id": 932, "contest_start_time": 1696127400, "contest_duration": 5400, "user_num": 2909, "question_slugs": ["maximum-value-of-an-ordered-triplet-i", "maximum-value-of-an-ordered-triplet-ii", "minimum-size-subarray-in-infinite-array", "count-visited-nodes-in-a-directed-graph"]}, {"contest_title": "\u7b2c 366 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 366", "contest_title_slug": "weekly-contest-366", "contest_id": 936, "contest_start_time": 1696732200, "contest_duration": 5400, "user_num": 2790, "question_slugs": ["divisible-and-non-divisible-sums-difference", "minimum-processing-time", "apply-operations-to-make-two-strings-equal", "apply-operations-on-array-to-maximize-sum-of-squares"]}, {"contest_title": "\u7b2c 367 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 367", "contest_title_slug": "weekly-contest-367", "contest_id": 938, "contest_start_time": 1697337000, "contest_duration": 5400, "user_num": 4317, "question_slugs": ["find-indices-with-index-and-value-difference-i", "shortest-and-lexicographically-smallest-beautiful-string", "find-indices-with-index-and-value-difference-ii", "construct-product-matrix"]}, {"contest_title": "\u7b2c 368 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 368", "contest_title_slug": "weekly-contest-368", "contest_id": 942, "contest_start_time": 1697941800, "contest_duration": 5400, "user_num": 5002, "question_slugs": ["minimum-sum-of-mountain-triplets-i", "minimum-sum-of-mountain-triplets-ii", "minimum-number-of-groups-to-create-a-valid-assignment", "minimum-changes-to-make-k-semi-palindromes"]}, {"contest_title": "\u7b2c 369 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 369", "contest_title_slug": "weekly-contest-369", "contest_id": 945, "contest_start_time": 1698546600, "contest_duration": 5400, "user_num": 4121, "question_slugs": ["find-the-k-or-of-an-array", "minimum-equal-sum-of-two-arrays-after-replacing-zeros", "minimum-increment-operations-to-make-array-beautiful", "maximum-points-after-collecting-coins-from-all-nodes"]}, {"contest_title": "\u7b2c 370 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 370", "contest_title_slug": "weekly-contest-370", "contest_id": 950, "contest_start_time": 1699151400, "contest_duration": 5400, "user_num": 3983, "question_slugs": ["find-champion-i", "find-champion-ii", "maximum-score-after-applying-operations-on-a-tree", "maximum-balanced-subsequence-sum"]}, {"contest_title": "\u7b2c 371 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 371", "contest_title_slug": "weekly-contest-371", "contest_id": 952, "contest_start_time": 1699756200, "contest_duration": 5400, "user_num": 3638, "question_slugs": ["maximum-strong-pair-xor-i", "high-access-employees", "minimum-operations-to-maximize-last-elements-in-arrays", "maximum-strong-pair-xor-ii"]}, {"contest_title": "\u7b2c 372 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 372", "contest_title_slug": "weekly-contest-372", "contest_id": 956, "contest_start_time": 1700361000, "contest_duration": 5400, "user_num": 3920, "question_slugs": ["make-three-strings-equal", "separate-black-and-white-balls", "maximum-xor-product", "find-building-where-alice-and-bob-can-meet"]}, {"contest_title": "\u7b2c 373 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 373", "contest_title_slug": "weekly-contest-373", "contest_id": 958, "contest_start_time": 1700965800, "contest_duration": 5400, "user_num": 3577, "question_slugs": ["matrix-similarity-after-cyclic-shifts", "count-beautiful-substrings-i", "make-lexicographically-smallest-array-by-swapping-elements", "count-beautiful-substrings-ii"]}, {"contest_title": "\u7b2c 374 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 374", "contest_title_slug": "weekly-contest-374", "contest_id": 962, "contest_start_time": 1701570600, "contest_duration": 5400, "user_num": 4053, "question_slugs": ["find-the-peaks", "minimum-number-of-coins-to-be-added", "count-complete-substrings", "count-the-number-of-infection-sequences"]}, {"contest_title": "\u7b2c 375 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 375", "contest_title_slug": "weekly-contest-375", "contest_id": 964, "contest_start_time": 1702175400, "contest_duration": 5400, "user_num": 3518, "question_slugs": ["count-tested-devices-after-test-operations", "double-modular-exponentiation", "count-subarrays-where-max-element-appears-at-least-k-times", "count-the-number-of-good-partitions"]}, {"contest_title": "\u7b2c 376 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 376", "contest_title_slug": "weekly-contest-376", "contest_id": 968, "contest_start_time": 1702780200, "contest_duration": 5400, "user_num": 3409, "question_slugs": ["find-missing-and-repeated-values", "divide-array-into-arrays-with-max-difference", "minimum-cost-to-make-array-equalindromic", "apply-operations-to-maximize-frequency-score"]}, {"contest_title": "\u7b2c 377 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 377", "contest_title_slug": "weekly-contest-377", "contest_id": 970, "contest_start_time": 1703385000, "contest_duration": 5400, "user_num": 3148, "question_slugs": ["minimum-number-game", "maximum-square-area-by-removing-fences-from-a-field", "minimum-cost-to-convert-string-i", "minimum-cost-to-convert-string-ii"]}, {"contest_title": "\u7b2c 378 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 378", "contest_title_slug": "weekly-contest-378", "contest_id": 974, "contest_start_time": 1703989800, "contest_duration": 5400, "user_num": 2747, "question_slugs": ["check-if-bitwise-or-has-trailing-zeros", "find-longest-special-substring-that-occurs-thrice-i", "find-longest-special-substring-that-occurs-thrice-ii", "palindrome-rearrangement-queries"]}, {"contest_title": "\u7b2c 379 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 379", "contest_title_slug": "weekly-contest-379", "contest_id": 976, "contest_start_time": 1704594600, "contest_duration": 5400, "user_num": 3117, "question_slugs": ["maximum-area-of-longest-diagonal-rectangle", "minimum-moves-to-capture-the-queen", "maximum-size-of-a-set-after-removals", "maximize-the-number-of-partitions-after-operations"]}, {"contest_title": "\u7b2c 380 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 380", "contest_title_slug": "weekly-contest-380", "contest_id": 980, "contest_start_time": 1705199400, "contest_duration": 5400, "user_num": 3325, "question_slugs": ["count-elements-with-maximum-frequency", "find-beautiful-indices-in-the-given-array-i", "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k", "find-beautiful-indices-in-the-given-array-ii"]}, {"contest_title": "\u7b2c 381 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 381", "contest_title_slug": "weekly-contest-381", "contest_id": 982, "contest_start_time": 1705804200, "contest_duration": 5400, "user_num": 3737, "question_slugs": ["minimum-number-of-pushes-to-type-word-i", "count-the-number-of-houses-at-a-certain-distance-i", "minimum-number-of-pushes-to-type-word-ii", "count-the-number-of-houses-at-a-certain-distance-ii"]}, {"contest_title": "\u7b2c 382 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 382", "contest_title_slug": "weekly-contest-382", "contest_id": 986, "contest_start_time": 1706409000, "contest_duration": 5400, "user_num": 3134, "question_slugs": ["number-of-changing-keys", "find-the-maximum-number-of-elements-in-subset", "alice-and-bob-playing-flower-game", "minimize-or-of-remaining-elements-using-operations"]}, {"contest_title": "\u7b2c 383 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 383", "contest_title_slug": "weekly-contest-383", "contest_id": 988, "contest_start_time": 1707013800, "contest_duration": 5400, "user_num": 2691, "question_slugs": ["ant-on-the-boundary", "minimum-time-to-revert-word-to-initial-state-i", "find-the-grid-of-region-average", "minimum-time-to-revert-word-to-initial-state-ii"]}, {"contest_title": "\u7b2c 384 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 384", "contest_title_slug": "weekly-contest-384", "contest_id": 992, "contest_start_time": 1707618600, "contest_duration": 5400, "user_num": 1652, "question_slugs": ["modify-the-matrix", "number-of-subarrays-that-match-a-pattern-i", "maximum-palindromes-after-operations", "number-of-subarrays-that-match-a-pattern-ii"]}, {"contest_title": "\u7b2c 385 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 385", "contest_title_slug": "weekly-contest-385", "contest_id": 994, "contest_start_time": 1708223400, "contest_duration": 5400, "user_num": 2382, "question_slugs": ["count-prefix-and-suffix-pairs-i", "find-the-length-of-the-longest-common-prefix", "most-frequent-prime", "count-prefix-and-suffix-pairs-ii"]}, {"contest_title": "\u7b2c 386 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 386", "contest_title_slug": "weekly-contest-386", "contest_id": 998, "contest_start_time": 1708828200, "contest_duration": 5400, "user_num": 2731, "question_slugs": ["split-the-array", "find-the-largest-area-of-square-inside-two-rectangles", "earliest-second-to-mark-indices-i", "earliest-second-to-mark-indices-ii"]}, {"contest_title": "\u7b2c 387 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 387", "contest_title_slug": "weekly-contest-387", "contest_id": 1000, "contest_start_time": 1709433000, "contest_duration": 5400, "user_num": 3694, "question_slugs": ["distribute-elements-into-two-arrays-i", "count-submatrices-with-top-left-element-and-sum-less-than-k", "minimum-operations-to-write-the-letter-y-on-a-grid", "distribute-elements-into-two-arrays-ii"]}, {"contest_title": "\u7b2c 388 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 388", "contest_title_slug": "weekly-contest-388", "contest_id": 1004, "contest_start_time": 1710037800, "contest_duration": 5400, "user_num": 4291, "question_slugs": ["apple-redistribution-into-boxes", "maximize-happiness-of-selected-children", "shortest-uncommon-substring-in-an-array", "maximum-strength-of-k-disjoint-subarrays"]}, {"contest_title": "\u7b2c 389 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 389", "contest_title_slug": "weekly-contest-389", "contest_id": 1006, "contest_start_time": 1710642600, "contest_duration": 5400, "user_num": 4561, "question_slugs": ["existence-of-a-substring-in-a-string-and-its-reverse", "count-substrings-starting-and-ending-with-given-character", "minimum-deletions-to-make-string-k-special", "minimum-moves-to-pick-k-ones"]}, {"contest_title": "\u7b2c 390 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 390", "contest_title_slug": "weekly-contest-390", "contest_id": 1011, "contest_start_time": 1711247400, "contest_duration": 5400, "user_num": 4817, "question_slugs": ["maximum-length-substring-with-two-occurrences", "apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k", "most-frequent-ids", "longest-common-suffix-queries"]}, {"contest_title": "\u7b2c 391 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 391", "contest_title_slug": "weekly-contest-391", "contest_id": 1014, "contest_start_time": 1711852200, "contest_duration": 5400, "user_num": 4180, "question_slugs": ["harshad-number", "water-bottles-ii", "count-alternating-subarrays", "minimize-manhattan-distances"]}, {"contest_title": "\u7b2c 392 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 392", "contest_title_slug": "weekly-contest-392", "contest_id": 1018, "contest_start_time": 1712457000, "contest_duration": 5400, "user_num": 3193, "question_slugs": ["longest-strictly-increasing-or-strictly-decreasing-subarray", "lexicographically-smallest-string-after-operations-with-constraint", "minimum-operations-to-make-median-of-array-equal-to-k", "minimum-cost-walk-in-weighted-graph"]}, {"contest_title": "\u7b2c 393 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 393", "contest_title_slug": "weekly-contest-393", "contest_id": 1020, "contest_start_time": 1713061800, "contest_duration": 5400, "user_num": 4219, "question_slugs": ["latest-time-you-can-obtain-after-replacing-characters", "maximum-prime-difference", "kth-smallest-amount-with-single-denomination-combination", "minimum-sum-of-values-by-dividing-array"]}, {"contest_title": "\u7b2c 394 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 394", "contest_title_slug": "weekly-contest-394", "contest_id": 1024, "contest_start_time": 1713666600, "contest_duration": 5400, "user_num": 3958, "question_slugs": ["count-the-number-of-special-characters-i", "count-the-number-of-special-characters-ii", "minimum-number-of-operations-to-satisfy-conditions", "find-edges-in-shortest-paths"]}, {"contest_title": "\u7b2c 395 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 395", "contest_title_slug": "weekly-contest-395", "contest_id": 1026, "contest_start_time": 1714271400, "contest_duration": 5400, "user_num": 2969, "question_slugs": ["find-the-integer-added-to-array-i", "find-the-integer-added-to-array-ii", "minimum-array-end", "find-the-median-of-the-uniqueness-array"]}, {"contest_title": "\u7b2c 396 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 396", "contest_title_slug": "weekly-contest-396", "contest_id": 1030, "contest_start_time": 1714876200, "contest_duration": 5400, "user_num": 2932, "question_slugs": ["valid-word", "minimum-number-of-operations-to-make-word-k-periodic", "minimum-length-of-anagram-concatenation", "minimum-cost-to-equalize-array"]}, {"contest_title": "\u7b2c 397 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 397", "contest_title_slug": "weekly-contest-397", "contest_id": 1032, "contest_start_time": 1715481000, "contest_duration": 5400, "user_num": 3365, "question_slugs": ["permutation-difference-between-two-strings", "taking-maximum-energy-from-the-mystic-dungeon", "maximum-difference-score-in-a-grid", "find-the-minimum-cost-array-permutation"]}, {"contest_title": "\u7b2c 398 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 398", "contest_title_slug": "weekly-contest-398", "contest_id": 1036, "contest_start_time": 1716085800, "contest_duration": 5400, "user_num": 3606, "question_slugs": ["special-array-i", "special-array-ii", "sum-of-digit-differences-of-all-pairs", "find-number-of-ways-to-reach-the-k-th-stair"]}, {"contest_title": "\u7b2c 399 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 399", "contest_title_slug": "weekly-contest-399", "contest_id": 1038, "contest_start_time": 1716690600, "contest_duration": 5400, "user_num": 3424, "question_slugs": ["find-the-number-of-good-pairs-i", "string-compression-iii", "find-the-number-of-good-pairs-ii", "maximum-sum-of-subsequence-with-non-adjacent-elements"]}, {"contest_title": "\u7b2c 400 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 400", "contest_title_slug": "weekly-contest-400", "contest_id": 1043, "contest_start_time": 1717295400, "contest_duration": 5400, "user_num": 3534, "question_slugs": ["minimum-number-of-chairs-in-a-waiting-room", "count-days-without-meetings", "lexicographically-minimum-string-after-removing-stars", "find-subarray-with-bitwise-or-closest-to-k"]}, {"contest_title": "\u7b2c 401 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 401", "contest_title_slug": "weekly-contest-401", "contest_id": 1045, "contest_start_time": 1717900200, "contest_duration": 5400, "user_num": 3160, "question_slugs": ["find-the-child-who-has-the-ball-after-k-seconds", "find-the-n-th-value-after-k-seconds", "maximum-total-reward-using-operations-i", "maximum-total-reward-using-operations-ii"]}, {"contest_title": "\u7b2c 402 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 402", "contest_title_slug": "weekly-contest-402", "contest_id": 1049, "contest_start_time": 1718505000, "contest_duration": 5400, "user_num": 3283, "question_slugs": ["count-pairs-that-form-a-complete-day-i", "count-pairs-that-form-a-complete-day-ii", "maximum-total-damage-with-spell-casting", "peaks-in-array"]}, {"contest_title": "\u7b2c 403 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 403", "contest_title_slug": "weekly-contest-403", "contest_id": 1052, "contest_start_time": 1719109800, "contest_duration": 5400, "user_num": 3112, "question_slugs": ["minimum-average-of-smallest-and-largest-elements", "find-the-minimum-area-to-cover-all-ones-i", "maximize-total-cost-of-alternating-subarrays", "find-the-minimum-area-to-cover-all-ones-ii"]}, {"contest_title": "\u7b2c 404 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 404", "contest_title_slug": "weekly-contest-404", "contest_id": 1056, "contest_start_time": 1719714600, "contest_duration": 5400, "user_num": 3486, "question_slugs": ["maximum-height-of-a-triangle", "find-the-maximum-length-of-valid-subsequence-i", "find-the-maximum-length-of-valid-subsequence-ii", "find-minimum-diameter-after-merging-two-trees"]}, {"contest_title": "\u7b2c 405 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 405", "contest_title_slug": "weekly-contest-405", "contest_id": 1058, "contest_start_time": 1720319400, "contest_duration": 5400, "user_num": 3240, "question_slugs": ["find-the-encrypted-string", "generate-binary-strings-without-adjacent-zeros", "count-submatrices-with-equal-frequency-of-x-and-y", "construct-string-with-minimum-cost"]}, {"contest_title": "\u7b2c 27 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 27", "contest_title_slug": "biweekly-contest-27", "contest_id": 204, "contest_start_time": 1590849000, "contest_duration": 5400, "user_num": 1966, "question_slugs": ["make-two-arrays-equal-by-reversing-subarrays", "check-if-a-string-contains-all-binary-codes-of-size-k", "course-schedule-iv", "cherry-pickup-ii"]}, {"contest_title": "\u7b2c 29 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 29", "contest_title_slug": "biweekly-contest-29", "contest_id": 216, "contest_start_time": 1593268200, "contest_duration": 5400, "user_num": 2260, "question_slugs": ["average-salary-excluding-the-minimum-and-maximum-salary", "the-kth-factor-of-n", "longest-subarray-of-1s-after-deleting-one-element", "parallel-courses-ii"]}, {"contest_title": "\u7b2c 58 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 58", "contest_title_slug": "biweekly-contest-58", "contest_id": 441, "contest_start_time": 1628346600, "contest_duration": 5400, "user_num": 2889, "question_slugs": ["delete-characters-to-make-fancy-string", "check-if-move-is-legal", "minimum-total-space-wasted-with-k-resizing-operations", "maximum-product-of-the-length-of-two-palindromic-substrings"]}, {"contest_title": "\u7b2c 59 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 59", "contest_title_slug": "biweekly-contest-59", "contest_id": 448, "contest_start_time": 1629556200, "contest_duration": 5400, "user_num": 3030, "question_slugs": ["minimum-time-to-type-word-using-special-typewriter", "maximum-matrix-sum", "number-of-ways-to-arrive-at-destination", "number-of-ways-to-separate-numbers"]}, {"contest_title": "\u7b2c 60 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 60", "contest_title_slug": "biweekly-contest-60", "contest_id": 461, "contest_start_time": 1630765800, "contest_duration": 5400, "user_num": 2848, "question_slugs": ["find-the-middle-index-in-array", "find-all-groups-of-farmland", "operations-on-tree", "the-number-of-good-subsets"]}, {"contest_title": "\u7b2c 61 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 61", "contest_title_slug": "biweekly-contest-61", "contest_id": 467, "contest_start_time": 1631975400, "contest_duration": 5400, "user_num": 2534, "question_slugs": ["count-number-of-pairs-with-absolute-difference-k", "find-original-array-from-doubled-array", "maximum-earnings-from-taxi", "minimum-number-of-operations-to-make-array-continuous"]}, {"contest_title": "\u7b2c 62 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 62", "contest_title_slug": "biweekly-contest-62", "contest_id": 477, "contest_start_time": 1633185000, "contest_duration": 5400, "user_num": 2619, "question_slugs": ["convert-1d-array-into-2d-array", "number-of-pairs-of-strings-with-concatenation-equal-to-target", "maximize-the-confusion-of-an-exam", "maximum-number-of-ways-to-partition-an-array"]}, {"contest_title": "\u7b2c 63 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 63", "contest_title_slug": "biweekly-contest-63", "contest_id": 484, "contest_start_time": 1634394600, "contest_duration": 5400, "user_num": 2828, "question_slugs": ["minimum-number-of-moves-to-seat-everyone", "remove-colored-pieces-if-both-neighbors-are-the-same-color", "the-time-when-the-network-becomes-idle", "kth-smallest-product-of-two-sorted-arrays"]}, {"contest_title": "\u7b2c 64 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 64", "contest_title_slug": "biweekly-contest-64", "contest_id": 490, "contest_start_time": 1635604200, "contest_duration": 5400, "user_num": 2838, "question_slugs": ["kth-distinct-string-in-an-array", "two-best-non-overlapping-events", "plates-between-candles", "number-of-valid-move-combinations-on-chessboard"]}, {"contest_title": "\u7b2c 65 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 65", "contest_title_slug": "biweekly-contest-65", "contest_id": 497, "contest_start_time": 1636813800, "contest_duration": 5400, "user_num": 2676, "question_slugs": ["check-whether-two-strings-are-almost-equivalent", "walking-robot-simulation-ii", "most-beautiful-item-for-each-query", "maximum-number-of-tasks-you-can-assign"]}, {"contest_title": "\u7b2c 66 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 66", "contest_title_slug": "biweekly-contest-66", "contest_id": 503, "contest_start_time": 1638023400, "contest_duration": 5400, "user_num": 2803, "question_slugs": ["count-common-words-with-one-occurrence", "minimum-number-of-food-buckets-to-feed-the-hamsters", "minimum-cost-homecoming-of-a-robot-in-a-grid", "count-fertile-pyramids-in-a-land"]}, {"contest_title": "\u7b2c 67 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 67", "contest_title_slug": "biweekly-contest-67", "contest_id": 509, "contest_start_time": 1639233000, "contest_duration": 5400, "user_num": 2923, "question_slugs": ["find-subsequence-of-length-k-with-the-largest-sum", "find-good-days-to-rob-the-bank", "detonate-the-maximum-bombs", "sequentially-ordinal-rank-tracker"]}, {"contest_title": "\u7b2c 68 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 68", "contest_title_slug": "biweekly-contest-68", "contest_id": 515, "contest_start_time": 1640442600, "contest_duration": 5400, "user_num": 2854, "question_slugs": ["maximum-number-of-words-found-in-sentences", "find-all-possible-recipes-from-given-supplies", "check-if-a-parentheses-string-can-be-valid", "abbreviating-the-product-of-a-range"]}, {"contest_title": "\u7b2c 69 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 69", "contest_title_slug": "biweekly-contest-69", "contest_id": 521, "contest_start_time": 1641652200, "contest_duration": 5400, "user_num": 3360, "question_slugs": ["capitalize-the-title", "maximum-twin-sum-of-a-linked-list", "longest-palindrome-by-concatenating-two-letter-words", "stamping-the-grid"]}, {"contest_title": "\u7b2c 70 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 70", "contest_title_slug": "biweekly-contest-70", "contest_id": 527, "contest_start_time": 1642861800, "contest_duration": 5400, "user_num": 3640, "question_slugs": ["minimum-cost-of-buying-candies-with-discount", "count-the-hidden-sequences", "k-highest-ranked-items-within-a-price-range", "number-of-ways-to-divide-a-long-corridor"]}, {"contest_title": "\u7b2c 71 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 71", "contest_title_slug": "biweekly-contest-71", "contest_id": 533, "contest_start_time": 1644071400, "contest_duration": 5400, "user_num": 3028, "question_slugs": ["minimum-sum-of-four-digit-number-after-splitting-digits", "partition-array-according-to-given-pivot", "minimum-cost-to-set-cooking-time", "minimum-difference-in-sums-after-removal-of-elements"]}, {"contest_title": "\u7b2c 72 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 72", "contest_title_slug": "biweekly-contest-72", "contest_id": 539, "contest_start_time": 1645281000, "contest_duration": 5400, "user_num": 4400, "question_slugs": ["count-equal-and-divisible-pairs-in-an-array", "find-three-consecutive-integers-that-sum-to-a-given-number", "maximum-split-of-positive-even-integers", "count-good-triplets-in-an-array"]}, {"contest_title": "\u7b2c 73 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 73", "contest_title_slug": "biweekly-contest-73", "contest_id": 545, "contest_start_time": 1646490600, "contest_duration": 5400, "user_num": 5132, "question_slugs": ["most-frequent-number-following-key-in-an-array", "sort-the-jumbled-numbers", "all-ancestors-of-a-node-in-a-directed-acyclic-graph", "minimum-number-of-moves-to-make-palindrome"]}, {"contest_title": "\u7b2c 74 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 74", "contest_title_slug": "biweekly-contest-74", "contest_id": 554, "contest_start_time": 1647700200, "contest_duration": 5400, "user_num": 5442, "question_slugs": ["divide-array-into-equal-pairs", "maximize-number-of-subsequences-in-a-string", "minimum-operations-to-halve-array-sum", "minimum-white-tiles-after-covering-with-carpets"]}, {"contest_title": "\u7b2c 75 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 75", "contest_title_slug": "biweekly-contest-75", "contest_id": 563, "contest_start_time": 1648909800, "contest_duration": 5400, "user_num": 4335, "question_slugs": ["minimum-bit-flips-to-convert-number", "find-triangular-sum-of-an-array", "number-of-ways-to-select-buildings", "sum-of-scores-of-built-strings"]}, {"contest_title": "\u7b2c 76 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 76", "contest_title_slug": "biweekly-contest-76", "contest_id": 572, "contest_start_time": 1650119400, "contest_duration": 5400, "user_num": 4477, "question_slugs": ["find-closest-number-to-zero", "number-of-ways-to-buy-pens-and-pencils", "design-an-atm-machine", "maximum-score-of-a-node-sequence"]}, {"contest_title": "\u7b2c 77 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 77", "contest_title_slug": "biweekly-contest-77", "contest_id": 581, "contest_start_time": 1651329000, "contest_duration": 5400, "user_num": 4211, "question_slugs": ["count-prefixes-of-a-given-string", "minimum-average-difference", "count-unguarded-cells-in-the-grid", "escape-the-spreading-fire"]}, {"contest_title": "\u7b2c 78 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 78", "contest_title_slug": "biweekly-contest-78", "contest_id": 590, "contest_start_time": 1652538600, "contest_duration": 5400, "user_num": 4347, "question_slugs": ["find-the-k-beauty-of-a-number", "number-of-ways-to-split-array", "maximum-white-tiles-covered-by-a-carpet", "substring-with-largest-variance"]}, {"contest_title": "\u7b2c 79 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 79", "contest_title_slug": "biweekly-contest-79", "contest_id": 598, "contest_start_time": 1653748200, "contest_duration": 5400, "user_num": 4250, "question_slugs": ["check-if-number-has-equal-digit-count-and-digit-value", "sender-with-largest-word-count", "maximum-total-importance-of-roads", "booking-concert-tickets-in-groups"]}, {"contest_title": "\u7b2c 80 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 80", "contest_title_slug": "biweekly-contest-80", "contest_id": 608, "contest_start_time": 1654957800, "contest_duration": 5400, "user_num": 3949, "question_slugs": ["strong-password-checker-ii", "successful-pairs-of-spells-and-potions", "match-substring-after-replacement", "count-subarrays-with-score-less-than-k"]}, {"contest_title": "\u7b2c 81 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 81", "contest_title_slug": "biweekly-contest-81", "contest_id": 614, "contest_start_time": 1656167400, "contest_duration": 5400, "user_num": 3847, "question_slugs": ["count-asterisks", "count-unreachable-pairs-of-nodes-in-an-undirected-graph", "maximum-xor-after-operations", "number-of-distinct-roll-sequences"]}, {"contest_title": "\u7b2c 82 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 82", "contest_title_slug": "biweekly-contest-82", "contest_id": 646, "contest_start_time": 1657377000, "contest_duration": 5400, "user_num": 4144, "question_slugs": ["evaluate-boolean-binary-tree", "the-latest-time-to-catch-a-bus", "minimum-sum-of-squared-difference", "subarray-with-elements-greater-than-varying-threshold"]}, {"contest_title": "\u7b2c 83 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 83", "contest_title_slug": "biweekly-contest-83", "contest_id": 652, "contest_start_time": 1658586600, "contest_duration": 5400, "user_num": 4437, "question_slugs": ["best-poker-hand", "number-of-zero-filled-subarrays", "design-a-number-container-system", "shortest-impossible-sequence-of-rolls"]}, {"contest_title": "\u7b2c 84 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 84", "contest_title_slug": "biweekly-contest-84", "contest_id": 658, "contest_start_time": 1659796200, "contest_duration": 5400, "user_num": 4574, "question_slugs": ["merge-similar-items", "count-number-of-bad-pairs", "task-scheduler-ii", "minimum-replacements-to-sort-the-array"]}, {"contest_title": "\u7b2c 85 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 85", "contest_title_slug": "biweekly-contest-85", "contest_id": 668, "contest_start_time": 1661005800, "contest_duration": 5400, "user_num": 4193, "question_slugs": ["minimum-recolors-to-get-k-consecutive-black-blocks", "time-needed-to-rearrange-a-binary-string", "shifting-letters-ii", "maximum-segment-sum-after-removals"]}, {"contest_title": "\u7b2c 86 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 86", "contest_title_slug": "biweekly-contest-86", "contest_id": 688, "contest_start_time": 1662215400, "contest_duration": 5400, "user_num": 4401, "question_slugs": ["find-subarrays-with-equal-sum", "strictly-palindromic-number", "maximum-rows-covered-by-columns", "maximum-number-of-robots-within-budget"]}, {"contest_title": "\u7b2c 87 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 87", "contest_title_slug": "biweekly-contest-87", "contest_id": 703, "contest_start_time": 1663425000, "contest_duration": 5400, "user_num": 4005, "question_slugs": ["count-days-spent-together", "maximum-matching-of-players-with-trainers", "smallest-subarrays-with-maximum-bitwise-or", "minimum-money-required-before-transactions"]}, {"contest_title": "\u7b2c 88 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 88", "contest_title_slug": "biweekly-contest-88", "contest_id": 745, "contest_start_time": 1664634600, "contest_duration": 5400, "user_num": 3905, "question_slugs": ["remove-letter-to-equalize-frequency", "longest-uploaded-prefix", "bitwise-xor-of-all-pairings", "number-of-pairs-satisfying-inequality"]}, {"contest_title": "\u7b2c 89 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 89", "contest_title_slug": "biweekly-contest-89", "contest_id": 755, "contest_start_time": 1665844200, "contest_duration": 5400, "user_num": 3984, "question_slugs": ["number-of-valid-clock-times", "range-product-queries-of-powers", "minimize-maximum-of-array", "create-components-with-same-value"]}, {"contest_title": "\u7b2c 90 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 90", "contest_title_slug": "biweekly-contest-90", "contest_id": 763, "contest_start_time": 1667053800, "contest_duration": 5400, "user_num": 3624, "question_slugs": ["odd-string-difference", "words-within-two-edits-of-dictionary", "destroy-sequential-targets", "next-greater-element-iv"]}, {"contest_title": "\u7b2c 91 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 91", "contest_title_slug": "biweekly-contest-91", "contest_id": 770, "contest_start_time": 1668263400, "contest_duration": 5400, "user_num": 3535, "question_slugs": ["number-of-distinct-averages", "count-ways-to-build-good-strings", "most-profitable-path-in-a-tree", "split-message-based-on-limit"]}, {"contest_title": "\u7b2c 92 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 92", "contest_title_slug": "biweekly-contest-92", "contest_id": 776, "contest_start_time": 1669473000, "contest_duration": 5400, "user_num": 3055, "question_slugs": ["minimum-cuts-to-divide-a-circle", "difference-between-ones-and-zeros-in-row-and-column", "minimum-penalty-for-a-shop", "count-palindromic-subsequences"]}, {"contest_title": "\u7b2c 93 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 93", "contest_title_slug": "biweekly-contest-93", "contest_id": 782, "contest_start_time": 1670682600, "contest_duration": 5400, "user_num": 2929, "question_slugs": ["maximum-value-of-a-string-in-an-array", "maximum-star-sum-of-a-graph", "frog-jump-ii", "minimum-total-cost-to-make-arrays-unequal"]}, {"contest_title": "\u7b2c 94 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 94", "contest_title_slug": "biweekly-contest-94", "contest_id": 789, "contest_start_time": 1671892200, "contest_duration": 5400, "user_num": 2298, "question_slugs": ["maximum-enemy-forts-that-can-be-captured", "reward-top-k-students", "minimize-the-maximum-of-two-arrays", "count-anagrams"]}, {"contest_title": "\u7b2c 95 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 95", "contest_title_slug": "biweekly-contest-95", "contest_id": 798, "contest_start_time": 1673101800, "contest_duration": 5400, "user_num": 2880, "question_slugs": ["categorize-box-according-to-criteria", "find-consecutive-integers-from-a-data-stream", "find-xor-beauty-of-array", "maximize-the-minimum-powered-city"]}, {"contest_title": "\u7b2c 96 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 96", "contest_title_slug": "biweekly-contest-96", "contest_id": 804, "contest_start_time": 1674311400, "contest_duration": 5400, "user_num": 2103, "question_slugs": ["minimum-common-value", "minimum-operations-to-make-array-equal-ii", "maximum-subsequence-score", "check-if-point-is-reachable"]}, {"contest_title": "\u7b2c 97 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 97", "contest_title_slug": "biweekly-contest-97", "contest_id": 810, "contest_start_time": 1675521000, "contest_duration": 5400, "user_num": 2631, "question_slugs": ["separate-the-digits-in-an-array", "maximum-number-of-integers-to-choose-from-a-range-i", "maximize-win-from-two-segments", "disconnect-path-in-a-binary-matrix-by-at-most-one-flip"]}, {"contest_title": "\u7b2c 98 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 98", "contest_title_slug": "biweekly-contest-98", "contest_id": 816, "contest_start_time": 1676730600, "contest_duration": 5400, "user_num": 3250, "question_slugs": ["maximum-difference-by-remapping-a-digit", "minimum-score-by-changing-two-elements", "minimum-impossible-or", "handling-sum-queries-after-update"]}, {"contest_title": "\u7b2c 99 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 99", "contest_title_slug": "biweekly-contest-99", "contest_id": 822, "contest_start_time": 1677940200, "contest_duration": 5400, "user_num": 3467, "question_slugs": ["split-with-minimum-sum", "count-total-number-of-colored-cells", "count-ways-to-group-overlapping-ranges", "count-number-of-possible-root-nodes"]}, {"contest_title": "\u7b2c 100 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 100", "contest_title_slug": "biweekly-contest-100", "contest_id": 832, "contest_start_time": 1679149800, "contest_duration": 5400, "user_num": 3639, "question_slugs": ["distribute-money-to-maximum-children", "maximize-greatness-of-an-array", "find-score-of-an-array-after-marking-all-elements", "minimum-time-to-repair-cars"]}, {"contest_title": "\u7b2c 101 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 101", "contest_title_slug": "biweekly-contest-101", "contest_id": 842, "contest_start_time": 1680359400, "contest_duration": 5400, "user_num": 3353, "question_slugs": ["form-smallest-number-from-two-digit-arrays", "find-the-substring-with-maximum-cost", "make-k-subarray-sums-equal", "shortest-cycle-in-a-graph"]}, {"contest_title": "\u7b2c 102 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 102", "contest_title_slug": "biweekly-contest-102", "contest_id": 853, "contest_start_time": 1681569000, "contest_duration": 5400, "user_num": 3058, "question_slugs": ["find-the-width-of-columns-of-a-grid", "find-the-score-of-all-prefixes-of-an-array", "cousins-in-binary-tree-ii", "design-graph-with-shortest-path-calculator"]}, {"contest_title": "\u7b2c 103 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 103", "contest_title_slug": "biweekly-contest-103", "contest_id": 859, "contest_start_time": 1682778600, "contest_duration": 5400, "user_num": 2299, "question_slugs": ["maximum-sum-with-exactly-k-elements", "find-the-prefix-common-array-of-two-arrays", "maximum-number-of-fish-in-a-grid", "make-array-empty"]}, {"contest_title": "\u7b2c 104 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 104", "contest_title_slug": "biweekly-contest-104", "contest_id": 866, "contest_start_time": 1683988200, "contest_duration": 5400, "user_num": 2519, "question_slugs": ["number-of-senior-citizens", "sum-in-a-matrix", "maximum-or", "power-of-heroes"]}, {"contest_title": "\u7b2c 105 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 105", "contest_title_slug": "biweekly-contest-105", "contest_id": 873, "contest_start_time": 1685197800, "contest_duration": 5400, "user_num": 2604, "question_slugs": ["buy-two-chocolates", "extra-characters-in-a-string", "maximum-strength-of-a-group", "greatest-common-divisor-traversal"]}, {"contest_title": "\u7b2c 106 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 106", "contest_title_slug": "biweekly-contest-106", "contest_id": 879, "contest_start_time": 1686407400, "contest_duration": 5400, "user_num": 2346, "question_slugs": ["check-if-the-number-is-fascinating", "find-the-longest-semi-repetitive-substring", "movement-of-robots", "find-a-good-subset-of-the-matrix"]}, {"contest_title": "\u7b2c 107 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 107", "contest_title_slug": "biweekly-contest-107", "contest_id": 885, "contest_start_time": 1687617000, "contest_duration": 5400, "user_num": 1870, "question_slugs": ["find-maximum-number-of-string-pairs", "construct-the-longest-new-string", "decremental-string-concatenation", "count-zero-request-servers"]}, {"contest_title": "\u7b2c 108 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 108", "contest_title_slug": "biweekly-contest-108", "contest_id": 891, "contest_start_time": 1688826600, "contest_duration": 5400, "user_num": 2349, "question_slugs": ["longest-alternating-subarray", "relocate-marbles", "partition-string-into-minimum-beautiful-substrings", "number-of-black-blocks"]}, {"contest_title": "\u7b2c 109 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 109", "contest_title_slug": "biweekly-contest-109", "contest_id": 897, "contest_start_time": 1690036200, "contest_duration": 5400, "user_num": 2461, "question_slugs": ["check-if-array-is-good", "sort-vowels-in-a-string", "visit-array-positions-to-maximize-score", "ways-to-express-an-integer-as-sum-of-powers"]}, {"contest_title": "\u7b2c 110 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 110", "contest_title_slug": "biweekly-contest-110", "contest_id": 903, "contest_start_time": 1691245800, "contest_duration": 5400, "user_num": 2546, "question_slugs": ["account-balance-after-rounded-purchase", "insert-greatest-common-divisors-in-linked-list", "minimum-seconds-to-equalize-a-circular-array", "minimum-time-to-make-array-sum-at-most-x"]}, {"contest_title": "\u7b2c 111 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 111", "contest_title_slug": "biweekly-contest-111", "contest_id": 909, "contest_start_time": 1692455400, "contest_duration": 5400, "user_num": 2787, "question_slugs": ["count-pairs-whose-sum-is-less-than-target", "make-string-a-subsequence-using-cyclic-increments", "sorting-three-groups", "number-of-beautiful-integers-in-the-range"]}, {"contest_title": "\u7b2c 112 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 112", "contest_title_slug": "biweekly-contest-112", "contest_id": 917, "contest_start_time": 1693665000, "contest_duration": 5400, "user_num": 2900, "question_slugs": ["check-if-strings-can-be-made-equal-with-operations-i", "check-if-strings-can-be-made-equal-with-operations-ii", "maximum-sum-of-almost-unique-subarray", "count-k-subsequences-of-a-string-with-maximum-beauty"]}, {"contest_title": "\u7b2c 113 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 113", "contest_title_slug": "biweekly-contest-113", "contest_id": 923, "contest_start_time": 1694874600, "contest_duration": 5400, "user_num": 3028, "question_slugs": ["minimum-right-shifts-to-sort-the-array", "minimum-array-length-after-pair-removals", "count-pairs-of-points-with-distance-k", "minimum-edge-reversals-so-every-node-is-reachable"]}, {"contest_title": "\u7b2c 114 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 114", "contest_title_slug": "biweekly-contest-114", "contest_id": 929, "contest_start_time": 1696084200, "contest_duration": 5400, "user_num": 2406, "question_slugs": ["minimum-operations-to-collect-elements", "minimum-number-of-operations-to-make-array-empty", "split-array-into-maximum-number-of-subarrays", "maximum-number-of-k-divisible-components"]}, {"contest_title": "\u7b2c 115 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 115", "contest_title_slug": "biweekly-contest-115", "contest_id": 935, "contest_start_time": 1697293800, "contest_duration": 5400, "user_num": 2809, "question_slugs": ["last-visited-integers", "longest-unequal-adjacent-groups-subsequence-i", "longest-unequal-adjacent-groups-subsequence-ii", "count-of-sub-multisets-with-bounded-sum"]}, {"contest_title": "\u7b2c 116 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 116", "contest_title_slug": "biweekly-contest-116", "contest_id": 941, "contest_start_time": 1698503400, "contest_duration": 5400, "user_num": 2904, "question_slugs": ["subarrays-distinct-element-sum-of-squares-i", "minimum-number-of-changes-to-make-binary-string-beautiful", "length-of-the-longest-subsequence-that-sums-to-target", "subarrays-distinct-element-sum-of-squares-ii"]}, {"contest_title": "\u7b2c 117 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 117", "contest_title_slug": "biweekly-contest-117", "contest_id": 949, "contest_start_time": 1699713000, "contest_duration": 5400, "user_num": 2629, "question_slugs": ["distribute-candies-among-children-i", "distribute-candies-among-children-ii", "number-of-strings-which-can-be-rearranged-to-contain-substring", "maximum-spending-after-buying-items"]}, {"contest_title": "\u7b2c 118 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 118", "contest_title_slug": "biweekly-contest-118", "contest_id": 955, "contest_start_time": 1700922600, "contest_duration": 5400, "user_num": 2425, "question_slugs": ["find-words-containing-character", "maximize-area-of-square-hole-in-grid", "minimum-number-of-coins-for-fruits", "find-maximum-non-decreasing-array-length"]}, {"contest_title": "\u7b2c 119 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 119", "contest_title_slug": "biweekly-contest-119", "contest_id": 961, "contest_start_time": 1702132200, "contest_duration": 5400, "user_num": 2472, "question_slugs": ["find-common-elements-between-two-arrays", "remove-adjacent-almost-equal-characters", "length-of-longest-subarray-with-at-most-k-frequency", "number-of-possible-sets-of-closing-branches"]}, {"contest_title": "\u7b2c 120 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 120", "contest_title_slug": "biweekly-contest-120", "contest_id": 967, "contest_start_time": 1703341800, "contest_duration": 5400, "user_num": 2542, "question_slugs": ["count-the-number-of-incremovable-subarrays-i", "find-polygon-with-the-largest-perimeter", "count-the-number-of-incremovable-subarrays-ii", "find-number-of-coins-to-place-in-tree-nodes"]}, {"contest_title": "\u7b2c 121 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 121", "contest_title_slug": "biweekly-contest-121", "contest_id": 973, "contest_start_time": 1704551400, "contest_duration": 5400, "user_num": 2218, "question_slugs": ["smallest-missing-integer-greater-than-sequential-prefix-sum", "minimum-number-of-operations-to-make-array-xor-equal-to-k", "minimum-number-of-operations-to-make-x-and-y-equal", "count-the-number-of-powerful-integers"]}, {"contest_title": "\u7b2c 122 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 122", "contest_title_slug": "biweekly-contest-122", "contest_id": 979, "contest_start_time": 1705761000, "contest_duration": 5400, "user_num": 2547, "question_slugs": ["divide-an-array-into-subarrays-with-minimum-cost-i", "find-if-array-can-be-sorted", "minimize-length-of-array-using-operations", "divide-an-array-into-subarrays-with-minimum-cost-ii"]}, {"contest_title": "\u7b2c 123 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 123", "contest_title_slug": "biweekly-contest-123", "contest_id": 985, "contest_start_time": 1706970600, "contest_duration": 5400, "user_num": 2209, "question_slugs": ["type-of-triangle", "find-the-number-of-ways-to-place-people-i", "maximum-good-subarray-sum", "find-the-number-of-ways-to-place-people-ii"]}, {"contest_title": "\u7b2c 124 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 124", "contest_title_slug": "biweekly-contest-124", "contest_id": 991, "contest_start_time": 1708180200, "contest_duration": 5400, "user_num": 1861, "question_slugs": ["maximum-number-of-operations-with-the-same-score-i", "apply-operations-to-make-string-empty", "maximum-number-of-operations-with-the-same-score-ii", "maximize-consecutive-elements-in-an-array-after-modification"]}, {"contest_title": "\u7b2c 125 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 125", "contest_title_slug": "biweekly-contest-125", "contest_id": 997, "contest_start_time": 1709389800, "contest_duration": 5400, "user_num": 2599, "question_slugs": ["minimum-operations-to-exceed-threshold-value-i", "minimum-operations-to-exceed-threshold-value-ii", "count-pairs-of-connectable-servers-in-a-weighted-tree-network", "find-the-maximum-sum-of-node-values"]}, {"contest_title": "\u7b2c 126 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 126", "contest_title_slug": "biweekly-contest-126", "contest_id": 1003, "contest_start_time": 1710599400, "contest_duration": 5400, "user_num": 3234, "question_slugs": ["find-the-sum-of-encrypted-integers", "mark-elements-on-array-by-performing-queries", "replace-question-marks-in-string-to-minimize-its-value", "find-the-sum-of-the-power-of-all-subsequences"]}, {"contest_title": "\u7b2c 127 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 127", "contest_title_slug": "biweekly-contest-127", "contest_id": 1010, "contest_start_time": 1711809000, "contest_duration": 5400, "user_num": 2950, "question_slugs": ["shortest-subarray-with-or-at-least-k-i", "minimum-levels-to-gain-more-points", "shortest-subarray-with-or-at-least-k-ii", "find-the-sum-of-subsequence-powers"]}, {"contest_title": "\u7b2c 128 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 128", "contest_title_slug": "biweekly-contest-128", "contest_id": 1017, "contest_start_time": 1713018600, "contest_duration": 5400, "user_num": 2653, "question_slugs": ["score-of-a-string", "minimum-rectangles-to-cover-points", "minimum-time-to-visit-disappearing-nodes", "find-the-number-of-subarrays-where-boundary-elements-are-maximum"]}, {"contest_title": "\u7b2c 129 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 129", "contest_title_slug": "biweekly-contest-129", "contest_id": 1023, "contest_start_time": 1714228200, "contest_duration": 5400, "user_num": 2511, "question_slugs": ["make-a-square-with-the-same-color", "right-triangles", "find-all-possible-stable-binary-arrays-i", "find-all-possible-stable-binary-arrays-ii"]}, {"contest_title": "\u7b2c 130 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 130", "contest_title_slug": "biweekly-contest-130", "contest_id": 1029, "contest_start_time": 1715437800, "contest_duration": 5400, "user_num": 2604, "question_slugs": ["check-if-grid-satisfies-conditions", "maximum-points-inside-the-square", "minimum-substring-partition-of-equal-character-frequency", "find-products-of-elements-of-big-array"]}, {"contest_title": "\u7b2c 131 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 131", "contest_title_slug": "biweekly-contest-131", "contest_id": 1035, "contest_start_time": 1716647400, "contest_duration": 5400, "user_num": 2537, "question_slugs": ["find-the-xor-of-numbers-which-appear-twice", "find-occurrences-of-an-element-in-an-array", "find-the-number-of-distinct-colors-among-the-balls", "block-placement-queries"]}, {"contest_title": "\u7b2c 132 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 132", "contest_title_slug": "biweekly-contest-132", "contest_id": 1042, "contest_start_time": 1717857000, "contest_duration": 5400, "user_num": 2457, "question_slugs": ["clear-digits", "find-the-first-player-to-win-k-games-in-a-row", "find-the-maximum-length-of-a-good-subsequence-i", "find-the-maximum-length-of-a-good-subsequence-ii"]}, {"contest_title": "\u7b2c 133 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 133", "contest_title_slug": "biweekly-contest-133", "contest_id": 1048, "contest_start_time": 1719066600, "contest_duration": 5400, "user_num": 2326, "question_slugs": ["find-minimum-operations-to-make-all-elements-divisible-by-three", "minimum-operations-to-make-binary-array-elements-equal-to-one-i", "minimum-operations-to-make-binary-array-elements-equal-to-one-ii", "count-the-number-of-inversions"]}, {"contest_title": "\u7b2c 134 \u573a\u53cc\u5468\u8d5b", "contest_title_en": "Biweekly Contest 134", "contest_title_slug": "biweekly-contest-134", "contest_id": 1055, "contest_start_time": 1720276200, "contest_duration": 5400, "user_num": 2411, "question_slugs": ["alternating-groups-i", "maximum-points-after-enemy-battles", "alternating-groups-ii", "number-of-subarrays-with-and-value-of-k"]}, {"contest_title": "\u7b2c 406 \u573a\u5468\u8d5b", "contest_title_en": "Weekly Contest 406", "contest_title_slug": "weekly-contest-406", "contest_id": 1062, "contest_start_time": 1720924200, "contest_duration": 5400, "user_num": 3421, "question_slugs": ["lexicographically-smallest-string-after-a-swap", "delete-nodes-from-linked-list-present-in-array", "minimum-cost-for-cutting-cake-i", "minimum-cost-for-cutting-cake-ii"]}] \ No newline at end of file