Add solution 0488

halfrost · dezhiy · commit 04eae300bcdc · 2021-11-13T20:41:51.000-08:00
diff --git a/README.md b/README.md
@@ -127,15 +127,15 @@
 |    |  Easy  |  Medium  |  Hard |  Total |
 |:--------:|:--------:|:--------:|:--------:|:--------:|
 |Optimizing|33|45|30|108|
-|Accepted|**279**|**426**|**125**|**830**|
+|Accepted|**279**|**426**|**126**|**831**|
 |Total|527|1107|442|2076|
-|Perfection Rate|88.2%|89.4%|76.0%|87.0%|
-|Completion Rate|52.9%|38.5%|28.3%|40.0%|
+|Perfection Rate|88.2%|89.4%|76.2%|87.0%|
+|Completion Rate|52.9%|38.5%|28.5%|40.0%|
 |------------|----------------------------|----------------------------|----------------------------|----------------------------|
 
 ## 二. 目录
 
-以下已经收录了 725 道题的题解，还有 11 道题在尝试优化到 beats 100%
+以下已经收录了 726 道题的题解，还有 11 道题在尝试优化到 beats 100%
 
 | No.    |  Title  |  Solution  |  Acceptance |  Difficulty |  Frequency |
 |:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:|
@@ -626,7 +626,7 @@
 |0485|Max Consecutive Ones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0485.Max-Consecutive-Ones)|54.4%|Easy||
 |0486|Predict the Winner||49.7%|Medium||
 |0487|Max Consecutive Ones II||48.3%|Medium||
-|0488|Zuma Game||37.6%|Hard||
+|0488|Zuma Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0488.Zuma-Game)|37.6%|Hard||
 |0489|Robot Room Cleaner||74.7%|Hard||
 |0490|The Maze||54.0%|Medium||
 |0491|Increasing Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences)|49.6%|Medium||
@@ -724,7 +724,7 @@
 |0583|Delete Operation for Two Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0583.Delete-Operation-for-Two-Strings)|53.9%|Medium||
 |0584|Find Customer Referee||75.5%|Easy||
 |0585|Investments in 2016||57.9%|Medium||
-|0586|Customer Placing the Largest Number of Orders||75.4%|Easy||
+|0586|Customer Placing the Largest Number of Orders||75.3%|Easy||
 |0587|Erect the Fence||43.3%|Hard||
 |0588|Design In-Memory File System||47.4%|Hard||
 |0589|N-ary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0589.N-ary-Tree-Preorder-Traversal)|75.2%|Easy||
@@ -971,7 +971,7 @@
 |0830|Positions of Large Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0830.Positions-of-Large-Groups)|51.1%|Easy||
 |0831|Masking Personal Information||45.4%|Medium||
 |0832|Flipping an Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0832.Flipping-an-Image)|79.1%|Easy||
-|0833|Find And Replace in String||53.0%|Medium||
+|0833|Find And Replace in String||53.1%|Medium||
 |0834|Sum of Distances in Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree)|52.4%|Hard||
 |0835|Image Overlap||61.3%|Medium||
 |0836|Rectangle Overlap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0836.Rectangle-Overlap)|42.9%|Easy||
@@ -1283,7 +1283,7 @@
 |1142|User Activity for the Past 30 Days II||35.8%|Easy||
 |1143|Longest Common Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1143.Longest-Common-Subsequence)|58.8%|Medium||
 |1144|Decrease Elements To Make Array Zigzag||46.7%|Medium||
-|1145|Binary Tree Coloring Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game)|51.0%|Medium||
+|1145|Binary Tree Coloring Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game)|51.1%|Medium||
 |1146|Snapshot Array||37.1%|Medium||
 |1147|Longest Chunked Palindrome Decomposition||60.2%|Hard||
 |1148|Article Views I||77.1%|Easy||
@@ -1607,7 +1607,7 @@
 |1466|Reorder Routes to Make All Paths Lead to the City Zero||61.4%|Medium||
 |1467|Probability of a Two Boxes Having The Same Number of Distinct Balls||60.9%|Hard||
 |1468|Calculate Salaries||82.7%|Medium||
-|1469|Find All The Lonely Nodes||81.0%|Easy||
+|1469|Find All The Lonely Nodes||81.1%|Easy||
 |1470|Shuffle the Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1470.Shuffle-the-Array)|88.2%|Easy||
 |1471|The k Strongest Values in an Array||59.3%|Medium||
 |1472|Design Browser History||73.9%|Medium||
@@ -1751,7 +1751,7 @@
 |1610|Maximum Number of Visible Points||34.7%|Hard||
 |1611|Minimum One Bit Operations to Make Integers Zero||61.6%|Hard||
 |1612|Check If Two Expression Trees are Equivalent||68.9%|Medium||
-|1613|Find the Missing IDs||76.4%|Medium||
+|1613|Find the Missing IDs||76.3%|Medium||
 |1614|Maximum Nesting Depth of the Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses)|82.8%|Easy||
 |1615|Maximal Network Rank||55.4%|Medium||
 |1616|Split Two Strings to Make Palindrome||31.2%|Medium||
@@ -1799,7 +1799,7 @@
 |1658|Minimum Operations to Reduce X to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero)|33.3%|Medium||
 |1659|Maximize Grid Happiness|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1659.Maximize-Grid-Happiness)|36.8%|Hard||
 |1660|Correct a Binary Tree||73.1%|Medium||
-|1661|Average Time of Process per Machine||80.2%|Easy||
+|1661|Average Time of Process per Machine||80.0%|Easy||
 |1662|Check If Two String Arrays are Equivalent|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent)|82.0%|Easy||
 |1663|Smallest String With A Given Numeric Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value)|64.1%|Medium||
 |1664|Ways to Make a Fair Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1664.Ways-to-Make-a-Fair-Array)|62.4%|Medium||
@@ -1894,7 +1894,7 @@
 |1753|Maximum Score From Removing Stones||64.2%|Medium||
 |1754|Largest Merge Of Two Strings||42.8%|Medium||
 |1755|Closest Subsequence Sum||36.1%|Hard||
-|1756|Design Most Recently Used Queue||77.7%|Medium||
+|1756|Design Most Recently Used Queue||77.8%|Medium||
 |1757|Recyclable and Low Fat Products||95.8%|Easy||
 |1758|Minimum Changes To Make Alternating Binary String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String)|58.8%|Easy||
 |1759|Count Number of Homogenous Substrings||44.7%|Medium||
@@ -2060,7 +2060,7 @@
 |1919|Leetcodify Similar Friends||43.6%|Hard||
 |1920|Build Array from Permutation||92.0%|Easy||
 |1921|Eliminate Maximum Number of Monsters||37.5%|Medium||
-|1922|Count Good Numbers||38.5%|Medium||
+|1922|Count Good Numbers||38.4%|Medium||
 |1923|Longest Common Subpath||27.9%|Hard||
 |1924|Erect the Fence II||62.3%|Hard||
 |1925|Count Square Sum Triples||66.3%|Easy||
@@ -2207,14 +2207,14 @@
 |2066|Account Balance||84.5%|Medium||
 |2067|Number of Equal Count Substrings||64.2%|Medium||
 |2068|Check Whether Two Strings are Almost Equivalent||67.8%|Easy||
-|2069|Walking Robot Simulation II||15.4%|Medium||
-|2070|Most Beautiful Item for Each Query||42.5%|Medium||
-|2071|Maximum Number of Tasks You Can Assign||29.5%|Hard||
-|2072|The Winner University||91.2%|Easy||
-|2073|Time Needed to Buy Tickets||55.9%|Easy||
-|2074|Reverse Nodes in Even Length Groups||37.6%|Medium||
-|2075|Decode the Slanted Ciphertext||46.1%|Medium||
-|2076|Process Restricted Friend Requests||36.1%|Hard||
+|2069|Walking Robot Simulation II||15.5%|Medium||
+|2070|Most Beautiful Item for Each Query||42.6%|Medium||
+|2071|Maximum Number of Tasks You Can Assign||29.4%|Hard||
+|2072|The Winner University||91.9%|Easy||
+|2073|Time Needed to Buy Tickets||56.0%|Easy||
+|2074|Reverse Nodes in Even Length Groups||38.3%|Medium||
+|2075|Decode the Slanted Ciphertext||46.5%|Medium||
+|2076|Process Restricted Friend Requests||37.7%|Hard||
 |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|
 
 ------------------------------------------------------------------
diff --git a/leetcode/0488.Zuma-Game/README.md b/leetcode/0488.Zuma-Game/README.md
@@ -1,4 +1,4 @@
-# [488. Zuma Game](https://leetcode-cn.com/problems/zuma-game/)
+# [488. Zuma Game](https://leetcode.com/problems/zuma-game/)
 
 
 ## 题目
@@ -85,7 +85,9 @@ Explanation: To make the board empty:
 - 使用广度优先搜索和剪枝
 
 ## 代码
+
 ```go
+
 package leetcode
 
 func findMinStep(board string, hand string) int {
diff --git a/website/content/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md b/website/content/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md
@@ -62,5 +62,5 @@ func findMaxConsecutiveOnes(nums []int) int {
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0483.Smallest-Good-Base/">⬅️上一页</a></p>
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0491.Increasing-Subsequences/">下一页➡️</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0488.Zuma-Game/">下一页➡️</a></p>
 </div>
diff --git a/website/content/ChapterFour/0400~0499/0488.Zuma-Game.md b/website/content/ChapterFour/0400~0499/0488.Zuma-Game.md
@@ -0,0 +1,148 @@
+# [488. Zuma Game](https://leetcode.com/problems/zuma-game/)
+
+
+## 题目
+
+You are playing a variation of the game Zuma.
+
+In this variation of Zuma, there is a single row of colored balls on a board, where each ball can be colored red 'R', yellow 'Y', blue 'B', green 'G', or white 'W'. You also have several colored balls in your hand.
+
+Your goal is to clear all of the balls from the board. On each turn:
+
+Pick any ball from your hand and insert it in between two balls in the row or on either end of the row.
+If there is a group of three or more consecutive balls of the same color, remove the group of balls from the board.
+If this removal causes more groups of three or more of the same color to form, then continue removing each group until there are none left.
+If there are no more balls on the board, then you win the game.
+Repeat this process until you either win or do not have any more balls in your hand.
+Given a string board, representing the row of balls on the board, and a string hand, representing the balls in your hand, return the minimum number of balls you have to insert to clear all the balls from the board. If you cannot clear all the balls from the board using the balls in your hand, return -1.
+
+**Example 1**:
+
+```
+Input: board = "WRRBBW", hand = "RB"
+Output: -1
+Explanation: It is impossible to clear all the balls. The best you can do is:
+- Insert 'R' so the board becomes WRRRBBW. WRRRBBW -> WBBW.
+- Insert 'B' so the board becomes WBBBW. WBBBW -> WW.
+There are still balls remaining on the board, and you are out of balls to insert.
+```
+
+**Example 2**:
+```
+Input: board = "WWRRBBWW", hand = "WRBRW"
+Output: 2
+Explanation: To make the board empty:
+- Insert 'R' so the board becomes WWRRRBBWW. WWRRRBBWW -> WWBBWW.
+- Insert 'B' so the board becomes WWBBBWW. WWBBBWW -> WWWW -> empty.
+2 balls from your hand were needed to clear the board.
+```
+
+**Example 3**:
+```
+Input: board = "G", hand = "GGGGG"
+Output: 2
+Explanation: To make the board empty:
+- Insert 'G' so the board becomes GG.
+- Insert 'G' so the board becomes GGG. GGG -> empty.
+2 balls from your hand were needed to clear the board.
+```
+
+**Example 4**:
+```
+Input: board = "RBYYBBRRB", hand = "YRBGB"
+Output: 3
+Explanation: To make the board empty:
+- Insert 'Y' so the board becomes RBYYYBBRRB. RBYYYBBRRB -> RBBBRRB -> RRRB -> B.
+- Insert 'B' so the board becomes BB.
+- Insert 'B' so the board becomes BBB. BBB -> empty.
+3 balls from your hand were needed to clear the board.
+```
+
+**Constraints**:
+
+- 1 <= board.length <= 16
+- 1 <= hand.length <= 5
+- board and hand consist of the characters 'R', 'Y', 'B', 'G', and 'W'.
+- The initial row of balls on the board will not have any groups of three or more consecutive balls of the same color.
+
+## 题目大意
+
+你正在参与祖玛游戏的一个变种。
+
+在这个祖玛游戏变体中，桌面上有 一排 彩球，每个球的颜色可能是：红色 'R'、黄色 'Y'、蓝色 'B'、绿色 'G' 或白色 'W' 。你的手中也有一些彩球。
+
+你的目标是 清空 桌面上所有的球。每一回合：
+
+从你手上的彩球中选出 任意一颗 ，然后将其插入桌面上那一排球中：两球之间或这一排球的任一端。
+接着，如果有出现 三个或者三个以上 且 颜色相同 的球相连的话，就把它们移除掉。
+如果这种移除操作同样导致出现三个或者三个以上且颜色相同的球相连，则可以继续移除这些球，直到不再满足移除条件。
+如果桌面上所有球都被移除，则认为你赢得本场游戏。
+重复这个过程，直到你赢了游戏或者手中没有更多的球。
+给你一个字符串 board ，表示桌面上最开始的那排球。另给你一个字符串 hand ，表示手里的彩球。请你按上述操作步骤移除掉桌上所有球，计算并返回所需的 最少 球数。如果不能移除桌上所有的球，返回 -1 。
+
+## 解题思路
+
+- 使用广度优先搜索和剪枝
+
+## 代码
+
+```go
+
+package leetcode
+
+func findMinStep(board string, hand string) int {
+	q := [][]string{{board, hand}}
+	mp := make(map[string]bool)
+	minStep := 0
+	for len(q) > 0 {
+		length := len(q)
+		minStep++
+		for length > 0 {
+			length--
+			cur := q[0]
+			q = q[1:]
+			curB, curH := cur[0], cur[1]
+			for i := 0; i < len(curB); i++ {
+				for j := 0; j < len(curH); j++ {
+					curB2 := del3(curB[0:i] + string(curH[j]) + curB[i:])
+					curH2 := curH[0:j] + curH[j+1:]
+					if len(curB2) == 0 {
+						return minStep
+					}
+					if _, ok := mp[curB2+curH2]; ok {
+						continue
+					}
+					mp[curB2+curH2] = true
+					q = append(q, []string{curB2, curH2})
+				}
+			}
+		}
+	}
+	return -1
+}
+
+func del3(str string) string {
+	cnt := 1
+	for i := 1; i < len(str); i++ {
+		if str[i] == str[i-1] {
+			cnt++
+		} else {
+			if cnt >= 3 {
+				return del3(str[0:i-cnt] + str[i:])
+			}
+			cnt = 1
+		}
+	}
+	if cnt >= 3 {
+		return str[0 : len(str)-cnt]
+	}
+	return str
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0485.Max-Consecutive-Ones/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0491.Increasing-Subsequences/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/0400~0499/0491.Increasing-Subsequences.md b/website/content/ChapterFour/0400~0499/0491.Increasing-Subsequences.md
@@ -86,6 +86,6 @@ func generateIncSubsets(nums []int, current int, c []int, res *[][]int) {
 
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0485.Max-Consecutive-Ones/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0488.Zuma-Game/">⬅️上一页</a></p>
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0400~0499/0492.Construct-the-Rectangle/">下一页➡️</a></p>
 </div>
diff --git a/website/content/ChapterTwo/Array.md b/website/content/ChapterTwo/Array.md
@@ -306,7 +306,7 @@ weight: 1
 |1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||62.7%|
 |1260|Shift 2D Grid|[Go]({{< relref "/ChapterFour/1200~1299/1260.Shift-2D-Grid.md" >}})|Easy||||62.1%|
 |1266|Minimum Time Visiting All Points|[Go]({{< relref "/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md" >}})|Easy||||79.2%|
-|1268|Search Suggestions System|[Go]({{< relref "/ChapterFour/1200~1299/1268.Search-Suggestions-System.md" >}})|Medium||||65.7%|
+|1268|Search Suggestions System|[Go]({{< relref "/ChapterFour/1200~1299/1268.Search-Suggestions-System.md" >}})|Medium||||65.8%|
 |1275|Find Winner on a Tic Tac Toe Game|[Go]({{< relref "/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md" >}})|Easy||||55.7%|
 |1283|Find the Smallest Divisor Given a Threshold|[Go]({{< relref "/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})|Medium||||52.2%|
 |1287|Element Appearing More Than 25% In Sorted Array|[Go]({{< relref "/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md" >}})|Easy||||59.7%|
diff --git a/website/content/ChapterTwo/Breadth_First_Search.md b/website/content/ChapterTwo/Breadth_First_Search.md
@@ -36,6 +36,7 @@ weight: 10
 |0429|N-ary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md" >}})|Medium||||68.2%|
 |0433|Minimum Genetic Mutation|[Go]({{< relref "/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md" >}})|Medium||||44.9%|
 |0463|Island Perimeter|[Go]({{< relref "/ChapterFour/0400~0499/0463.Island-Perimeter.md" >}})|Easy||||68.4%|
+|0488|Zuma Game|[Go]({{< relref "/ChapterFour/0400~0499/0488.Zuma-Game.md" >}})|Hard||||37.6%|
 |0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||64.1%|
 |0515|Find Largest Value in Each Tree Row|[Go]({{< relref "/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})|Medium| O(n)| O(n)||63.7%|
 |0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||63.5%|
diff --git a/website/content/ChapterTwo/Dynamic_Programming.md b/website/content/ChapterTwo/Dynamic_Programming.md
@@ -58,6 +58,7 @@ weight: 7
 |0435|Non-overlapping Intervals|[Go]({{< relref "/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md" >}})|Medium||||46.5%|
 |0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.3%|
 |0474|Ones and Zeroes|[Go]({{< relref "/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md" >}})|Medium||||44.0%|
+|0488|Zuma Game|[Go]({{< relref "/ChapterFour/0400~0499/0488.Zuma-Game.md" >}})|Hard||||37.6%|
 |0494|Target Sum|[Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}})|Medium||||45.3%|
 |0509|Fibonacci Number|[Go]({{< relref "/ChapterFour/0500~0599/0509.Fibonacci-Number.md" >}})|Easy||||67.8%|
 |0518|Coin Change 2|[Go]({{< relref "/ChapterFour/0500~0599/0518.Coin-Change-2.md" >}})|Medium||||55.2%|
diff --git a/website/content/ChapterTwo/String.md b/website/content/ChapterTwo/String.md
@@ -74,6 +74,7 @@ weight: 2
 |0438|Find All Anagrams in a String|[Go]({{< relref "/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md" >}})|Medium||||46.6%|
 |0451|Sort Characters By Frequency|[Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}})|Medium||||66.8%|
 |0474|Ones and Zeroes|[Go]({{< relref "/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md" >}})|Medium||||44.0%|
+|0488|Zuma Game|[Go]({{< relref "/ChapterFour/0400~0499/0488.Zuma-Game.md" >}})|Hard||||37.6%|
 |0500|Keyboard Row|[Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}})|Easy||||67.1%|
 |0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium||||50.7%|
 |0535|Encode and Decode TinyURL|[Go]({{< relref "/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md" >}})|Medium||||83.1%|
@@ -153,7 +154,7 @@ weight: 2
 |1234|Replace the Substring for Balanced String|[Go]({{< relref "/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md" >}})|Medium||||35.5%|
 |1239|Maximum Length of a Concatenated String with Unique Characters|[Go]({{< relref "/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md" >}})|Medium||||50.6%|
 |1249|Minimum Remove to Make Valid Parentheses|[Go]({{< relref "/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md" >}})|Medium||||65.0%|
-|1268|Search Suggestions System|[Go]({{< relref "/ChapterFour/1200~1299/1268.Search-Suggestions-System.md" >}})|Medium||||65.7%|
+|1268|Search Suggestions System|[Go]({{< relref "/ChapterFour/1200~1299/1268.Search-Suggestions-System.md" >}})|Medium||||65.8%|
 |1332|Remove Palindromic Subsequences|[Go]({{< relref "/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md" >}})|Easy||||69.1%|
 |1396|Design Underground System|[Go]({{< relref "/ChapterFour/1300~1399/1396.Design-Underground-System.md" >}})|Medium||||71.7%|
 |1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence|[Go]({{< relref "/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md" >}})|Easy||||64.4%|
