Skip to content

Commit c92b576

Browse files
halfrosthalfrost
committed
Add solution 535
1 parent 096f514 commit c92b576

24 files changed

+345
-165
lines changed

‎README.md

+127-127
Large diffs are not rendered by default.

‎ctl/template/template.markdown

+1
Original file line numberDiff line numberDiff line change
@@ -16,6 +16,7 @@
1616
<a href="https://travis-ci.org/github/halfrost/LeetCode-Go" rel="nofollow"><img src="https://travis-ci.org/halfrost/LeetCode-Go.svg?branch=master"></a>
1717
<a href="https://goreportcard.com/report/github.com/halfrost/LeetCode-Go" rel="nofollow"><img src="https://goreportcard.com/badge/github.com/halfrost/LeetCode-Go"></a>
1818
<img src="https://img.shields.io/badge/runtime%20beats-100%25-success">
19+
<a href="https://codecov.io/gh/halfrost/LeetCode-Go"><img src="https://codecov.io/gh/halfrost/LeetCode-Go/branch/master/graph/badge.svg" /></a>
1920
<!--<img alt="GitHub go.mod Go version" src="https://img.shields.io/github/go-mod/go-version/halfrost/LeetCode-Go?color=26C2F0">-->
2021
<img alt="Support Go version" src="https://img.shields.io/badge/Go-v1.15-26C2F0">
2122
<img src="https://visitor-badge.laobi.icu/badge?page_id=halfrost.LeetCode-Go">

‎leetcode/0535.Encode-and-Decode-TinyURL/535. Encode and Decode TinyURL.go

+35
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
package leetcode
2+
3+
import (
4+
"fmt"
5+
"strconv"
6+
"strings"
7+
)
8+
9+
type Codec struct {
10+
urls []string
11+
}
12+
13+
func Constructor() Codec {
14+
return Codec{[]string{}}
15+
}
16+
17+
// Encodes a URL to a shortened URL.
18+
func (this *Codec) encode(longUrl string) string {
19+
this.urls = append(this.urls, longUrl)
20+
return "http://tinyurl.com/" + fmt.Sprintf("%v", len(this.urls)-1)
21+
}
22+
23+
// Decodes a shortened URL to its original URL.
24+
func (this *Codec) decode(shortUrl string) string {
25+
tmp := strings.Split(shortUrl, "/")
26+
i, _ := strconv.Atoi(tmp[len(tmp)-1])
27+
return this.urls[i]
28+
}
29+
30+
/**
31+
* Your Codec object will be instantiated and called as such:
32+
* obj := Constructor();
33+
* url := obj.encode(longUrl);
34+
* ans := obj.decode(url);
35+
*/

‎leetcode/0535.Encode-and-Decode-TinyURL/535. Encode and Decode TinyURL_test.go

+15
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
package leetcode
2+
3+
import (
4+
"fmt"
5+
"testing"
6+
)
7+
8+
func Test_Problem535(t *testing.T) {
9+
obj := Constructor()
10+
fmt.Printf("obj = %v\n", obj)
11+
e := obj.encode("https://leetcode.com/problems/design-tinyurl")
12+
fmt.Printf("obj encode = %v\n", e)
13+
d := obj.decode(e)
14+
fmt.Printf("obj decode = %v\n", d)
15+
}

‎leetcode/0535.Encode-and-Decode-TinyURL/README.md

+60
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,60 @@
1+
# [535. Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/)
2+
3+
4+
## 题目
5+
6+
> Note: This is a companion problem to the System Design problem: Design TinyURL.
7+
8+
TinyURL is a URL shortening service where you enter a URL such as `https://leetcode.com/problems/design-tinyurl` and it returns a short URL such as `http://tinyurl.com/4e9iAk`.
9+
10+
Design the `encode` and `decode` methods for the TinyURL service. There is no restriction on how your encode/decode algorithm should work. You just need to ensure that a URL can be encoded to a tiny URL and the tiny URL can be decoded to the original URL.
11+
12+
## 题目大意
13+
14+
TinyURL是一种URL简化服务， 比如：当你输入一个URL [https://leetcode.com/problems/design-tinyurl](https://leetcode.com/problems/design-tinyurl) 时，它将返回一个简化的URL [http://tinyurl.com/4e9iAk](http://tinyurl.com/4e9iAk).
15+
16+
要求：设计一个 TinyURL 的加密 encode 和解密 decode 的方法。你的加密和解密算法如何设计和运作是没有限制的，你只需要保证一个URL可以被加密成一个TinyURL，并且这个TinyURL可以用解密方法恢复成原本的URL。
17+
18+
## 解题思路
19+
20+
- 简单题。由于题目并无规定 `encode()` 算法，所以自由度非常高。最简单的做法是把原始 `URL` 存起来，并记录下存在字符串数组中的下标位置。`decode()` 的时候根据存储的下标还原原始的 `URL`。
21+
22+
## 代码
23+
24+
```go
25+
package leetcode
26+
27+
import (
28+
"fmt"
29+
"strconv"
30+
"strings"
31+
)
32+
33+
type Codec struct {
34+
urls []string
35+
}
36+
37+
func Constructor() Codec {
38+
return Codec{[]string{}}
39+
}
40+
41+
// Encodes a URL to a shortened URL.
42+
func (this *Codec) encode(longUrl string) string {
43+
this.urls = append(this.urls, longUrl)
44+
return "http://tinyurl.com/" + fmt.Sprintf("%v", len(this.urls)-1)
45+
}
46+
47+
// Decodes a shortened URL to its original URL.
48+
func (this *Codec) decode(shortUrl string) string {
49+
tmp := strings.Split(shortUrl, "/")
50+
i, _ := strconv.Atoi(tmp[len(tmp)-1])
51+
return this.urls[i]
52+
}
53+
54+
/**
55+
* Your Codec object will be instantiated and called as such:
56+
* obj := Constructor();
57+
* url := obj.encode(longUrl);
58+
* ans := obj.decode(url);
59+
*/
60+
```

‎website/content/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -98,5 +98,5 @@ func findPairs(nums []int, k int) int {
9898
----------------------------------------------
9999
<div style="display: flex;justify-content: space-between;align-items: center;">
100100
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0529.Minesweeper/">⬅️上一页</a></p>
101-
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0537.Complex-Number-Multiplication/">下一页➡️</a></p>
101+
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL/">下一页➡️</a></p>
102102
</div>

‎website/content/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md

+67
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,67 @@
1+
# [535. Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/)
2+
3+
4+
## 题目
5+
6+
> Note: This is a companion problem to the System Design problem: Design TinyURL.
7+
8+
TinyURL is a URL shortening service where you enter a URL such as `https://leetcode.com/problems/design-tinyurl` and it returns a short URL such as `http://tinyurl.com/4e9iAk`.
9+
10+
Design the `encode` and `decode` methods for the TinyURL service. There is no restriction on how your encode/decode algorithm should work. You just need to ensure that a URL can be encoded to a tiny URL and the tiny URL can be decoded to the original URL.
11+
12+
## 题目大意
13+
14+
TinyURL是一种URL简化服务， 比如：当你输入一个URL [https://leetcode.com/problems/design-tinyurl](https://leetcode.com/problems/design-tinyurl) 时，它将返回一个简化的URL [http://tinyurl.com/4e9iAk](http://tinyurl.com/4e9iAk).
15+
16+
要求：设计一个 TinyURL 的加密 encode 和解密 decode 的方法。你的加密和解密算法如何设计和运作是没有限制的，你只需要保证一个URL可以被加密成一个TinyURL，并且这个TinyURL可以用解密方法恢复成原本的URL。
17+
18+
## 解题思路
19+
20+
- 简单题。由于题目并无规定 `encode()` 算法，所以自由度非常高。最简单的做法是把原始 `URL` 存起来，并记录下存在字符串数组中的下标位置。`decode()` 的时候根据存储的下标还原原始的 `URL`。
21+
22+
## 代码
23+
24+
```go
25+
package leetcode
26+
27+
import (
28+
"fmt"
29+
"strconv"
30+
"strings"
31+
)
32+
33+
type Codec struct {
34+
urls []string
35+
}
36+
37+
func Constructor() Codec {
38+
return Codec{[]string{}}
39+
}
40+
41+
// Encodes a URL to a shortened URL.
42+
func (this *Codec) encode(longUrl string) string {
43+
this.urls = append(this.urls, longUrl)
44+
return "http://tinyurl.com/" + fmt.Sprintf("%v", len(this.urls)-1)
45+
}
46+
47+
// Decodes a shortened URL to its original URL.
48+
func (this *Codec) decode(shortUrl string) string {
49+
tmp := strings.Split(shortUrl, "/")
50+
i, _ := strconv.Atoi(tmp[len(tmp)-1])
51+
return this.urls[i]
52+
}
53+
54+
/**
55+
* Your Codec object will be instantiated and called as such:
56+
* obj := Constructor();
57+
* url := obj.encode(longUrl);
58+
* ans := obj.decode(url);
59+
*/
60+
```
61+
62+
63+
----------------------------------------------
64+
<div style="display: flex;justify-content: space-between;align-items: center;">
65+
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array/">⬅️上一页</a></p>
66+
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0537.Complex-Number-Multiplication/">下一页➡️</a></p>
67+
</div>

‎website/content/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -75,6 +75,6 @@ func parse(s string) (int, int) {
7575

7676
----------------------------------------------
7777
<div style="display: flex;justify-content: space-between;align-items: center;">
78-
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array/">⬅️上一页</a></p>
78+
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL/">⬅️上一页</a></p>
7979
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree/">下一页➡️</a></p>
8080
</div>

‎website/content/ChapterTwo/Array.md

+9-9
Original file line numberDiff line numberDiff line change
@@ -113,7 +113,7 @@ weight: 1
113113
|0985|Sum of Even Numbers After Queries|[Go]({{< relref "/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md" >}})|Easy||||60.7%|
114114
|0989|Add to Array-Form of Integer|[Go]({{< relref "/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md" >}})|Easy||||44.9%|
115115
|0999|Available Captures for Rook|[Go]({{< relref "/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md" >}})|Easy||||67.8%|
116-
|1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.6%|
116+
|1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.7%|
117117
|1011|Capacity To Ship Packages Within D Days|[Go]({{< relref "/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})|Medium||||59.7%|
118118
|1018|Binary Prefix Divisible By 5|[Go]({{< relref "/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md" >}})|Easy||||47.8%|
119119
|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||54.1%|
@@ -137,29 +137,29 @@ weight: 1
137137
|1260|Shift 2D Grid|[Go]({{< relref "/ChapterFour/1200~1299/1260.Shift-2D-Grid.md" >}})|Easy||||61.8%|
138138
|1266|Minimum Time Visiting All Points|[Go]({{< relref "/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md" >}})|Easy||||79.3%|
139139
|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||||52.9%|
140-
|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||||60.1%|
140+
|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||||60.2%|
141141
|1295|Find Numbers with Even Number of Digits|[Go]({{< relref "/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md" >}})|Easy||||78.9%|
142142
|1299|Replace Elements with Greatest Element on Right Side|[Go]({{< relref "/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md" >}})|Easy||||74.6%|
143143
|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.0%|
144144
|1304|Find N Unique Integers Sum up to Zero|[Go]({{< relref "/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md" >}})|Easy||||76.8%|
145145
|1313|Decompress Run-Length Encoded List|[Go]({{< relref "/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md" >}})|Easy||||85.4%|
146146
|1329|Sort the Matrix Diagonally|[Go]({{< relref "/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md" >}})|Medium||||81.8%|
147147
|1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||72.0%|
148-
|1380|Lucky Numbers in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md" >}})|Easy||||70.6%|
148+
|1380|Lucky Numbers in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md" >}})|Easy||||70.5%|
149149
|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||66.4%|
150150
|1389|Create Target Array in the Given Order|[Go]({{< relref "/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md" >}})|Easy||||84.8%|
151151
|1423|Maximum Points You Can Obtain from Cards|[Go]({{< relref "/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md" >}})|Medium||||46.7%|
152152
|1437|Check If All 1's Are at Least Length K Places Away|[Go]({{< relref "/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md" >}})|Easy||||62.3%|
153153
|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit|[Go]({{< relref "/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md" >}})|Medium||||44.4%|
154-
|1464|Maximum Product of Two Elements in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md" >}})|Easy||||77.2%|
154+
|1464|Maximum Product of Two Elements in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md" >}})|Easy||||77.1%|
155155
|1470|Shuffle the Array|[Go]({{< relref "/ChapterFour/1400~1499/1470.Shuffle-the-Array.md" >}})|Easy||||88.2%|
156156
|1480|Running Sum of 1d Array|[Go]({{< relref "/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md" >}})|Easy||||88.9%|
157157
|1512|Number of Good Pairs|[Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}})|Easy||||87.7%|
158158
|1539|Kth Missing Positive Number|[Go]({{< relref "/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md" >}})|Easy||||55.0%|
159-
|1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||61.4%|
159+
|1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||61.3%|
160160
|1619|Mean of Array After Removing Some Elements|[Go]({{< relref "/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md" >}})|Easy||||64.9%|
161161
|1629|Slowest Key|[Go]({{< relref "/ChapterFour/1600~1699/1629.Slowest-Key.md" >}})|Easy||||59.1%|
162-
|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||66.8%|
162+
|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||66.9%|
163163
|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||59.9%|
164164
|1646|Get Maximum in Generated Array|[Go]({{< relref "/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md" >}})|Easy||||53.3%|
165165
|1652|Defuse the Bomb|[Go]({{< relref "/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md" >}})|Easy||||62.4%|
@@ -168,9 +168,9 @@ weight: 1
168168
|1700|Number of Students Unable to Eat Lunch|[Go]({{< relref "/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})|Easy||||68.1%|
169169
|1732|Find the Highest Altitude|[Go]({{< relref "/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md" >}})|Easy||||80.5%|
170170
|1742|Maximum Number of Balls in a Box|[Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}})|Easy||||74.5%|
171-
|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||75.2%|
172-
|1752|Check if Array Is Sorted and Rotated|[Go]({{< relref "/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md" >}})|Easy||||62.9%|
173-
|1758|Minimum Changes To Make Alternating Binary String|[Go]({{< relref "/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md" >}})|Easy||||58.7%|
171+
|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||75.3%|
172+
|1752|Check if Array Is Sorted and Rotated|[Go]({{< relref "/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md" >}})|Easy||||62.8%|
173+
|1758|Minimum Changes To Make Alternating Binary String|[Go]({{< relref "/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md" >}})|Easy||||58.6%|
174174
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
175175

176176

‎website/content/ChapterTwo/Backtracking.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -119,7 +119,7 @@ func updateMatrix_BFS(matrix [][]int) [][]int {
119119
|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|23.8%|
120120
|0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium| O(n)| O(n^2)|❤️|52.3%|
121121
|0211|Design Add and Search Words Data Structure|[Go]({{< relref "/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md" >}})|Medium| O(n)| O(n)|❤️|40.3%|
122-
|0212|Word Search II|[Go]({{< relref "/ChapterFour/0200~0299/0212.Word-Search-II.md" >}})|Hard| O(n^2)| O(n^2)|❤️|37.2%|
122+
|0212|Word Search II|[Go]({{< relref "/ChapterFour/0200~0299/0212.Word-Search-II.md" >}})|Hard| O(n^2)| O(n^2)|❤️|37.3%|
123123
|0216|Combination Sum III|[Go]({{< relref "/ChapterFour/0200~0299/0216.Combination-Sum-III.md" >}})|Medium| O(n)| O(1)|❤️|60.4%|
124124
|0306|Additive Number|[Go]({{< relref "/ChapterFour/0300~0399/0306.Additive-Number.md" >}})|Medium| O(n^2)| O(1)|❤️|29.7%|
125125
|0357|Count Numbers with Unique Digits|[Go]({{< relref "/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md" >}})|Medium| O(1)| O(1)||48.9%|
@@ -130,7 +130,7 @@ func updateMatrix_BFS(matrix [][]int) [][]int {
130130
|0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard| O(n log n)| O(n)||77.1%|
131131
|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard| O(n log n)| O(n) ||48.5%|
132132
|1079|Letter Tile Possibilities|[Go]({{< relref "/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md" >}})|Medium| O(n^2)| O(1)|❤️|75.9%|
133-
|1641|Count Sorted Vowel Strings|[Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}})|Medium||||76.2%|
133+
|1641|Count Sorted Vowel Strings|[Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}})|Medium||||76.1%|
134134
|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||40.0%|
135135
|1659|Maximize Grid Happiness|[Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}})|Hard||||35.6%|
136136
|1681|Minimum Incompatibility|[Go]({{< relref "/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md" >}})|Hard||||35.7%|

‎website/content/ChapterTwo/Binary_Search.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -196,7 +196,7 @@ func peakIndexInMountainArray(A []int) int {
196196
|1283|Find the Smallest Divisor Given a Threshold|[Go]({{< relref "/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})|Medium||||49.7%|
197197
|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.0%|
198198
|1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||72.0%|
199-
|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||50.1%|
199+
|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||50.0%|
200200
|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||36.4%|
201201
|1658|Minimum Operations to Reduce X to Zero|[Go]({{< relref "/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md" >}})|Medium||||33.3%|
202202
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|

0 commit comments

Comments
 (0)