add 3301-3400 problems

cmd/main.go

@@ -35,6 +35,7 @@ func main() {
 	//leetcode.MakeDirFromTo(problems, 2901, 3000)
 	//leetcode.MakeDirFromTo(problems, 3101, 3200)
 	//leetcode.MakeDirFromTo(problems, 3201, 3300)
+	leetcode.MakeDirFromTo(problems, 3301, 3400)
 
 	// leetcode.MakeDir(problems)
 

leetcode/3301-3400/3301.Maximize-the-Total-Height-of-Unique-Towers/README.md

@@ -0,0 +1,32 @@
+# [3301.Maximize the Total Height of Unique Towers][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
+> ...
+Maximize the Total Height of Unique Towers
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/maximize-the-total-height-of-unique-towers/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3301-3400/3301.Maximize-the-Total-Height-of-Unique-Towers/Solution.go

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

leetcode/3301-3400/3301.Maximize-the-Total-Height-of-Unique-Towers/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/3301-3400/3302.Find-the-Lexicographically-Smallest-Valid-Sequence/README.md

@@ -0,0 +1,32 @@
+# [3302.Find the Lexicographically Smallest Valid Sequence][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
+> ...
+Find the Lexicographically Smallest Valid Sequence
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/find-the-lexicographically-smallest-valid-sequence/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3301-3400/3302.Find-the-Lexicographically-Smallest-Valid-Sequence/Solution.go

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

leetcode/3301-3400/3302.Find-the-Lexicographically-Smallest-Valid-Sequence/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/3301-3400/3303.Find-the-Occurrence-of-First-Almost-Equal-Substring/README.md

@@ -0,0 +1,32 @@
+# [3303.Find the Occurrence of First Almost Equal Substring][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
+> ...
+Find the Occurrence of First Almost Equal Substring
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/find-the-occurrence-of-first-almost-equal-substring/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3301-3400/3303.Find-the-Occurrence-of-First-Almost-Equal-Substring/Solution.go

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

leetcode/3301-3400/3303.Find-the-Occurrence-of-First-Almost-Equal-Substring/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/3301-3400/3304.Find-the-K-th-Character-in-String-Game-I/README.md

@@ -0,0 +1,32 @@
+# [3304.Find the K-th Character in String Game I][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
+> ...
+Find the K-th Character in String Game I
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/find-the-k-th-character-in-string-game-i/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3301-3400/3304.Find-the-K-th-Character-in-String-Game-I/Solution.go

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

leetcode/3301-3400/3304.Find-the-K-th-Character-in-String-Game-I/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/3301-3400/3305.Count-of-Substrings-Containing-Every-Vowel-and-K-Consonants-I/README.md

@@ -0,0 +1,32 @@
+# [3305.Count of Substrings Containing Every Vowel and K Consonants I][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 of Substrings Containing Every Vowel and K Consonants I
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3301-3400/3305.Count-of-Substrings-Containing-Every-Vowel-and-K-Consonants-I/Solution.go

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