add new problems

Author: 0xff-dev

leetcode/3501-3600/3501.Maximize-Active-Section-with-Trade-II/README.md

@@ -0,0 +1,32 @@
+# [3501.Maximize Active Section with Trade II][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 Active Section with Trade II
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/maximize-active-section-with-trade-ii/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3501-3600/3501.Maximize-Active-Section-with-Trade-II/Solution.go

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

leetcode/3501-3600/3501.Maximize-Active-Section-with-Trade-II/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/3501-3600/3502.Minimum-Cost-to-Reach-Every-Position/README.md

@@ -0,0 +1,32 @@
+# [3502.Minimum Cost to Reach Every Position][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 Cost to Reach Every Position
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/minimum-cost-to-reach-every-position/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3501-3600/3502.Minimum-Cost-to-Reach-Every-Position/Solution.go

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

leetcode/3501-3600/3502.Minimum-Cost-to-Reach-Every-Position/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/3501-3600/3503.Longest-Palindrome-After-Substring-Concatenation-I/README.md

@@ -0,0 +1,32 @@
+# [3503.Longest Palindrome After Substring Concatenation 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
+> ...
+Longest Palindrome After Substring Concatenation I
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/longest-palindrome-after-substring-concatenation-i/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/3501-3600/3503.Longest-Palindrome-After-Substring-Concatenation-I/Solution.go

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

leetcode/3501-3600/3503.Longest-Palindrome-After-Substring-Concatenation-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/3501-3600/3504.Longest-Palindrome-After-Substring-Concatenation-II/README.md

@@ -0,0 +1,32 @@
+# [3504.Longest Palindrome After Substring Concatenation II][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 Palindrome After Substring Concatenation II
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/longest-palindrome-after-substring-concatenation-ii/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm