add new problems

cmd/main.go

@@ -33,6 +33,8 @@ func main() {
 	//leetcode.MakeDirFromTo(problems, 2301, 2400)
 	//leetcode.MakeDirFromTo(problems, 2401, 2500)
 	//leetcode.MakeDirFromTo(problems, 2901, 3000)
+	//leetcode.MakeDirFromTo(problems, 3101, 3200)
+	//leetcode.MakeDirFromTo(problems, 3201, 3300)
 
 	// leetcode.MakeDir(problems)
 

go.sum

@@ -1,14 +1,11 @@
 github.com/andybalholm/brotli v1.1.0 h1:eLKJA0d02Lf0mVpIDgYnqXcUn0GqVmEFny3VuID1U3M=
 github.com/andybalholm/brotli v1.1.0/go.mod h1:sms7XGricyQI9K10gOSf56VKKWS4oLer58Q+mhRPtnY=
-github.com/cloudflare/circl v1.3.8 h1:j+V8jJt09PoeMFIu2uh5JUyEaIHTXVOHslFoLNAKqwI=
-github.com/cloudflare/circl v1.3.8/go.mod h1:PDRU+oXvdD7KCtgKxW95M5Z8BpSCJXQORiZFnBQS5QU=
 github.com/cloudflare/circl v1.3.9 h1:QFrlgFYf2Qpi8bSpVPK1HBvWpx16v/1TZivyo7pGuBE=
 github.com/cloudflare/circl v1.3.9/go.mod h1:PDRU+oXvdD7KCtgKxW95M5Z8BpSCJXQORiZFnBQS5QU=
 github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=
 github.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
 github.com/go-logr/logr v1.4.1 h1:pKouT5E8xu9zeFC39JXRDukb6JFQPXM5p5I91188VAQ=
 github.com/go-logr/logr v1.4.1/go.mod h1:9T104GzyrTigFIr8wt5mBrctHMim0Nb2HLGrmQ40KvY=
-github.com/go-task/slim-sprig v0.0.0-20230315185526-52ccab3ef572 h1:tfuBGBXKqDEevZMzYi5KSi8KkcZtzBcTgAUUtapy0OI=
 github.com/go-task/slim-sprig/v3 v3.0.0 h1:sUs3vkvUymDpBKi3qH1YSqBQk9+9D/8M2mN1vB6EwHI=
 github.com/go-task/slim-sprig/v3 v3.0.0/go.mod h1:W848ghGpv3Qj3dhTPRyJypKRiqCdHZiAzKg9hl15HA8=
 github.com/google/go-cmp v0.6.0 h1:ofyhxvXcZhMsU5ulbFiLKl/XBFqE1GSq7atu8tAmTRI=
@@ -22,8 +19,6 @@ github.com/hashicorp/go-multierror v1.1.1 h1:H5DkEtf6CXdFp0N0Em5UCwQpXMWke8IA0+l
 github.com/hashicorp/go-multierror v1.1.1/go.mod h1:iw975J/qwKPdAO1clOe2L8331t/9/fmwbPZ6JB6eMoM=
 github.com/imroc/req/v3 v3.43.7 h1:dOcNb9n0X83N5/5/AOkiU+cLhzx8QFXjv5MhikazzQA=
 github.com/imroc/req/v3 v3.43.7/go.mod h1:SQIz5iYop16MJxbo8ib+4LnostGCok8NQf8ToyQc2xA=
-github.com/klauspost/compress v1.17.8 h1:YcnTYrq7MikUT7k0Yb5eceMmALQPYBW/Xltxn0NAMnU=
-github.com/klauspost/compress v1.17.8/go.mod h1:Di0epgTjJY877eYKx5yC51cX2A2Vl2ibi7bDH9ttBbw=
 github.com/klauspost/compress v1.17.9 h1:6KIumPrER1LHsvBVuDa0r5xaG0Es51mhhB9BQB2qeMA=
 github.com/klauspost/compress v1.17.9/go.mod h1:Di0epgTjJY877eYKx5yC51cX2A2Vl2ibi7bDH9ttBbw=
 github.com/onsi/ginkgo/v2 v2.19.0 h1:9Cnnf7UHo57Hy3k6/m5k3dRfGTMXGvxhHFvkDTCTpvA=
@@ -44,8 +39,6 @@ go.uber.org/mock v0.4.0 h1:VcM4ZOtdbR4f6VXfiOpwpVJDL6lCReaZ6mw31wqh7KU=
 go.uber.org/mock v0.4.0/go.mod h1:a6FSlNadKUHUa9IP5Vyt1zh4fC7uAwxMutEAscFbkZc=
 golang.org/x/crypto v0.24.0 h1:mnl8DM0o513X8fdIkmyFE/5hTYxbwYOjDS/+rK6qpRI=
 golang.org/x/crypto v0.24.0/go.mod h1:Z1PMYSOR5nyMcyAVAIQSKCDwalqy85Aqn1x3Ws4L5DM=
-golang.org/x/exp v0.0.0-20240604190554-fc45aab8b7f8 h1:LoYXNGAShUG3m/ehNk4iFctuhGX/+R1ZpfJ4/ia80JM=
-golang.org/x/exp v0.0.0-20240604190554-fc45aab8b7f8/go.mod h1:jj3sYF3dwk5D+ghuXyeI3r5MFf+NT2An6/9dOA95KSI=
 golang.org/x/exp v0.0.0-20240613232115-7f521ea00fb8 h1:yixxcjnhBmY0nkL253HFVIm0JsFHwrHdT3Yh6szTnfY=
 golang.org/x/exp v0.0.0-20240613232115-7f521ea00fb8/go.mod h1:jj3sYF3dwk5D+ghuXyeI3r5MFf+NT2An6/9dOA95KSI=
 golang.org/x/mod v0.18.0 h1:5+9lSbEzPSdWkH32vYPBwEpX8KwDbM52Ud9xBUvNlb0=

leetcode/3101-3200/3101.Count-Alternating-Subarrays/README.md

@@ -0,0 +1,32 @@
+# [3101.Count Alternating Subarrays][title]
+
+> [!WARNING|style:flat]
+> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+## Description
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+Count Alternating Subarrays
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/count-alternating-subarrays/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3101-3200/3101.Count-Alternating-Subarrays/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+	return x
+}

leetcode/3101-3200/3101.Count-Alternating-Subarrays/Solution_test.go

@@ -0,0 +1,39 @@
+package Solution
+
+import (
+	"reflect"
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs bool
+		expect bool
+	}{
+		{"TestCase", true, true},
+		{"TestCase", true, true},
+		{"TestCase", false, false},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
+			got := Solution(c.inputs)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.inputs)
+			}
+		})
+	}
+}
+
+//	压力测试
+func BenchmarkSolution(b *testing.B) {
+}
+
+//	使用案列
+func ExampleSolution() {
+}

leetcode/3101-3200/3102.Minimize-Manhattan-Distances/README.md

@@ -0,0 +1,32 @@
+# [3102.Minimize Manhattan Distances][title]
+
+> [!WARNING|style:flat]
+> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+## Description
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+Minimize Manhattan Distances
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/minimize-manhattan-distances/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3101-3200/3102.Minimize-Manhattan-Distances/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+	return x
+}

leetcode/3101-3200/3102.Minimize-Manhattan-Distances/Solution_test.go

@@ -0,0 +1,39 @@
+package Solution
+
+import (
+	"reflect"
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs bool
+		expect bool
+	}{
+		{"TestCase", true, true},
+		{"TestCase", true, true},
+		{"TestCase", false, false},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
+			got := Solution(c.inputs)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.inputs)
+			}
+		})
+	}
+}
+
+//	压力测试
+func BenchmarkSolution(b *testing.B) {
+}
+
+//	使用案列
+func ExampleSolution() {
+}

leetcode/3101-3200/3105.Longest-Strictly-Increasing-or-Strictly-Decreasing-Subarray/README.md

@@ -0,0 +1,32 @@
+# [3105.Longest Strictly Increasing or Strictly Decreasing Subarray][title]
+
+> [!WARNING|style:flat]
+> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+## Description
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+Longest Strictly Increasing or Strictly Decreasing Subarray
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3101-3200/3105.Longest-Strictly-Increasing-or-Strictly-Decreasing-Subarray/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+	return x
+}

leetcode/3101-3200/3105.Longest-Strictly-Increasing-or-Strictly-Decreasing-Subarray/Solution_test.go

@@ -0,0 +1,39 @@
+package Solution
+
+import (
+	"reflect"
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs bool
+		expect bool
+	}{
+		{"TestCase", true, true},
+		{"TestCase", true, true},
+		{"TestCase", false, false},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
+			got := Solution(c.inputs)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.inputs)
+			}
+		})
+	}
+}
+
+//	压力测试
+func BenchmarkSolution(b *testing.B) {
+}
+
+//	使用案列
+func ExampleSolution() {
+}

leetcode/3101-3200/3106.Lexicographically-Smallest-String-After-Operations-With-Constraint/README.md

@@ -0,0 +1,32 @@
+# [3106.Lexicographically Smallest String After Operations With Constraint][title]
+
+> [!WARNING|style:flat]
+> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+## Description
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+Lexicographically Smallest String After Operations With Constraint
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/lexicographically-smallest-string-after-operations-with-constraint/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3101-3200/3106.Lexicographically-Smallest-String-After-Operations-With-Constraint/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+	return x
+}

leetcode/3101-3200/3106.Lexicographically-Smallest-String-After-Operations-With-Constraint/Solution_test.go

@@ -0,0 +1,39 @@
+package Solution
+
+import (
+	"reflect"
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs bool
+		expect bool
+	}{
+		{"TestCase", true, true},
+		{"TestCase", true, true},
+		{"TestCase", false, false},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
+			got := Solution(c.inputs)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.inputs)
+			}
+		})
+	}
+}
+
+//	压力测试
+func BenchmarkSolution(b *testing.B) {
+}
+
+//	使用案列
+func ExampleSolution() {
+}

leetcode/3101-3200/3107.Minimum-Operations-to-Make-Median-of-Array-Equal-to-K/README.md

@@ -0,0 +1,32 @@
+# [3107.Minimum Operations to Make Median of Array Equal to K][title]
+
+> [!WARNING|style:flat]
+> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+## Description
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+Minimum Operations to Make Median of Array Equal to K
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/minimum-operations-to-make-median-of-array-equal-to-k/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3101-3200/3107.Minimum-Operations-to-Make-Median-of-Array-Equal-to-K/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+	return x
+}