diff --git a/README.md b/README.md
index 15b2886..2bdbeec 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,9 @@
-# Fuck LeetCode
-## Best practices for LeetCode solutions
+# leetcode-python-java
+
+**Not only** Python & Java solutions for LeetCode problems, but also =>
+
+## LeetCode Python/Java/JavaScript/C#/Go/Ruby Solutions
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
@@ -16,9 +19,9 @@ Here, I will provide you with **common problem-solving patterns** so that you do
## How to fully demonstrate your abilities to employers and get the offer you want?
-[Developer Portfolio](https://github.com/developer-portfolios/developer-portfolio) focuses on bringing value to developers, including resume, portfolio, blog and other functions. With it, your abilities will be better seen by employers!
+[Personal Brand Website Builder](https://github.com/PersonalBranding/personal-brand-website-builder) focuses on bringing value to developers, including resume, portfolio, blog and other functions. With it, your abilities will be better seen by employers!
-## How to Use this "Fuck LeetCode" Repository?
+## How to Use this "leetcode-python-java" Repository?
I have planned a learning route for you. You just need to do the problems in the order they are listed.
You can skip the more difficult problems and do them later.
@@ -27,6 +30,7 @@ You can skip the more difficult problems and do them later.
- [344. Reverse String](en/1-1000/344-reverse-string.md) Python, Java, C++, JavaScript, C#, Go, Ruby.
- [27. Remove Element](en/1-1000/27-remove-element.md) Python, Java, C++, JavaScript, C#, Go, Ruby, **2** approaches.
- [605. Can Place Flowers](en/1-1000/605-can-place-flowers.md) Python, Java, C++, JavaScript, C#, Go, Ruby.
+- [238. Product of Array Except Self](en/1-1000/238-product-of-array-except-self.md) Python, Java, C++, JavaScript, C#, Go, Ruby.
- [704. Binary Search](en/1-1000/704-binary-search.md) Python, Java, C++, JavaScript, C#, Go, Ruby.
- [977. Squares of a Sorted Array](en/1-1000/977-squares-of-a-sorted-array.md) Python, Java, C++, JavaScript, C#, Go, Ruby.
- [209. Minimum Size Subarray Sum](en/1-1000/209-minimum-size-subarray-sum.md) Python, Java, C++, JavaScript, C#, Go, Ruby.
@@ -147,6 +151,6 @@ You can skip the more difficult problems and do them later.
## Other Algorithms
- [433. Minimum Genetic Mutation](en/1-1000/433-minimum-genetic-mutation.md) Python, 3 approaches.
-## "Fuck LeetCode": More Problems
+## "leetcode-python-java": More Problems
More LeetCode problems and solutions will be added soon. Updated every day.
diff --git a/en/1-1000/1-two-sum.md b/en/1-1000/1-two-sum.md
index 733b393..325e61a 100644
--- a/en/1-1000/1-two-sum.md
+++ b/en/1-1000/1-two-sum.md
@@ -1,6 +1,6 @@
-# 1. Two Sum - LeetCode Python/Java/C++/JS code
+# 1. Two Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [1. Two Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/1-two-sum) for a better experience!
+Visit original link: [1. Two Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/1-two-sum) for a better experience!
LeetCode link: [1. Two Sum](https://leetcode.com/problems/two-sum), difficulty: **Easy**.
@@ -325,7 +325,7 @@ class Solution:
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [1. Two Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/1-two-sum).
+Original link: [1. Two Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/1-two-sum).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/15-3sum.md b/en/1-1000/15-3sum.md
index 2f8b122..dee8b75 100644
--- a/en/1-1000/15-3sum.md
+++ b/en/1-1000/15-3sum.md
@@ -1,6 +1,6 @@
-# 15. 3Sum - LeetCode Python/Java/C++/JS code
+# 15. 3Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [15. 3Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/15-3sum) for a better experience!
+Visit original link: [15. 3Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/15-3sum) for a better experience!
LeetCode link: [15. 3Sum](https://leetcode.com/problems/3sum), difficulty: **Medium**.
@@ -509,7 +509,7 @@ def duplicate_removed_nums(nums):
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [15. 3Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/15-3sum).
+Original link: [15. 3Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/15-3sum).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/151-reverse-words-in-a-string.md b/en/1-1000/151-reverse-words-in-a-string.md
index 6d84845..fe73121 100644
--- a/en/1-1000/151-reverse-words-in-a-string.md
+++ b/en/1-1000/151-reverse-words-in-a-string.md
@@ -1,6 +1,6 @@
-# 151. Reverse Words in a String - LeetCode Python/Java/C++/JS code
+# 151. Reverse Words in a String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [151. Reverse Words in a String - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/151-reverse-words-in-a-string) for a better experience!
+Visit original link: [151. Reverse Words in a String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/151-reverse-words-in-a-string) for a better experience!
LeetCode link: [151. Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string), difficulty: **Medium**.
@@ -183,7 +183,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [151. Reverse Words in a String - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/151-reverse-words-in-a-string).
+Original link: [151. Reverse Words in a String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/151-reverse-words-in-a-string).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/160-intersection-of-two-linked-lists.md b/en/1-1000/160-intersection-of-two-linked-lists.md
index 8960fcf..4c45651 100644
--- a/en/1-1000/160-intersection-of-two-linked-lists.md
+++ b/en/1-1000/160-intersection-of-two-linked-lists.md
@@ -1,6 +1,6 @@
-# 160. Intersection of Two Linked Lists - LeetCode Python/Java/C++/JS code
+# 160. Intersection of Two Linked Lists - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [160. Intersection of Two Linked Lists - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/160-intersection-of-two-linked-lists) for a better experience!
+Visit original link: [160. Intersection of Two Linked Lists - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/160-intersection-of-two-linked-lists) for a better experience!
LeetCode link: [160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists), difficulty: **Easy**.
@@ -495,7 +495,7 @@ func getIntersectionNode(headA, headB *ListNode) *ListNode {
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [160. Intersection of Two Linked Lists - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/160-intersection-of-two-linked-lists).
+Original link: [160. Intersection of Two Linked Lists - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/160-intersection-of-two-linked-lists).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/18-4sum.md b/en/1-1000/18-4sum.md
index 7b34230..cd3d4e9 100644
--- a/en/1-1000/18-4sum.md
+++ b/en/1-1000/18-4sum.md
@@ -1,6 +1,6 @@
-# 18. 4Sum - LeetCode Python/Java/C++/JS code
+# 18. 4Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [18. 4Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/18-4sum) for a better experience!
+Visit original link: [18. 4Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/18-4sum) for a better experience!
LeetCode link: [18. 4Sum](https://leetcode.com/problems/4sum), difficulty: **Medium**.
@@ -372,7 +372,7 @@ public class Solution {
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [18. 4Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/18-4sum).
+Original link: [18. 4Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/18-4sum).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/19-remove-nth-node-from-end-of-list.md b/en/1-1000/19-remove-nth-node-from-end-of-list.md
index d7aeed9..97a9ee8 100644
--- a/en/1-1000/19-remove-nth-node-from-end-of-list.md
+++ b/en/1-1000/19-remove-nth-node-from-end-of-list.md
@@ -1,6 +1,6 @@
-# 19. Remove Nth Node From End of List - LeetCode Python/Java/C++/JS code
+# 19. Remove Nth Node From End of List - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [19. Remove Nth Node From End of List - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/19-remove-nth-node-from-end-of-list) for a better experience!
+Visit original link: [19. Remove Nth Node From End of List - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/19-remove-nth-node-from-end-of-list) for a better experience!
LeetCode link: [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list), difficulty: **Medium**.
@@ -384,7 +384,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [19. Remove Nth Node From End of List - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/19-remove-nth-node-from-end-of-list).
+Original link: [19. Remove Nth Node From End of List - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/19-remove-nth-node-from-end-of-list).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/20-valid-parentheses.md b/en/1-1000/20-valid-parentheses.md
index 6b9f180..cebb114 100644
--- a/en/1-1000/20-valid-parentheses.md
+++ b/en/1-1000/20-valid-parentheses.md
@@ -1,6 +1,6 @@
-# 20. Valid Parentheses - LeetCode Python/Java/C++/JS code
+# 20. Valid Parentheses - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [20. Valid Parentheses - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/20-valid-parentheses) for a better experience!
+Visit original link: [20. Valid Parentheses - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/20-valid-parentheses) for a better experience!
LeetCode link: [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses), difficulty: **Easy**.
@@ -350,7 +350,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [20. Valid Parentheses - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/20-valid-parentheses).
+Original link: [20. Valid Parentheses - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/20-valid-parentheses).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/202-happy-number.md b/en/1-1000/202-happy-number.md
index dcfd2a2..e374b25 100644
--- a/en/1-1000/202-happy-number.md
+++ b/en/1-1000/202-happy-number.md
@@ -1,6 +1,6 @@
-# 202. Happy Number - LeetCode Python/Java/C++/JS code
+# 202. Happy Number - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [202. Happy Number - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/202-happy-number) for a better experience!
+Visit original link: [202. Happy Number - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/202-happy-number) for a better experience!
LeetCode link: [202. Happy Number](https://leetcode.com/problems/happy-number), difficulty: **Easy**.
@@ -274,7 +274,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [202. Happy Number - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/202-happy-number).
+Original link: [202. Happy Number - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/202-happy-number).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/203-remove-linked-list-elements.md b/en/1-1000/203-remove-linked-list-elements.md
index 33cf7ad..9bc79f1 100644
--- a/en/1-1000/203-remove-linked-list-elements.md
+++ b/en/1-1000/203-remove-linked-list-elements.md
@@ -1,6 +1,6 @@
-# 203. Remove Linked List Elements - LeetCode Python/Java/C++/JS code
+# 203. Remove Linked List Elements - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [203. Remove Linked List Elements - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/203-remove-linked-list-elements) for a better experience!
+Visit original link: [203. Remove Linked List Elements - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/203-remove-linked-list-elements) for a better experience!
LeetCode link: [203. Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements), difficulty: **Easy**.
@@ -268,7 +268,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [203. Remove Linked List Elements - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/203-remove-linked-list-elements).
+Original link: [203. Remove Linked List Elements - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/203-remove-linked-list-elements).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/206-reverse-linked-list.md b/en/1-1000/206-reverse-linked-list.md
index 5a7cf70..bf1bde1 100644
--- a/en/1-1000/206-reverse-linked-list.md
+++ b/en/1-1000/206-reverse-linked-list.md
@@ -1,6 +1,6 @@
-# 206. Reverse Linked List - LeetCode Python/Java/C++/JS code
+# 206. Reverse Linked List - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [206. Reverse Linked List - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/206-reverse-linked-list) for a better experience!
+Visit original link: [206. Reverse Linked List - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/206-reverse-linked-list) for a better experience!
LeetCode link: [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list), difficulty: **Easy**.
@@ -289,7 +289,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [206. Reverse Linked List - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/206-reverse-linked-list).
+Original link: [206. Reverse Linked List - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/206-reverse-linked-list).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/209-minimum-size-subarray-sum.md b/en/1-1000/209-minimum-size-subarray-sum.md
index c310bc2..5a5ada0 100644
--- a/en/1-1000/209-minimum-size-subarray-sum.md
+++ b/en/1-1000/209-minimum-size-subarray-sum.md
@@ -1,6 +1,6 @@
-# 209. Minimum Size Subarray Sum - LeetCode Python/Java/C++/JS code
+# 209. Minimum Size Subarray Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [209. Minimum Size Subarray Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/209-minimum-size-subarray-sum) for a better experience!
+Visit original link: [209. Minimum Size Subarray Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/209-minimum-size-subarray-sum) for a better experience!
LeetCode link: [209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum), difficulty: **Medium**.
@@ -296,7 +296,7 @@ public:
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [209. Minimum Size Subarray Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/209-minimum-size-subarray-sum).
+Original link: [209. Minimum Size Subarray Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/209-minimum-size-subarray-sum).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/225-implement-stack-using-queues.md b/en/1-1000/225-implement-stack-using-queues.md
index ebace5b..66b9778 100644
--- a/en/1-1000/225-implement-stack-using-queues.md
+++ b/en/1-1000/225-implement-stack-using-queues.md
@@ -1,6 +1,6 @@
-# 225. Implement Stack using Queues - LeetCode Python/Java/C++/JS code
+# 225. Implement Stack using Queues - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [225. Implement Stack using Queues - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/225-implement-stack-using-queues) for a better experience!
+Visit original link: [225. Implement Stack using Queues - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/225-implement-stack-using-queues) for a better experience!
LeetCode link: [225. Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues), difficulty: **Easy**.
@@ -703,7 +703,7 @@ public class MyStack
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [225. Implement Stack using Queues - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/225-implement-stack-using-queues).
+Original link: [225. Implement Stack using Queues - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/225-implement-stack-using-queues).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/232-implement-queue-using-stacks.md b/en/1-1000/232-implement-queue-using-stacks.md
index 04309ad..05fb864 100644
--- a/en/1-1000/232-implement-queue-using-stacks.md
+++ b/en/1-1000/232-implement-queue-using-stacks.md
@@ -1,6 +1,6 @@
-# 232. Implement Queue using Stacks - LeetCode Python/Java/C++/JS code
+# 232. Implement Queue using Stacks - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [232. Implement Queue using Stacks - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/232-implement-queue-using-stacks) for a better experience!
+Visit original link: [232. Implement Queue using Stacks - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/232-implement-queue-using-stacks) for a better experience!
LeetCode link: [232. Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks), difficulty: **Easy**.
@@ -350,7 +350,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [232. Implement Queue using Stacks - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/232-implement-queue-using-stacks).
+Original link: [232. Implement Queue using Stacks - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/232-implement-queue-using-stacks).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/238-product-of-array-except-self.md b/en/1-1000/238-product-of-array-except-self.md
new file mode 100644
index 0000000..81fe365
--- /dev/null
+++ b/en/1-1000/238-product-of-array-except-self.md
@@ -0,0 +1,551 @@
+# 238. Product of Array Except Self - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
+
+Visit original link: [238. Product of Array Except Self - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/238-product-of-array-except-self) for a better experience!
+
+LeetCode link: [238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self), difficulty: **Medium**.
+
+## LeetCode description of "238. Product of Array Except Self"
+
+Given an integer array `nums`, return an array `answer` such that `answer[i]` is equal to the product of all the elements of `nums` except `nums[i]`.
+
+The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.
+
+You must write an algorithm that runs in `O(n)` time and **without using the division operation**.
+
+### [Example 1]
+
+**Input**: `nums = [1,2,3,4]`
+
+**Output**: `[24,12,8,6]`
+
+### [Example 2]
+
+**Input**: `nums = [-1,1,0,-3,3]`
+
+**Output**: `[0,0,9,0,0]`
+
+### [Constraints]
+
+- `2 <= nums.length <= 10^5`
+- `-30 <= nums[i] <= 30`
+- The input is generated such that `answer[i]` is **guaranteed** to fit in a **32-bit** integer.
+
+
+**Follow up**: Can you solve the problem in `O(1)` extra space complexity? (The output array **does not** count as extra space for space complexity analysis.)
+
+### [Hints]
+
+
+ Hint 1
+ Think how you can efficiently utilize prefix and suffix products to calculate the product of all elements except self for each index. Can you pre-compute the prefix and suffix products in linear time to avoid redundant calculations?
+
+
+
+
+
+
+ Hint 2
+ Can you minimize additional space usage by reusing memory or modifying the input array to store intermediate results?
+
+
+
+
+## Intuition 1
+
+1. **Decompose the Problem**: Break down the `product except self` into `left product × right product`
+2. **Two Passes**:
+ - First pass: Calculate the left product for each element
+ - Second pass: Calculate the right product for each element
+3. **Combine Results**: Multiply left and right products to get the final result
+
+## Pattern of "Pre-Computation Techniques"
+
+**Pre-Computation Techniques** are an optimization method that reduces real-time computational overhead by calculating and storing intermediate or frequently used data in advance. The core idea is **"trade space for time."**
+
+#### Key Application Scenarios
+
+- **Prefix/Suffix computation problems** for arrays.
+- **High-frequency computation problems**: Such as Fibonacci sequences, factorials, prime number tables, etc., which avoid repetitive calculations by pre-generating lookup tables.
+- **Dynamic Programming (DP)**: Pre-computing and storing solutions to sub-problems, e.g., the `knapsack problem` or `shortest path problems`.
+
+## Step by Step Solutions
+
+1. **Initialize Arrays**:
+ - Create a `leftProducts` array to store the product of all elements to the left of each element
+ - Create a `rightProducts` array to store the product of all elements to the right of each element
+
+2. **Compute Left Products** (Left to Right Pass):
+ - The left product of the first element is initialized to `1`
+ - For subsequent elements: `leftProducts[i] = nums[i-1] * leftProducts[i-1]`
+
+3. **Compute Right Products** (Right to Left Pass):
+ - The right product of the last element is initialized to `1`
+ - For previous elements: `rightProducts[i] = nums[i+1] * rightProducts[i+1]`
+
+4. **Combine Results**:
+ - For each position, multiply left and right products: `answer[i] = leftProducts[i] * rightProducts[i]`
+
+5. **Return the Result Array**
+
+## Complexity
+
+- Time complexity: `O(N)`.
+- Space complexity: `O(N)`.
+
+## Ruby
+
+```ruby
+# @param {Integer[]} nums
+# @return {Integer[]}
+def product_except_self(nums)
+ # nums: [1, 2, 3, 4]
+ # left_products: [1, 1, 2, 6]
+ # right_products: [24,12, 4, 1]
+ # answer: [24,12, 8, 6]
+ size = nums.size
+
+ left_products = Array.new(size, 1)
+ (1...size).each do |i|
+ left_products[i] = nums[i - 1] * left_products[i - 1]
+ end
+
+ right_products = Array.new(size, 1)
+ (size - 2).downto(0) do |i|
+ right_products[i] = nums[i + 1] * right_products[i + 1]
+ end
+
+ answer = []
+ (0...size).each do |i|
+ answer << left_products[i] * right_products[i]
+ end
+
+ answer
+end
+```
+
+## Python
+
+```python
+class Solution:
+ def productExceptSelf(self, nums: List[int]) -> List[int]:
+ size = len(nums)
+
+ # nums: [1, 2, 3, 4]
+ # left_products: [1, 1, 2, 6]
+ # right_products: [24,12, 4, 1]
+ # answer: [24,12, 8, 6]
+ left_products = [1] * size
+ for i in range(1, size):
+ left_products[i] = nums[i - 1] * left_products[i - 1]
+
+ right_products = [1] * size
+ for i in range(size - 2, -1, -1):
+ right_products[i] = nums[i + 1] * right_products[i + 1]
+
+ answer = []
+ for i in range(size):
+ answer.append(left_products[i] * right_products[i])
+
+ return answer
+```
+
+## Java
+
+```java
+class Solution {
+ public int[] productExceptSelf(int[] nums) {
+ int size = nums.length;
+ // nums: [1, 2, 3, 4]
+ // left_products: [1, 1, 2, 6]
+ // right_products: [24,12, 4, 1]
+ // answer: [24,12, 8, 6]
+ int[] leftProducts = new int[size];
+ leftProducts[0] = 1;
+ for (int i = 1; i < size; i++) {
+ leftProducts[i] = nums[i - 1] * leftProducts[i - 1];
+ }
+
+ int[] rightProducts = new int[size];
+ rightProducts[size - 1] = 1;
+ for (int i = size - 2; i >= 0; i--) {
+ rightProducts[i] = nums[i + 1] * rightProducts[i + 1];
+ }
+
+ int[] answer = new int[size];
+ for (int i = 0; i < size; i++) {
+ answer[i] = leftProducts[i] * rightProducts[i];
+ }
+
+ return answer;
+ }
+}
+```
+
+## C++
+
+```cpp
+class Solution {
+public:
+ vector productExceptSelf(vector& nums) {
+ int size = nums.size();
+ // nums: [1, 2, 3, 4]
+ // left_products: [1, 1, 2, 6]
+ // right_products: [24,12, 4, 1]
+ // answer: [24,12, 8, 6]
+ vector left_products(size, 1);
+ for (int i = 1; i < size; i++) {
+ left_products[i] = nums[i - 1] * left_products[i - 1];
+ }
+
+ vector right_products(size, 1);
+ for (int i = size - 2; i >= 0; i--) {
+ right_products[i] = nums[i + 1] * right_products[i + 1];
+ }
+
+ vector answer(size);
+ for (int i = 0; i < size; i++) {
+ answer[i] = left_products[i] * right_products[i];
+ }
+
+ return answer;
+ }
+};
+```
+
+## JavaScript
+
+```javascript
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var productExceptSelf = function(nums) {
+ const size = nums.length
+
+ const leftProducts = new Array(size).fill(1)
+ for (let i = 1; i < size; i++) {
+ leftProducts[i] = nums[i - 1] * leftProducts[i - 1]
+ }
+
+ const rightProducts = new Array(size).fill(1)
+ for (let i = size - 2; i >= 0; i--) {
+ rightProducts[i] = nums[i + 1] * rightProducts[i + 1]
+ }
+
+ const answer = []
+ for (let i = 0; i < size; i++) {
+ answer.push(leftProducts[i] * rightProducts[i])
+ }
+
+ return answer
+};
+
+```
+
+## C#
+
+```csharp
+public class Solution
+{
+ public int[] ProductExceptSelf(int[] nums)
+ {
+ int size = nums.Length;
+ // nums: [1, 2, 3, 4]
+ // left_products: [1, 1, 2, 6]
+ // right_products: [24,12, 4, 1]
+ // answer: [24,12, 8, 6]
+ int[] leftProducts = new int[size];
+ leftProducts[0] = 1;
+
+ for (int i = 1; i < size; i++)
+ leftProducts[i] = nums[i - 1] * leftProducts[i - 1];
+
+ int[] rightProducts = new int[size];
+ rightProducts[size - 1] = 1;
+
+ for (int i = size - 2; i >= 0; i--)
+ rightProducts[i] = nums[i + 1] * rightProducts[i + 1];
+
+ int[] answer = new int[size];
+
+ for (int i = 0; i < size; i++)
+ answer[i] = leftProducts[i] * rightProducts[i];
+
+ return answer;
+ }
+}
+```
+
+## Go
+
+```go
+func productExceptSelf(nums []int) []int {
+ size := len(nums)
+
+ leftProducts := make([]int, size)
+ leftProducts[0] = 1
+ for i := 1; i < size; i++ {
+ leftProducts[i] = nums[i - 1] * leftProducts[i - 1]
+ }
+
+ rightProducts := make([]int, size)
+ rightProducts[size - 1] = 1
+ for i := size - 2; i >= 0; i-- {
+ rightProducts[i] = nums[i + 1] * rightProducts[i + 1]
+ }
+
+ answer := make([]int, size)
+ for i := 0; i < size; i++ {
+ answer[i] = leftProducts[i] * rightProducts[i]
+ }
+
+ return answer
+}
+```
+
+## Other languages
+
+```java
+// Welcome to create a PR to complete the code of this language, thanks!
+```
+
+## Intuition 2
+
+1. **Space Optimization**: Utilize the output array to store intermediate results, avoiding extra space
+2. **Two-Phase Calculation**: First compute left products and store in the result, then dynamically compute right products and merge directly
+3. **In-Place Operation**: Use only a single variable to dynamically maintain the right product
+
+## Step by Step Solutions
+
+1. **Initialize Result Array**:
+ - Create an `answer` array of the same size, initialized with all 1s
+
+2. **Compute Left Products** (Left → Right Pass):
+ - Initialize `left_product = 1`
+ - During traversal: `answer[i] = left_product`, then `left_product *= nums[i]`
+
+3. **Compute Right Products and Merge** (Right → Left Pass):
+ - Initialize `right_product = 1`
+ - During traversal: `answer[i] *= right_product`, then `right_product *= nums[i]`
+
+4. **Return Result Array**
+ - Space Complexity: O(1) (Output array not counted in space complexity)
+
+## Complexity
+
+- Time complexity: `O(N)`.
+- Space complexity: `O(1)`.
+
+## Ruby
+
+```ruby
+# @param {Integer[]} nums
+# @return {Integer[]}
+def product_except_self(nums)
+ size = nums.size
+ answer = Array.new(size, 1)
+
+ left_product = 1
+ (0...size).each do |i|
+ answer[i] = left_product
+ left_product *= nums[i]
+ end
+
+ # nums: [1, 2, 3, 4]
+ # answer: [1, 1, 2, 6] left_product done
+ # answer: [24,12, 8, 6] right_product done
+
+ right_product = 1
+ (size - 1).downto(0) do |i|
+ answer[i] *= right_product
+ right_product *= nums[i]
+ end
+
+ answer
+end
+```
+
+## Python
+
+```python
+class Solution:
+ def productExceptSelf(self, nums: List[int]) -> List[int]:
+ size = len(nums)
+ answer = [1] * size
+
+ left_product = 1
+ for i in range(size):
+ answer[i] = left_product
+ left_product *= nums[i]
+
+ # nums: [1, 2, 3, 4]
+ # answer: [1, 1, 2, 6] left_product done
+ # answer: [24,12, 8, 6] right_product done
+
+ right_product = 1
+ for i in range(size-1, -1, -1):
+ answer[i] *= right_product
+ right_product *= nums[i]
+
+ return answer
+```
+
+## Java
+
+```java
+class Solution {
+ public int[] productExceptSelf(int[] nums) {
+ int size = nums.length;
+ int[] answer = new int[size];
+ Arrays.fill(answer, 1);
+
+ int leftProduct = 1;
+ for (int i = 0; i < size; i++) {
+ answer[i] = leftProduct;
+ leftProduct *= nums[i];
+ }
+
+ // nums: [1, 2, 3, 4]
+ // answer: [1, 1, 2, 6] leftProduct done
+ // answer: [24,12, 8, 6] rightProduct done
+
+ int rightProduct = 1;
+ for (int i = size - 1; i >= 0; i--) {
+ answer[i] *= rightProduct;
+ rightProduct *= nums[i];
+ }
+
+ return answer;
+ }
+}
+```
+
+## C++
+
+```cpp
+class Solution {
+public:
+ vector productExceptSelf(vector& nums) {
+ int size = nums.size();
+ vector answer(size, 1);
+
+ int left_product = 1;
+ for (int i = 0; i < size; ++i) {
+ answer[i] = left_product;
+ left_product *= nums[i];
+ }
+
+ // nums: [1, 2, 3, 4]
+ // answer: [1, 1, 2, 6] left_product done
+ // answer: [24,12, 8, 6] right_product done
+
+ int right_product = 1;
+ for (int i = size - 1; i >= 0; --i) {
+ answer[i] *= right_product;
+ right_product *= nums[i];
+ }
+
+ return answer;
+ }
+};
+```
+
+## JavaScript
+
+```javascript
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var productExceptSelf = function(nums) {
+ const answer = [];
+ let left_product = 1;
+
+ for (let i = 0; i < nums.length; i++) {
+ answer[i] = left_product;
+ left_product *= nums[i];
+ }
+
+ // nums: [1, 2, 3, 4]
+ // answer: [1, 1, 2, 6] left_product done
+ // answer: [24,12, 8, 6] right_product done
+
+ right_product = 1;
+
+ for (let i = nums.length - 1; i >= 0; i--) {
+ answer[i] *= right_product;
+ right_product *= nums[i];
+ }
+
+ return answer;
+};
+```
+
+## C#
+
+```csharp
+public class Solution
+{
+ public int[] ProductExceptSelf(int[] nums)
+ {
+ int size = nums.Length;
+ int[] answer = new int[size];
+ Array.Fill(answer, 1);
+
+ int leftProduct = 1;
+ for (int i = 0; i < size; i++)
+ {
+ answer[i] = leftProduct;
+ leftProduct *= nums[i];
+ }
+
+ // nums: [1, 2, 3, 4]
+ // answer: [1, 1, 2, 6] leftProduct done
+ // answer: [24,12, 8, 6] rightProduct done
+
+ int rightProduct = 1;
+ for (int i = size - 1; i >= 0; i--)
+ {
+ answer[i] *= rightProduct;
+ rightProduct *= nums[i];
+ }
+
+ return answer;
+ }
+}
+```
+
+## Go
+
+```go
+func productExceptSelf(nums []int) []int {
+ n := len(nums)
+ answer := make([]int, n)
+
+ answer[0] = 1
+ for i := 1; i < n; i++ {
+ answer[i] = answer[i-1] * nums[i-1]
+ }
+
+ right := 1
+ for i := n - 1; i >= 0; i-- {
+ answer[i] *= right
+ right *= nums[i]
+ }
+
+ return answer
+}
+```
+
+## Other languages
+
+```java
+// Welcome to create a PR to complete the code of this language, thanks!
+```
+
+Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
+
+Original link: [238. Product of Array Except Self - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/238-product-of-array-except-self).
+
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
+
diff --git a/en/1-1000/24-swap-nodes-in-pairs.md b/en/1-1000/24-swap-nodes-in-pairs.md
index 8a070bb..58146b8 100644
--- a/en/1-1000/24-swap-nodes-in-pairs.md
+++ b/en/1-1000/24-swap-nodes-in-pairs.md
@@ -1,6 +1,6 @@
-# 24. Swap Nodes in Pairs - LeetCode Python/Java/C++/JS code
+# 24. Swap Nodes in Pairs - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [24. Swap Nodes in Pairs - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/24-swap-nodes-in-pairs) for a better experience!
+Visit original link: [24. Swap Nodes in Pairs - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/24-swap-nodes-in-pairs) for a better experience!
LeetCode link: [24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs), difficulty: **Medium**.
@@ -372,7 +372,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [24. Swap Nodes in Pairs - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/24-swap-nodes-in-pairs).
+Original link: [24. Swap Nodes in Pairs - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/24-swap-nodes-in-pairs).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/242-valid-anagram.md b/en/1-1000/242-valid-anagram.md
index f1c0116..048ce89 100644
--- a/en/1-1000/242-valid-anagram.md
+++ b/en/1-1000/242-valid-anagram.md
@@ -1,6 +1,6 @@
-# 242. Valid Anagram - LeetCode Python/Java/C++/JS code
+# 242. Valid Anagram - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [242. Valid Anagram - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/242-valid-anagram) for a better experience!
+Visit original link: [242. Valid Anagram - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/242-valid-anagram) for a better experience!
LeetCode link: [242. Valid Anagram](https://leetcode.com/problems/valid-anagram), difficulty: **Easy**.
@@ -217,7 +217,7 @@ public:
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [242. Valid Anagram - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/242-valid-anagram).
+Original link: [242. Valid Anagram - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/242-valid-anagram).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/27-remove-element.md b/en/1-1000/27-remove-element.md
index d1d807d..82e7a28 100644
--- a/en/1-1000/27-remove-element.md
+++ b/en/1-1000/27-remove-element.md
@@ -1,6 +1,6 @@
-# 27. Remove Element - LeetCode Python/Java/C++/JS code
+# 27. Remove Element - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [27. Remove Element - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/27-remove-element) for a better experience!
+Visit original link: [27. Remove Element - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/27-remove-element) for a better experience!
LeetCode link: [27. Remove Element](https://leetcode.com/problems/remove-element), difficulty: **Easy**.
@@ -430,7 +430,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [27. Remove Element - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/27-remove-element).
+Original link: [27. Remove Element - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/27-remove-element).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md b/en/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md
index f5e7219..daa9152 100644
--- a/en/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md
+++ b/en/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md
@@ -1,6 +1,6 @@
-# 28. Find the Index of the First Occurrence in a String - LeetCode Python/Java/C++/JS code
+# 28. Find the Index of the First Occurrence in a String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [28. Find the Index of the First Occurrence in a String - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/28-find-the-index-of-the-first-occurrence-in-a-string) for a better experience!
+Visit original link: [28. Find the Index of the First Occurrence in a String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/28-find-the-index-of-the-first-occurrence-in-a-string) for a better experience!
LeetCode link: [28. Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string), difficulty: **Easy**.
@@ -204,7 +204,7 @@ public class Solution {
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [28. Find the Index of the First Occurrence in a String - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/28-find-the-index-of-the-first-occurrence-in-a-string).
+Original link: [28. Find the Index of the First Occurrence in a String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/28-find-the-index-of-the-first-occurrence-in-a-string).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/303-range-sum-query-immutable.md b/en/1-1000/303-range-sum-query-immutable.md
index 04addd8..592cab3 100644
--- a/en/1-1000/303-range-sum-query-immutable.md
+++ b/en/1-1000/303-range-sum-query-immutable.md
@@ -1,6 +1,6 @@
-# 303. Range Sum Query - Immutable - LeetCode Python/Java/C++/JS code
+# 303. Range Sum Query - Immutable - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [303. Range Sum Query - Immutable - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/303-range-sum-query-immutable) for a better experience!
+Visit original link: [303. Range Sum Query - Immutable - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/303-range-sum-query-immutable) for a better experience!
LeetCode link: [303. Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable), difficulty: **Easy**.
@@ -234,7 +234,7 @@ class NumArray:
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [303. Range Sum Query - Immutable - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/303-range-sum-query-immutable).
+Original link: [303. Range Sum Query - Immutable - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/303-range-sum-query-immutable).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/344-reverse-string.md b/en/1-1000/344-reverse-string.md
index 0182809..98ff280 100644
--- a/en/1-1000/344-reverse-string.md
+++ b/en/1-1000/344-reverse-string.md
@@ -1,6 +1,6 @@
-# 344. Reverse String - LeetCode Python/Java/C++/JS code
+# 344. Reverse String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [344. Reverse String - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/344-reverse-string) for a better experience!
+Visit original link: [344. Reverse String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/344-reverse-string) for a better experience!
LeetCode link: [344. Reverse String](https://leetcode.com/problems/reverse-string), difficulty: **Easy**.
@@ -214,7 +214,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [344. Reverse String - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/344-reverse-string).
+Original link: [344. Reverse String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/344-reverse-string).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/345-reverse-vowels-of-a-string.md b/en/1-1000/345-reverse-vowels-of-a-string.md
index 86eb0e7..f26e390 100644
--- a/en/1-1000/345-reverse-vowels-of-a-string.md
+++ b/en/1-1000/345-reverse-vowels-of-a-string.md
@@ -1,6 +1,6 @@
-# 345. Reverse Vowels of a String - LeetCode Python/Java/C++/JS code
+# 345. Reverse Vowels of a String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [345. Reverse Vowels of a String - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/345-reverse-vowels-of-a-string) for a better experience!
+Visit original link: [345. Reverse Vowels of a String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/345-reverse-vowels-of-a-string) for a better experience!
LeetCode link: [345. Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string), difficulty: **Easy**.
@@ -296,7 +296,7 @@ func reverseVowels(s string) string {
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [345. Reverse Vowels of a String - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/345-reverse-vowels-of-a-string).
+Original link: [345. Reverse Vowels of a String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/345-reverse-vowels-of-a-string).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/349-intersection-of-two-arrays.md b/en/1-1000/349-intersection-of-two-arrays.md
index 5db2d5d..6e7d927 100644
--- a/en/1-1000/349-intersection-of-two-arrays.md
+++ b/en/1-1000/349-intersection-of-two-arrays.md
@@ -1,6 +1,6 @@
-# 349. Intersection of Two Arrays - LeetCode Python/Java/C++/JS code
+# 349. Intersection of Two Arrays - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [349. Intersection of Two Arrays - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/349-intersection-of-two-arrays) for a better experience!
+Visit original link: [349. Intersection of Two Arrays - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/349-intersection-of-two-arrays) for a better experience!
LeetCode link: [349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays), difficulty: **Easy**.
@@ -189,7 +189,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [349. Intersection of Two Arrays - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/349-intersection-of-two-arrays).
+Original link: [349. Intersection of Two Arrays - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/349-intersection-of-two-arrays).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/383-ransom-note.md b/en/1-1000/383-ransom-note.md
index 1156897..81d2441 100644
--- a/en/1-1000/383-ransom-note.md
+++ b/en/1-1000/383-ransom-note.md
@@ -1,6 +1,6 @@
-# 383. Ransom Note - LeetCode Python/Java/C++/JS code
+# 383. Ransom Note - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [383. Ransom Note - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/383-ransom-note) for a better experience!
+Visit original link: [383. Ransom Note - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/383-ransom-note) for a better experience!
LeetCode link: [383. Ransom Note](https://leetcode.com/problems/ransom-note), difficulty: **Easy**.
@@ -246,7 +246,7 @@ public:
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [383. Ransom Note - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/383-ransom-note).
+Original link: [383. Ransom Note - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/383-ransom-note).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/392-is-subsequence.md b/en/1-1000/392-is-subsequence.md
index c481088..3ab6d7f 100644
--- a/en/1-1000/392-is-subsequence.md
+++ b/en/1-1000/392-is-subsequence.md
@@ -1,6 +1,6 @@
-# 392. Is Subsequence - LeetCode Python/Java/C++/JS code
+# 392. Is Subsequence - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [392. Is Subsequence - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/392-is-subsequence) for a better experience!
+Visit original link: [392. Is Subsequence - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/392-is-subsequence) for a better experience!
LeetCode link: [392. Is Subsequence](https://leetcode.com/problems/is-subsequence), difficulty: **Medium**.
@@ -509,7 +509,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [392. Is Subsequence - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/392-is-subsequence).
+Original link: [392. Is Subsequence - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/392-is-subsequence).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/416-partition-equal-subset-sum.md b/en/1-1000/416-partition-equal-subset-sum.md
index aae216d..857030a 100644
--- a/en/1-1000/416-partition-equal-subset-sum.md
+++ b/en/1-1000/416-partition-equal-subset-sum.md
@@ -1,6 +1,6 @@
-# 416. Partition Equal Subset Sum - LeetCode Python/Java/C++/JS code
+# 416. Partition Equal Subset Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [416. Partition Equal Subset Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/416-partition-equal-subset-sum) for a better experience!
+Visit original link: [416. Partition Equal Subset Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/416-partition-equal-subset-sum) for a better experience!
LeetCode link: [416. Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum), difficulty: **Medium**.
@@ -603,7 +603,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [416. Partition Equal Subset Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/416-partition-equal-subset-sum).
+Original link: [416. Partition Equal Subset Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/416-partition-equal-subset-sum).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/454-4sum-ii.md b/en/1-1000/454-4sum-ii.md
index 0baa09f..97609db 100644
--- a/en/1-1000/454-4sum-ii.md
+++ b/en/1-1000/454-4sum-ii.md
@@ -1,6 +1,6 @@
-# 454. 4Sum II - LeetCode Python/Java/C++/JS code
+# 454. 4Sum II - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [454. 4Sum II - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/454-4sum-ii) for a better experience!
+Visit original link: [454. 4Sum II - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/454-4sum-ii) for a better experience!
LeetCode link: [454. 4Sum II](https://leetcode.com/problems/4sum-ii), difficulty: **Medium**.
@@ -273,7 +273,7 @@ public:
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [454. 4Sum II - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/454-4sum-ii).
+Original link: [454. 4Sum II - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/454-4sum-ii).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/459-repeated-substring-pattern.md b/en/1-1000/459-repeated-substring-pattern.md
index cd69e88..e55dacb 100644
--- a/en/1-1000/459-repeated-substring-pattern.md
+++ b/en/1-1000/459-repeated-substring-pattern.md
@@ -1,6 +1,6 @@
-# 459. Repeated Substring Pattern - LeetCode Python/Java/C++/JS code
+# 459. Repeated Substring Pattern - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [459. Repeated Substring Pattern - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/459-repeated-substring-pattern) for a better experience!
+Visit original link: [459. Repeated Substring Pattern - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/459-repeated-substring-pattern) for a better experience!
LeetCode link: [459. Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern), difficulty: **Easy**.
@@ -226,7 +226,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [459. Repeated Substring Pattern - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/459-repeated-substring-pattern).
+Original link: [459. Repeated Substring Pattern - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/459-repeated-substring-pattern).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/474-ones-and-zeroes.md b/en/1-1000/474-ones-and-zeroes.md
index 9ccbb11..64d7109 100644
--- a/en/1-1000/474-ones-and-zeroes.md
+++ b/en/1-1000/474-ones-and-zeroes.md
@@ -1,6 +1,6 @@
-# 474. Ones and Zeroes - LeetCode Python/Java/C++/JS code
+# 474. Ones and Zeroes - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [474. Ones and Zeroes - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/474-ones-and-zeroes) for a better experience!
+Visit original link: [474. Ones and Zeroes - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/474-ones-and-zeroes) for a better experience!
LeetCode link: [474. Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes), difficulty: **Medium**.
@@ -470,7 +470,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [474. Ones and Zeroes - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/474-ones-and-zeroes).
+Original link: [474. Ones and Zeroes - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/474-ones-and-zeroes).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/49-group-anagrams.md b/en/1-1000/49-group-anagrams.md
index ff79661..a82cb68 100644
--- a/en/1-1000/49-group-anagrams.md
+++ b/en/1-1000/49-group-anagrams.md
@@ -1,6 +1,6 @@
-# 49. Group Anagrams - LeetCode Python/Java/C++/JS code
+# 49. Group Anagrams - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [49. Group Anagrams - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/49-group-anagrams) for a better experience!
+Visit original link: [49. Group Anagrams - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/49-group-anagrams) for a better experience!
LeetCode link: [49. Group Anagrams](https://leetcode.com/problems/group-anagrams), difficulty: **Medium**.
@@ -104,7 +104,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [49. Group Anagrams - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/49-group-anagrams).
+Original link: [49. Group Anagrams - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/49-group-anagrams).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/494-target-sum.md b/en/1-1000/494-target-sum.md
index 11c2483..160560f 100644
--- a/en/1-1000/494-target-sum.md
+++ b/en/1-1000/494-target-sum.md
@@ -1,6 +1,6 @@
-# 494. Target Sum - LeetCode Python/Java/C++/JS code
+# 494. Target Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [494. Target Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/494-target-sum) for a better experience!
+Visit original link: [494. Target Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/494-target-sum) for a better experience!
LeetCode link: [494. Target Sum](https://leetcode.com/problems/target-sum), difficulty: **Medium**.
@@ -335,7 +335,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [494. Target Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/494-target-sum).
+Original link: [494. Target Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/494-target-sum).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/5-longest-palindromic-substring.md b/en/1-1000/5-longest-palindromic-substring.md
index 721f41b..b013d38 100644
--- a/en/1-1000/5-longest-palindromic-substring.md
+++ b/en/1-1000/5-longest-palindromic-substring.md
@@ -1,6 +1,6 @@
-# 5. Longest Palindromic Substring - LeetCode Python/Java/C++/JS code
+# 5. Longest Palindromic Substring - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [5. Longest Palindromic Substring - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/5-longest-palindromic-substring) for a better experience!
+Visit original link: [5. Longest Palindromic Substring - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/5-longest-palindromic-substring) for a better experience!
LeetCode link: [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring), difficulty: **Medium**.
@@ -142,7 +142,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [5. Longest Palindromic Substring - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/5-longest-palindromic-substring).
+Original link: [5. Longest Palindromic Substring - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/5-longest-palindromic-substring).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/509-fibonacci-number.md b/en/1-1000/509-fibonacci-number.md
index d3eadaf..69242d1 100644
--- a/en/1-1000/509-fibonacci-number.md
+++ b/en/1-1000/509-fibonacci-number.md
@@ -1,6 +1,6 @@
-# 509. Fibonacci Number - LeetCode Python/Java/C++/JS code
+# 509. Fibonacci Number - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [509. Fibonacci Number - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/509-fibonacci-number) for a better experience!
+Visit original link: [509. Fibonacci Number - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/509-fibonacci-number) for a better experience!
LeetCode link: [509. Fibonacci Number](https://leetcode.com/problems/fibonacci-number), difficulty: **Easy**.
@@ -605,7 +605,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [509. Fibonacci Number - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/509-fibonacci-number).
+Original link: [509. Fibonacci Number - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/509-fibonacci-number).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/53-maximum-subarray.md b/en/1-1000/53-maximum-subarray.md
index a9f174f..de256f7 100644
--- a/en/1-1000/53-maximum-subarray.md
+++ b/en/1-1000/53-maximum-subarray.md
@@ -1,6 +1,6 @@
-# 53. Maximum Subarray - LeetCode Python/Java/C++/JS code
+# 53. Maximum Subarray - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [53. Maximum Subarray - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/53-maximum-subarray) for a better experience!
+Visit original link: [53. Maximum Subarray - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/53-maximum-subarray) for a better experience!
LeetCode link: [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray), difficulty: **Medium**.
@@ -386,7 +386,7 @@ class Solution {
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [53. Maximum Subarray - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/53-maximum-subarray).
+Original link: [53. Maximum Subarray - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/53-maximum-subarray).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/541-reverse-string-ii.md b/en/1-1000/541-reverse-string-ii.md
index 96b1c44..c41f157 100644
--- a/en/1-1000/541-reverse-string-ii.md
+++ b/en/1-1000/541-reverse-string-ii.md
@@ -1,6 +1,6 @@
-# 541. Reverse String II - LeetCode Python/Java/C++/JS code
+# 541. Reverse String II - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [541. Reverse String II - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/541-reverse-string-ii) for a better experience!
+Visit original link: [541. Reverse String II - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/541-reverse-string-ii) for a better experience!
LeetCode link: [541. Reverse String II](https://leetcode.com/problems/reverse-string-ii), difficulty: **Easy**.
@@ -278,7 +278,7 @@ func reverseStr(s string, k int) string {
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [541. Reverse String II - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/541-reverse-string-ii).
+Original link: [541. Reverse String II - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/541-reverse-string-ii).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/583-delete-operation-for-two-strings.md b/en/1-1000/583-delete-operation-for-two-strings.md
index 8928c94..c40659e 100644
--- a/en/1-1000/583-delete-operation-for-two-strings.md
+++ b/en/1-1000/583-delete-operation-for-two-strings.md
@@ -1,6 +1,6 @@
-# 583. Delete Operation for Two Strings - LeetCode Python/Java/C++/JS code
+# 583. Delete Operation for Two Strings - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [583. Delete Operation for Two Strings - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/583-delete-operation-for-two-strings) for a better experience!
+Visit original link: [583. Delete Operation for Two Strings - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/583-delete-operation-for-two-strings) for a better experience!
LeetCode link: [583. Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings), difficulty: **Medium**.
@@ -331,7 +331,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [583. Delete Operation for Two Strings - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/583-delete-operation-for-two-strings).
+Original link: [583. Delete Operation for Two Strings - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/583-delete-operation-for-two-strings).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/59-spiral-matrix-ii.md b/en/1-1000/59-spiral-matrix-ii.md
index cc62a26..b7fdd84 100644
--- a/en/1-1000/59-spiral-matrix-ii.md
+++ b/en/1-1000/59-spiral-matrix-ii.md
@@ -1,6 +1,6 @@
-# 59. Spiral Matrix II - LeetCode Python/Java/C++/JS code
+# 59. Spiral Matrix II - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [59. Spiral Matrix II - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/59-spiral-matrix-ii) for a better experience!
+Visit original link: [59. Spiral Matrix II - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/59-spiral-matrix-ii) for a better experience!
LeetCode link: [59. Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii), difficulty: **Medium**.
@@ -410,7 +410,7 @@ private:
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [59. Spiral Matrix II - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/59-spiral-matrix-ii).
+Original link: [59. Spiral Matrix II - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/59-spiral-matrix-ii).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/605-can-place-flowers.md b/en/1-1000/605-can-place-flowers.md
index f35b19a..d8d54a2 100644
--- a/en/1-1000/605-can-place-flowers.md
+++ b/en/1-1000/605-can-place-flowers.md
@@ -1,6 +1,6 @@
-# 605. Can Place Flowers - LeetCode Python/Java/C++/JS code
+# 605. Can Place Flowers - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [605. Can Place Flowers - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/605-can-place-flowers) for a better experience!
+Visit original link: [605. Can Place Flowers - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/605-can-place-flowers) for a better experience!
LeetCode link: [605. Can Place Flowers](https://leetcode.com/problems/can-place-flowers), difficulty: **Easy**.
@@ -217,7 +217,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [605. Can Place Flowers - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/605-can-place-flowers).
+Original link: [605. Can Place Flowers - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/605-can-place-flowers).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/704-binary-search.md b/en/1-1000/704-binary-search.md
index 2667e1d..f40fd3f 100644
--- a/en/1-1000/704-binary-search.md
+++ b/en/1-1000/704-binary-search.md
@@ -1,6 +1,6 @@
-# 704. Binary Search - LeetCode Python/Java/C++/JS code
+# 704. Binary Search - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [704. Binary Search - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/704-binary-search) for a better experience!
+Visit original link: [704. Binary Search - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/704-binary-search) for a better experience!
LeetCode link: [704. Binary Search](https://leetcode.com/problems/binary-search), difficulty: **Easy**.
@@ -239,7 +239,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [704. Binary Search - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/704-binary-search).
+Original link: [704. Binary Search - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/704-binary-search).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/707-design-linked-list.md b/en/1-1000/707-design-linked-list.md
index 05ba370..96315ed 100644
--- a/en/1-1000/707-design-linked-list.md
+++ b/en/1-1000/707-design-linked-list.md
@@ -1,6 +1,6 @@
-# 707. Design Linked List - LeetCode Python/Java/C++/JS code
+# 707. Design Linked List - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [707. Design Linked List - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/707-design-linked-list) for a better experience!
+Visit original link: [707. Design Linked List - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/707-design-linked-list) for a better experience!
LeetCode link: [707. Design Linked List](https://leetcode.com/problems/design-linked-list), difficulty: **Medium**.
@@ -635,7 +635,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [707. Design Linked List - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/707-design-linked-list).
+Original link: [707. Design Linked List - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/707-design-linked-list).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/72-edit-distance.md b/en/1-1000/72-edit-distance.md
index 69ddb1d..d62f040 100644
--- a/en/1-1000/72-edit-distance.md
+++ b/en/1-1000/72-edit-distance.md
@@ -1,6 +1,6 @@
-# 72. Edit Distance - LeetCode Python/Java/C++/JS code
+# 72. Edit Distance - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [72. Edit Distance - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/72-edit-distance) for a better experience!
+Visit original link: [72. Edit Distance - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/72-edit-distance) for a better experience!
LeetCode link: [72. Edit Distance](https://leetcode.com/problems/edit-distance), difficulty: **Medium**.
@@ -376,7 +376,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [72. Edit Distance - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/72-edit-distance).
+Original link: [72. Edit Distance - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/72-edit-distance).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/797-all-paths-from-source-to-target.md b/en/1-1000/797-all-paths-from-source-to-target.md
index 6bd532f..81340fb 100644
--- a/en/1-1000/797-all-paths-from-source-to-target.md
+++ b/en/1-1000/797-all-paths-from-source-to-target.md
@@ -1,6 +1,6 @@
-# 797. All Paths From Source to Target - LeetCode Python/Java/C++/JS code
+# 797. All Paths From Source to Target - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [797. All Paths From Source to Target - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/797-all-paths-from-source-to-target) for a better experience!
+Visit original link: [797. All Paths From Source to Target - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/797-all-paths-from-source-to-target) for a better experience!
LeetCode link: [797. All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target), difficulty: **Medium**.
@@ -859,7 +859,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [797. All Paths From Source to Target - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/797-all-paths-from-source-to-target).
+Original link: [797. All Paths From Source to Target - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/797-all-paths-from-source-to-target).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/833-find-and-replace-in-string.md b/en/1-1000/833-find-and-replace-in-string.md
index da4fa6c..13b99ac 100644
--- a/en/1-1000/833-find-and-replace-in-string.md
+++ b/en/1-1000/833-find-and-replace-in-string.md
@@ -1,6 +1,6 @@
-# 833. Find And Replace in String - LeetCode Python/Java/C++/JS code
+# 833. Find And Replace in String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [833. Find And Replace in String - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/833-find-and-replace-in-string) for a better experience!
+Visit original link: [833. Find And Replace in String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/833-find-and-replace-in-string) for a better experience!
LeetCode link: [833. Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string), difficulty: **Medium**.
@@ -107,7 +107,7 @@ class Solution:
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [833. Find And Replace in String - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/833-find-and-replace-in-string).
+Original link: [833. Find And Replace in String - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/833-find-and-replace-in-string).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1-1000/977-squares-of-a-sorted-array.md b/en/1-1000/977-squares-of-a-sorted-array.md
index b2f06d3..0e91ae5 100644
--- a/en/1-1000/977-squares-of-a-sorted-array.md
+++ b/en/1-1000/977-squares-of-a-sorted-array.md
@@ -1,6 +1,6 @@
-# 977. Squares of a Sorted Array - LeetCode Python/Java/C++/JS code
+# 977. Squares of a Sorted Array - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [977. Squares of a Sorted Array - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/977-squares-of-a-sorted-array) for a better experience!
+Visit original link: [977. Squares of a Sorted Array - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/977-squares-of-a-sorted-array) for a better experience!
LeetCode link: [977. Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array), difficulty: **Easy**.
@@ -348,7 +348,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [977. Squares of a Sorted Array - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/977-squares-of-a-sorted-array).
+Original link: [977. Squares of a Sorted Array - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/977-squares-of-a-sorted-array).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1001-2000/1049-last-stone-weight-ii.md b/en/1001-2000/1049-last-stone-weight-ii.md
index e214d11..57c000c 100644
--- a/en/1001-2000/1049-last-stone-weight-ii.md
+++ b/en/1001-2000/1049-last-stone-weight-ii.md
@@ -1,6 +1,6 @@
-# 1049. Last Stone Weight II - LeetCode Python/Java/C++/JS code
+# 1049. Last Stone Weight II - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [1049. Last Stone Weight II - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/1049-last-stone-weight-ii) for a better experience!
+Visit original link: [1049. Last Stone Weight II - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/1049-last-stone-weight-ii) for a better experience!
LeetCode link: [1049. Last Stone Weight II](https://leetcode.com/problems/last-stone-weight-ii), difficulty: **Medium**.
@@ -595,7 +595,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [1049. Last Stone Weight II - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/1049-last-stone-weight-ii).
+Original link: [1049. Last Stone Weight II - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/1049-last-stone-weight-ii).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1001-2000/1071-greatest-common-divisor-of-strings.md b/en/1001-2000/1071-greatest-common-divisor-of-strings.md
index d6c4e61..f961de0 100644
--- a/en/1001-2000/1071-greatest-common-divisor-of-strings.md
+++ b/en/1001-2000/1071-greatest-common-divisor-of-strings.md
@@ -1,6 +1,6 @@
-# 1071. Greatest Common Divisor of Strings - LeetCode Python/Java/C++/JS code
+# 1071. Greatest Common Divisor of Strings - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [1071. Greatest Common Divisor of Strings - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/1071-greatest-common-divisor-of-strings) for a better experience!
+Visit original link: [1071. Greatest Common Divisor of Strings - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/1071-greatest-common-divisor-of-strings) for a better experience!
LeetCode link: [1071. Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings), difficulty: **Easy**.
@@ -258,7 +258,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [1071. Greatest Common Divisor of Strings - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/1071-greatest-common-divisor-of-strings).
+Original link: [1071. Greatest Common Divisor of Strings - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/1071-greatest-common-divisor-of-strings).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1001-2000/1431-kids-with-the-greatest-number-of-candies.md b/en/1001-2000/1431-kids-with-the-greatest-number-of-candies.md
index 8d6eb1b..a1f2a66 100644
--- a/en/1001-2000/1431-kids-with-the-greatest-number-of-candies.md
+++ b/en/1001-2000/1431-kids-with-the-greatest-number-of-candies.md
@@ -1,6 +1,6 @@
-# 1431. Kids With the Greatest Number of Candies - LeetCode Python/Java/C++/JS code
+# 1431. Kids With the Greatest Number of Candies - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [1431. Kids With the Greatest Number of Candies - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/1431-kids-with-the-greatest-number-of-candies) for a better experience!
+Visit original link: [1431. Kids With the Greatest Number of Candies - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/1431-kids-with-the-greatest-number-of-candies) for a better experience!
LeetCode link: [1431. Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies), difficulty: **Easy**.
@@ -186,7 +186,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [1431. Kids With the Greatest Number of Candies - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/1431-kids-with-the-greatest-number-of-candies).
+Original link: [1431. Kids With the Greatest Number of Candies - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/1431-kids-with-the-greatest-number-of-candies).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/1001-2000/1768-merge-strings-alternately.md b/en/1001-2000/1768-merge-strings-alternately.md
index ea03746..a0c5cef 100644
--- a/en/1001-2000/1768-merge-strings-alternately.md
+++ b/en/1001-2000/1768-merge-strings-alternately.md
@@ -1,6 +1,6 @@
-# 1768. Merge Strings Alternately - LeetCode Python/Java/C++/JS code
+# 1768. Merge Strings Alternately - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [1768. Merge Strings Alternately - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/1768-merge-strings-alternately) for a better experience!
+Visit original link: [1768. Merge Strings Alternately - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/1768-merge-strings-alternately) for a better experience!
LeetCode link: [1768. Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately), difficulty: **Easy**.
@@ -237,7 +237,7 @@ end
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [1768. Merge Strings Alternately - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/1768-merge-strings-alternately).
+Original link: [1768. Merge Strings Alternately - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/1768-merge-strings-alternately).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/3001-4000/3478-choose-k-elements-with-maximum-sum.md b/en/3001-4000/3478-choose-k-elements-with-maximum-sum.md
index 915becd..8a7293f 100644
--- a/en/3001-4000/3478-choose-k-elements-with-maximum-sum.md
+++ b/en/3001-4000/3478-choose-k-elements-with-maximum-sum.md
@@ -1,6 +1,6 @@
-# 3478. Choose K Elements With Maximum Sum - LeetCode Python/Java/C++/JS code
+# 3478. Choose K Elements With Maximum Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [3478. Choose K Elements With Maximum Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/3478-choose-k-elements-with-maximum-sum) for a better experience!
+Visit original link: [3478. Choose K Elements With Maximum Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/3478-choose-k-elements-with-maximum-sum) for a better experience!
LeetCode link: [3478. Choose K Elements With Maximum Sum](https://leetcode.com/problems/choose-k-elements-with-maximum-sum), difficulty: **Medium**.
@@ -131,7 +131,7 @@ class Solution:
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [3478. Choose K Elements With Maximum Sum - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/3478-choose-k-elements-with-maximum-sum).
+Original link: [3478. Choose K Elements With Maximum Sum - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/3478-choose-k-elements-with-maximum-sum).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/en/3001-4000/3494-find-the-minimum-amount-of-time-to-brew-potions.md b/en/3001-4000/3494-find-the-minimum-amount-of-time-to-brew-potions.md
index e9116d3..52cbccd 100644
--- a/en/3001-4000/3494-find-the-minimum-amount-of-time-to-brew-potions.md
+++ b/en/3001-4000/3494-find-the-minimum-amount-of-time-to-brew-potions.md
@@ -1,6 +1,6 @@
-# 3494. Find the Minimum Amount of Time to Brew Potions - LeetCode Python/Java/C++/JS code
+# 3494. Find the Minimum Amount of Time to Brew Potions - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions
-Visit original link: [3494. Find the Minimum Amount of Time to Brew Potions - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/3494-find-the-minimum-amount-of-time-to-brew-potions) for a better experience!
+Visit original link: [3494. Find the Minimum Amount of Time to Brew Potions - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/3494-find-the-minimum-amount-of-time-to-brew-potions) for a better experience!
LeetCode link: [3494. Find the Minimum Amount of Time to Brew Potions](https://leetcode.com/problems/find-the-minimum-amount-of-time-to-brew-potions), difficulty: **Medium**.
@@ -434,7 +434,7 @@ func minTime(skill []int, mana []int) int64 {
Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website [LeetCode.blog](https://leetcode.blog): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
-Original link: [3494. Find the Minimum Amount of Time to Brew Potions - LeetCode Python/Java/C++/JS code](https://leetcode.blog/en/leetcode/3494-find-the-minimum-amount-of-time-to-brew-potions).
+Original link: [3494. Find the Minimum Amount of Time to Brew Potions - LeetCode Python/Java/C++/JS/C#/Go/Ruby Solutions](https://leetcode.blog/en/leetcode/3494-find-the-minimum-amount-of-time-to-brew-potions).
-GitHub repository: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub repository: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/1-two-sum.md b/zh/1-1000/1-two-sum.md
index 6d1a399..3979d38 100644
--- a/zh/1-1000/1-two-sum.md
+++ b/zh/1-1000/1-two-sum.md
@@ -1,6 +1,6 @@
-# 1. 两数之和 - LeetCode Python/Java/C++ 题解
+# 1. 两数之和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[1. 两数之和 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/1-two-sum)，体验更佳！
+访问原文链接：[1. 两数之和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/1-two-sum)，体验更佳！
力扣链接：[1. 两数之和](https://leetcode.cn/problems/two-sum), 难度等级：**简单**。
@@ -324,7 +324,7 @@ class Solution:
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[1. 两数之和 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/1-two-sum).
+原文链接：[1. 两数之和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/1-two-sum).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/15-3sum.md b/zh/1-1000/15-3sum.md
index 09fd3c9..7db6af4 100644
--- a/zh/1-1000/15-3sum.md
+++ b/zh/1-1000/15-3sum.md
@@ -1,6 +1,6 @@
-# 15. 三数之和 - LeetCode Python/Java/C++ 题解
+# 15. 三数之和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[15. 三数之和 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/15-3sum)，体验更佳！
+访问原文链接：[15. 三数之和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/15-3sum)，体验更佳！
力扣链接：[15. 三数之和](https://leetcode.cn/problems/3sum), 难度等级：**中等**。
@@ -508,7 +508,7 @@ def duplicate_removed_nums(nums):
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[15. 三数之和 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/15-3sum).
+原文链接：[15. 三数之和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/15-3sum).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/151-reverse-words-in-a-string.md b/zh/1-1000/151-reverse-words-in-a-string.md
index b642b2f..af2ac58 100644
--- a/zh/1-1000/151-reverse-words-in-a-string.md
+++ b/zh/1-1000/151-reverse-words-in-a-string.md
@@ -1,6 +1,6 @@
-# 151. 反转字符串中的单词 - LeetCode Python/Java/C++ 题解
+# 151. 反转字符串中的单词 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[151. 反转字符串中的单词 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/151-reverse-words-in-a-string)，体验更佳！
+访问原文链接：[151. 反转字符串中的单词 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/151-reverse-words-in-a-string)，体验更佳！
力扣链接：[151. 反转字符串中的单词](https://leetcode.cn/problems/reverse-words-in-a-string), 难度等级：**中等**。
@@ -182,7 +182,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[151. 反转字符串中的单词 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/151-reverse-words-in-a-string).
+原文链接：[151. 反转字符串中的单词 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/151-reverse-words-in-a-string).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/160-intersection-of-two-linked-lists.md b/zh/1-1000/160-intersection-of-two-linked-lists.md
index a7e80db..33a910c 100644
--- a/zh/1-1000/160-intersection-of-two-linked-lists.md
+++ b/zh/1-1000/160-intersection-of-two-linked-lists.md
@@ -1,6 +1,6 @@
-# 160. 相交链表 - LeetCode Python/Java/C++ 题解
+# 160. 相交链表 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[160. 相交链表 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/160-intersection-of-two-linked-lists)，体验更佳！
+访问原文链接：[160. 相交链表 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/160-intersection-of-two-linked-lists)，体验更佳！
力扣链接：[160. 相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists), 难度等级：**简单**。
@@ -495,7 +495,7 @@ func getIntersectionNode(headA, headB *ListNode) *ListNode {
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[160. 相交链表 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/160-intersection-of-two-linked-lists).
+原文链接：[160. 相交链表 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/160-intersection-of-two-linked-lists).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/18-4sum.md b/zh/1-1000/18-4sum.md
index 24e51ab..55919e3 100644
--- a/zh/1-1000/18-4sum.md
+++ b/zh/1-1000/18-4sum.md
@@ -1,6 +1,6 @@
-# 18. 四数之和 - LeetCode Python/Java/C++ 题解
+# 18. 四数之和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[18. 四数之和 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/18-4sum)，体验更佳！
+访问原文链接：[18. 四数之和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/18-4sum)，体验更佳！
力扣链接：[18. 四数之和](https://leetcode.cn/problems/4sum), 难度等级：**中等**。
@@ -374,7 +374,7 @@ public class Solution {
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[18. 四数之和 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/18-4sum).
+原文链接：[18. 四数之和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/18-4sum).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/19-remove-nth-node-from-end-of-list.md b/zh/1-1000/19-remove-nth-node-from-end-of-list.md
index f592bc0..cd23f08 100644
--- a/zh/1-1000/19-remove-nth-node-from-end-of-list.md
+++ b/zh/1-1000/19-remove-nth-node-from-end-of-list.md
@@ -1,6 +1,6 @@
-# 19. 删除链表的倒数第 N 个结点 - LeetCode Python/Java/C++ 题解
+# 19. 删除链表的倒数第 N 个结点 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[19. 删除链表的倒数第 N 个结点 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/19-remove-nth-node-from-end-of-list)，体验更佳！
+访问原文链接：[19. 删除链表的倒数第 N 个结点 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/19-remove-nth-node-from-end-of-list)，体验更佳！
力扣链接：[19. 删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list), 难度等级：**中等**。
@@ -385,7 +385,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[19. 删除链表的倒数第 N 个结点 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/19-remove-nth-node-from-end-of-list).
+原文链接：[19. 删除链表的倒数第 N 个结点 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/19-remove-nth-node-from-end-of-list).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/20-valid-parentheses.md b/zh/1-1000/20-valid-parentheses.md
index b18362a..0802eff 100644
--- a/zh/1-1000/20-valid-parentheses.md
+++ b/zh/1-1000/20-valid-parentheses.md
@@ -1,6 +1,6 @@
-# 20. 有效的括号 - LeetCode Python/Java/C++ 题解
+# 20. 有效的括号 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[20. 有效的括号 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/20-valid-parentheses)，体验更佳！
+访问原文链接：[20. 有效的括号 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/20-valid-parentheses)，体验更佳！
力扣链接：[20. 有效的括号](https://leetcode.cn/problems/valid-parentheses), 难度等级：**简单**。
@@ -351,7 +351,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[20. 有效的括号 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/20-valid-parentheses).
+原文链接：[20. 有效的括号 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/20-valid-parentheses).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/202-happy-number.md b/zh/1-1000/202-happy-number.md
index 0f36336..4052dd4 100644
--- a/zh/1-1000/202-happy-number.md
+++ b/zh/1-1000/202-happy-number.md
@@ -1,6 +1,6 @@
-# 202. 快乐数 - LeetCode Python/Java/C++ 题解
+# 202. 快乐数 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[202. 快乐数 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/202-happy-number)，体验更佳！
+访问原文链接：[202. 快乐数 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/202-happy-number)，体验更佳！
力扣链接：[202. 快乐数](https://leetcode.cn/problems/happy-number), 难度等级：**简单**。
@@ -274,7 +274,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[202. 快乐数 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/202-happy-number).
+原文链接：[202. 快乐数 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/202-happy-number).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/203-remove-linked-list-elements.md b/zh/1-1000/203-remove-linked-list-elements.md
index 334b57b..1efd924 100644
--- a/zh/1-1000/203-remove-linked-list-elements.md
+++ b/zh/1-1000/203-remove-linked-list-elements.md
@@ -1,6 +1,6 @@
-# 203. 移除链表元素 - LeetCode Python/Java/C++ 题解
+# 203. 移除链表元素 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[203. 移除链表元素 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/203-remove-linked-list-elements)，体验更佳！
+访问原文链接：[203. 移除链表元素 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/203-remove-linked-list-elements)，体验更佳！
力扣链接：[203. 移除链表元素](https://leetcode.cn/problems/remove-linked-list-elements), 难度等级：**简单**。
@@ -267,7 +267,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[203. 移除链表元素 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/203-remove-linked-list-elements).
+原文链接：[203. 移除链表元素 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/203-remove-linked-list-elements).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/206-reverse-linked-list.md b/zh/1-1000/206-reverse-linked-list.md
index 8e5629c..d6ec349 100644
--- a/zh/1-1000/206-reverse-linked-list.md
+++ b/zh/1-1000/206-reverse-linked-list.md
@@ -1,6 +1,6 @@
-# 206. 反转链表 - LeetCode Python/Java/C++ 题解
+# 206. 反转链表 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[206. 反转链表 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/206-reverse-linked-list)，体验更佳！
+访问原文链接：[206. 反转链表 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/206-reverse-linked-list)，体验更佳！
力扣链接：[206. 反转链表](https://leetcode.cn/problems/reverse-linked-list), 难度等级：**简单**。
@@ -289,7 +289,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[206. 反转链表 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/206-reverse-linked-list).
+原文链接：[206. 反转链表 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/206-reverse-linked-list).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/209-minimum-size-subarray-sum.md b/zh/1-1000/209-minimum-size-subarray-sum.md
index 1e3f6ff..dd2236e 100644
--- a/zh/1-1000/209-minimum-size-subarray-sum.md
+++ b/zh/1-1000/209-minimum-size-subarray-sum.md
@@ -1,6 +1,6 @@
-# 209. 长度最小的子数组 - LeetCode Python/Java/C++ 题解
+# 209. 长度最小的子数组 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[209. 长度最小的子数组 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/209-minimum-size-subarray-sum)，体验更佳！
+访问原文链接：[209. 长度最小的子数组 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/209-minimum-size-subarray-sum)，体验更佳！
力扣链接：[209. 长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum), 难度等级：**中等**。
@@ -295,7 +295,7 @@ public:
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[209. 长度最小的子数组 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/209-minimum-size-subarray-sum).
+原文链接：[209. 长度最小的子数组 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/209-minimum-size-subarray-sum).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/225-implement-stack-using-queues.md b/zh/1-1000/225-implement-stack-using-queues.md
index bc8064b..b17cd66 100644
--- a/zh/1-1000/225-implement-stack-using-queues.md
+++ b/zh/1-1000/225-implement-stack-using-queues.md
@@ -1,6 +1,6 @@
-# 225. 用队列实现栈 - LeetCode Python/Java/C++ 题解
+# 225. 用队列实现栈 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[225. 用队列实现栈 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/225-implement-stack-using-queues)，体验更佳！
+访问原文链接：[225. 用队列实现栈 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/225-implement-stack-using-queues)，体验更佳！
力扣链接：[225. 用队列实现栈](https://leetcode.cn/problems/implement-stack-using-queues), 难度等级：**简单**。
@@ -705,7 +705,7 @@ public class MyStack
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[225. 用队列实现栈 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/225-implement-stack-using-queues).
+原文链接：[225. 用队列实现栈 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/225-implement-stack-using-queues).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/232-implement-queue-using-stacks.md b/zh/1-1000/232-implement-queue-using-stacks.md
index ddbc82f..710daff 100644
--- a/zh/1-1000/232-implement-queue-using-stacks.md
+++ b/zh/1-1000/232-implement-queue-using-stacks.md
@@ -1,6 +1,6 @@
-# 232. 用栈实现队列 - LeetCode Python/Java/C++ 题解
+# 232. 用栈实现队列 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[232. 用栈实现队列 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/232-implement-queue-using-stacks)，体验更佳！
+访问原文链接：[232. 用栈实现队列 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/232-implement-queue-using-stacks)，体验更佳！
力扣链接：[232. 用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks), 难度等级：**简单**。
@@ -351,7 +351,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[232. 用栈实现队列 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/232-implement-queue-using-stacks).
+原文链接：[232. 用栈实现队列 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/232-implement-queue-using-stacks).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/238-product-of-array-except-self.md b/zh/1-1000/238-product-of-array-except-self.md
new file mode 100644
index 0000000..abb2a3b
--- /dev/null
+++ b/zh/1-1000/238-product-of-array-except-self.md
@@ -0,0 +1,550 @@
+# 238. 除自身以外数组的乘积 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
+
+访问原文链接：[238. 除自身以外数组的乘积 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/238-product-of-array-except-self)，体验更佳！
+
+力扣链接：[238. 除自身以外数组的乘积](https://leetcode.cn/problems/product-of-array-except-self), 难度等级：**中等**。
+
+## LeetCode “238. 除自身以外数组的乘积”问题描述
+
+给你一个整数数组 `nums`，返回 数组 `answer` ，其中 `answer[i]` 等于 `nums` 中除 `nums[i]` 之外其余各元素的乘积 。
+
+题目数据 **保证** 数组 `nums` 之中任意元素的全部前缀元素和后缀的乘积都在 **32 位** 整数范围内。
+
+请 **不要使用除法**，且在 `O(n)` 时间复杂度内完成此题。
+
+### [示例 1]
+
+**输入**: `nums = [1,2,3,4]`
+
+**输出**: `[24,12,8,6]`
+
+### [示例 2]
+
+**输入**: `nums = [-1,1,0,-3,3]`
+
+**输出**: `[0,0,9,0,0]`
+
+### [约束]
+
+- `2 <= nums.length <= 10^5`
+- `-30 <= nums[i] <= 30`
+- 输入 **保证** 数组 `answer[i]` 在 **32 位** 整数范围内
+
+
+**进阶**：你可以在 `O(1)` 的额外空间复杂度内完成这个题目吗？（ 出于对空间复杂度分析的目的，输出数组 **不被视为** 额外空间。）
+
+### [Hints]
+
+
+ 提示 1
+ Think how you can efficiently utilize prefix and suffix products to calculate the product of all elements except self for each index. Can you pre-compute the prefix and suffix products in linear time to avoid redundant calculations?
+
+
+
+
+
+
+ 提示 2
+ Can you minimize additional space usage by reusing memory or modifying the input array to store intermediate results?
+
+
+
+
+## 思路 1
+
+1. **分解问题**：将"除自身外的乘积"分解为"左侧乘积 × 右侧乘积"
+2. **两次遍历**：先计算每个元素的左侧乘积，再计算右侧乘积
+3. **合并结果**：将左右乘积相乘得到最终结果
+
+## “预计算技术”的模式
+
+**预计算技术（Pre-Computation Techniques）** 是一种通过提前计算并存储中间结果或常用数据，以减少实时计算开销的优化方法。其核心思想是**“用空间换时间”**。
+
+#### 主要应用场景
+
+- **数组的前缀/后缀**计算问题。
+- **高频计算问题**：如斐波那契数列、阶乘、素数表等，通过预先生成查找表（Lookup Table）避免重复计算。
+- **动态规划（DP）**：预先计算子问题的解并存储，如背包问题、最短路径问题。
+
+## 步骤
+
+1. **初始化数组**：
+ - 创建`leftProducts`数组，存储每个元素左侧所有元素的乘积
+ - 创建`rightProducts`数组，存储每个元素右侧所有元素的乘积
+
+2. **计算左侧乘积**（从左到右遍历）：
+ - 第一个元素左侧乘积初始化为1
+ - 后续元素：`leftProducts[i] = nums[i-1] * leftProducts[i-1]`
+
+3. **计算右侧乘积**（从右到左遍历）：
+ - 最后一个元素右侧乘积初始化为1
+ - 前序元素：`rightProducts[i] = nums[i+1] * rightProducts[i+1]`
+
+4. **合并结果**：
+ - 遍历每个位置，将左右乘积相乘：`answer[i] = leftProducts[i] * rightProducts[i]`
+
+5. **返回结果数组**
+
+## 复杂度
+
+- 时间复杂度: `O(N)`.
+- 空间复杂度: `O(N)`.
+
+## Ruby
+
+```ruby
+# @param {Integer[]} nums
+# @return {Integer[]}
+def product_except_self(nums)
+ # nums: [1, 2, 3, 4]
+ # left_products: [1, 1, 2, 6]
+ # right_products: [24,12, 4, 1]
+ # answer: [24,12, 8, 6]
+ size = nums.size
+
+ left_products = Array.new(size, 1)
+ (1...size).each do |i|
+ left_products[i] = nums[i - 1] * left_products[i - 1]
+ end
+
+ right_products = Array.new(size, 1)
+ (size - 2).downto(0) do |i|
+ right_products[i] = nums[i + 1] * right_products[i + 1]
+ end
+
+ answer = []
+ (0...size).each do |i|
+ answer << left_products[i] * right_products[i]
+ end
+
+ answer
+end
+```
+
+## Python
+
+```python
+class Solution:
+ def productExceptSelf(self, nums: List[int]) -> List[int]:
+ size = len(nums)
+
+ # nums: [1, 2, 3, 4]
+ # left_products: [1, 1, 2, 6]
+ # right_products: [24,12, 4, 1]
+ # answer: [24,12, 8, 6]
+ left_products = [1] * size
+ for i in range(1, size):
+ left_products[i] = nums[i - 1] * left_products[i - 1]
+
+ right_products = [1] * size
+ for i in range(size - 2, -1, -1):
+ right_products[i] = nums[i + 1] * right_products[i + 1]
+
+ answer = []
+ for i in range(size):
+ answer.append(left_products[i] * right_products[i])
+
+ return answer
+```
+
+## Java
+
+```java
+class Solution {
+ public int[] productExceptSelf(int[] nums) {
+ int size = nums.length;
+ // nums: [1, 2, 3, 4]
+ // left_products: [1, 1, 2, 6]
+ // right_products: [24,12, 4, 1]
+ // answer: [24,12, 8, 6]
+ int[] leftProducts = new int[size];
+ leftProducts[0] = 1;
+ for (int i = 1; i < size; i++) {
+ leftProducts[i] = nums[i - 1] * leftProducts[i - 1];
+ }
+
+ int[] rightProducts = new int[size];
+ rightProducts[size - 1] = 1;
+ for (int i = size - 2; i >= 0; i--) {
+ rightProducts[i] = nums[i + 1] * rightProducts[i + 1];
+ }
+
+ int[] answer = new int[size];
+ for (int i = 0; i < size; i++) {
+ answer[i] = leftProducts[i] * rightProducts[i];
+ }
+
+ return answer;
+ }
+}
+```
+
+## C++
+
+```cpp
+class Solution {
+public:
+ vector productExceptSelf(vector& nums) {
+ int size = nums.size();
+ // nums: [1, 2, 3, 4]
+ // left_products: [1, 1, 2, 6]
+ // right_products: [24,12, 4, 1]
+ // answer: [24,12, 8, 6]
+ vector left_products(size, 1);
+ for (int i = 1; i < size; i++) {
+ left_products[i] = nums[i - 1] * left_products[i - 1];
+ }
+
+ vector right_products(size, 1);
+ for (int i = size - 2; i >= 0; i--) {
+ right_products[i] = nums[i + 1] * right_products[i + 1];
+ }
+
+ vector answer(size);
+ for (int i = 0; i < size; i++) {
+ answer[i] = left_products[i] * right_products[i];
+ }
+
+ return answer;
+ }
+};
+```
+
+## JavaScript
+
+```javascript
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var productExceptSelf = function(nums) {
+ const size = nums.length
+
+ const leftProducts = new Array(size).fill(1)
+ for (let i = 1; i < size; i++) {
+ leftProducts[i] = nums[i - 1] * leftProducts[i - 1]
+ }
+
+ const rightProducts = new Array(size).fill(1)
+ for (let i = size - 2; i >= 0; i--) {
+ rightProducts[i] = nums[i + 1] * rightProducts[i + 1]
+ }
+
+ const answer = []
+ for (let i = 0; i < size; i++) {
+ answer.push(leftProducts[i] * rightProducts[i])
+ }
+
+ return answer
+};
+
+```
+
+## C#
+
+```csharp
+public class Solution
+{
+ public int[] ProductExceptSelf(int[] nums)
+ {
+ int size = nums.Length;
+ // nums: [1, 2, 3, 4]
+ // left_products: [1, 1, 2, 6]
+ // right_products: [24,12, 4, 1]
+ // answer: [24,12, 8, 6]
+ int[] leftProducts = new int[size];
+ leftProducts[0] = 1;
+
+ for (int i = 1; i < size; i++)
+ leftProducts[i] = nums[i - 1] * leftProducts[i - 1];
+
+ int[] rightProducts = new int[size];
+ rightProducts[size - 1] = 1;
+
+ for (int i = size - 2; i >= 0; i--)
+ rightProducts[i] = nums[i + 1] * rightProducts[i + 1];
+
+ int[] answer = new int[size];
+
+ for (int i = 0; i < size; i++)
+ answer[i] = leftProducts[i] * rightProducts[i];
+
+ return answer;
+ }
+}
+```
+
+## Go
+
+```go
+func productExceptSelf(nums []int) []int {
+ size := len(nums)
+
+ leftProducts := make([]int, size)
+ leftProducts[0] = 1
+ for i := 1; i < size; i++ {
+ leftProducts[i] = nums[i - 1] * leftProducts[i - 1]
+ }
+
+ rightProducts := make([]int, size)
+ rightProducts[size - 1] = 1
+ for i := size - 2; i >= 0; i-- {
+ rightProducts[i] = nums[i + 1] * rightProducts[i + 1]
+ }
+
+ answer := make([]int, size)
+ for i := 0; i < size; i++ {
+ answer[i] = leftProducts[i] * rightProducts[i]
+ }
+
+ return answer
+}
+```
+
+## Other languages
+
+```java
+// Welcome to create a PR to complete the code of this language, thanks!
+```
+
+## 思路 2
+
+1. **空间优化**：利用输出数组存储中间结果，避免额外空间
+2. **两阶段计算**：先计算左侧乘积存入结果，再动态计算右侧乘积并直接合并
+3. **原地操作**：仅使用一个变量动态维护右侧乘积
+
+## 步骤
+
+1. **初始化结果数组**：
+ - 创建大小相同的`answer`数组，初始值全1
+
+2. **计算左侧乘积**（左→右遍历）：
+ - 初始化`left_product = 1`
+ - 遍历时：`answer[i] = left_product`，然后`left_product *= nums[i]`
+
+3. **计算右侧乘积并合并**（右→左遍历）：
+ - 初始化`right_product = 1`
+ - 遍历时：`answer[i] *= right_product`，然后`right_product *= nums[i]`
+
+4. **返回结果数组**
+ - 空间复杂度：O(1)（输出数组不计入空间复杂度）
+
+## 复杂度
+
+- 时间复杂度: `O(N)`.
+- 空间复杂度: `O(1)`.
+
+## Ruby
+
+```ruby
+# @param {Integer[]} nums
+# @return {Integer[]}
+def product_except_self(nums)
+ size = nums.size
+ answer = Array.new(size, 1)
+
+ left_product = 1
+ (0...size).each do |i|
+ answer[i] = left_product
+ left_product *= nums[i]
+ end
+
+ # nums: [1, 2, 3, 4]
+ # answer: [1, 1, 2, 6] left_product done
+ # answer: [24,12, 8, 6] right_product done
+
+ right_product = 1
+ (size - 1).downto(0) do |i|
+ answer[i] *= right_product
+ right_product *= nums[i]
+ end
+
+ answer
+end
+```
+
+## Python
+
+```python
+class Solution:
+ def productExceptSelf(self, nums: List[int]) -> List[int]:
+ size = len(nums)
+ answer = [1] * size
+
+ left_product = 1
+ for i in range(size):
+ answer[i] = left_product
+ left_product *= nums[i]
+
+ # nums: [1, 2, 3, 4]
+ # answer: [1, 1, 2, 6] left_product done
+ # answer: [24,12, 8, 6] right_product done
+
+ right_product = 1
+ for i in range(size-1, -1, -1):
+ answer[i] *= right_product
+ right_product *= nums[i]
+
+ return answer
+```
+
+## Java
+
+```java
+class Solution {
+ public int[] productExceptSelf(int[] nums) {
+ int size = nums.length;
+ int[] answer = new int[size];
+ Arrays.fill(answer, 1);
+
+ int leftProduct = 1;
+ for (int i = 0; i < size; i++) {
+ answer[i] = leftProduct;
+ leftProduct *= nums[i];
+ }
+
+ // nums: [1, 2, 3, 4]
+ // answer: [1, 1, 2, 6] leftProduct done
+ // answer: [24,12, 8, 6] rightProduct done
+
+ int rightProduct = 1;
+ for (int i = size - 1; i >= 0; i--) {
+ answer[i] *= rightProduct;
+ rightProduct *= nums[i];
+ }
+
+ return answer;
+ }
+}
+```
+
+## C++
+
+```cpp
+class Solution {
+public:
+ vector productExceptSelf(vector& nums) {
+ int size = nums.size();
+ vector answer(size, 1);
+
+ int left_product = 1;
+ for (int i = 0; i < size; ++i) {
+ answer[i] = left_product;
+ left_product *= nums[i];
+ }
+
+ // nums: [1, 2, 3, 4]
+ // answer: [1, 1, 2, 6] left_product done
+ // answer: [24,12, 8, 6] right_product done
+
+ int right_product = 1;
+ for (int i = size - 1; i >= 0; --i) {
+ answer[i] *= right_product;
+ right_product *= nums[i];
+ }
+
+ return answer;
+ }
+};
+```
+
+## JavaScript
+
+```javascript
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var productExceptSelf = function(nums) {
+ const answer = [];
+ let left_product = 1;
+
+ for (let i = 0; i < nums.length; i++) {
+ answer[i] = left_product;
+ left_product *= nums[i];
+ }
+
+ // nums: [1, 2, 3, 4]
+ // answer: [1, 1, 2, 6] left_product done
+ // answer: [24,12, 8, 6] right_product done
+
+ right_product = 1;
+
+ for (let i = nums.length - 1; i >= 0; i--) {
+ answer[i] *= right_product;
+ right_product *= nums[i];
+ }
+
+ return answer;
+};
+```
+
+## C#
+
+```csharp
+public class Solution
+{
+ public int[] ProductExceptSelf(int[] nums)
+ {
+ int size = nums.Length;
+ int[] answer = new int[size];
+ Array.Fill(answer, 1);
+
+ int leftProduct = 1;
+ for (int i = 0; i < size; i++)
+ {
+ answer[i] = leftProduct;
+ leftProduct *= nums[i];
+ }
+
+ // nums: [1, 2, 3, 4]
+ // answer: [1, 1, 2, 6] leftProduct done
+ // answer: [24,12, 8, 6] rightProduct done
+
+ int rightProduct = 1;
+ for (int i = size - 1; i >= 0; i--)
+ {
+ answer[i] *= rightProduct;
+ rightProduct *= nums[i];
+ }
+
+ return answer;
+ }
+}
+```
+
+## Go
+
+```go
+func productExceptSelf(nums []int) []int {
+ n := len(nums)
+ answer := make([]int, n)
+
+ answer[0] = 1
+ for i := 1; i < n; i++ {
+ answer[i] = answer[i-1] * nums[i-1]
+ }
+
+ right := 1
+ for i := n - 1; i >= 0; i-- {
+ answer[i] *= right
+ right *= nums[i]
+ }
+
+ return answer
+}
+```
+
+## Other languages
+
+```java
+// Welcome to create a PR to complete the code of this language, thanks!
+```
+
+亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
+本站敢称力扣题解最佳实践，终将省你大量刷题时间！
+
+原文链接：[238. 除自身以外数组的乘积 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/238-product-of-array-except-self).
+
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
+
diff --git a/zh/1-1000/24-swap-nodes-in-pairs.md b/zh/1-1000/24-swap-nodes-in-pairs.md
index ad29416..fe64f5c 100644
--- a/zh/1-1000/24-swap-nodes-in-pairs.md
+++ b/zh/1-1000/24-swap-nodes-in-pairs.md
@@ -1,6 +1,6 @@
-# 24. 两两交换链表中的节点 - LeetCode Python/Java/C++ 题解
+# 24. 两两交换链表中的节点 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[24. 两两交换链表中的节点 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/24-swap-nodes-in-pairs)，体验更佳！
+访问原文链接：[24. 两两交换链表中的节点 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/24-swap-nodes-in-pairs)，体验更佳！
力扣链接：[24. 两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs), 难度等级：**中等**。
@@ -373,7 +373,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[24. 两两交换链表中的节点 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/24-swap-nodes-in-pairs).
+原文链接：[24. 两两交换链表中的节点 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/24-swap-nodes-in-pairs).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/242-valid-anagram.md b/zh/1-1000/242-valid-anagram.md
index 68525dd..47dbf72 100644
--- a/zh/1-1000/242-valid-anagram.md
+++ b/zh/1-1000/242-valid-anagram.md
@@ -1,6 +1,6 @@
-# 242. 有效的字母异位词 - LeetCode Python/Java/C++ 题解
+# 242. 有效的字母异位词 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[242. 有效的字母异位词 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/242-valid-anagram)，体验更佳！
+访问原文链接：[242. 有效的字母异位词 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/242-valid-anagram)，体验更佳！
力扣链接：[242. 有效的字母异位词](https://leetcode.cn/problems/valid-anagram), 难度等级：**简单**。
@@ -218,7 +218,7 @@ public:
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[242. 有效的字母异位词 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/242-valid-anagram).
+原文链接：[242. 有效的字母异位词 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/242-valid-anagram).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/27-remove-element.md b/zh/1-1000/27-remove-element.md
index 38fbcb9..4f4bc03 100644
--- a/zh/1-1000/27-remove-element.md
+++ b/zh/1-1000/27-remove-element.md
@@ -1,6 +1,6 @@
-# 27. 移除元素 - LeetCode Python/Java/C++ 题解
+# 27. 移除元素 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[27. 移除元素 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/27-remove-element)，体验更佳！
+访问原文链接：[27. 移除元素 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/27-remove-element)，体验更佳！
力扣链接：[27. 移除元素](https://leetcode.cn/problems/remove-element), 难度等级：**简单**。
@@ -431,7 +431,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[27. 移除元素 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/27-remove-element).
+原文链接：[27. 移除元素 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/27-remove-element).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md b/zh/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md
index 5084d6c..e5a6720 100644
--- a/zh/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md
+++ b/zh/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md
@@ -1,6 +1,6 @@
-# 28. 找出字符串中第一个匹配项的下标 - LeetCode Python/Java/C++ 题解
+# 28. 找出字符串中第一个匹配项的下标 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[28. 找出字符串中第一个匹配项的下标 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/28-find-the-index-of-the-first-occurrence-in-a-string)，体验更佳！
+访问原文链接：[28. 找出字符串中第一个匹配项的下标 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/28-find-the-index-of-the-first-occurrence-in-a-string)，体验更佳！
力扣链接：[28. 找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string), 难度等级：**简单**。
@@ -198,7 +198,7 @@ public class Solution {
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[28. 找出字符串中第一个匹配项的下标 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/28-find-the-index-of-the-first-occurrence-in-a-string).
+原文链接：[28. 找出字符串中第一个匹配项的下标 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/28-find-the-index-of-the-first-occurrence-in-a-string).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/303-range-sum-query-immutable.md b/zh/1-1000/303-range-sum-query-immutable.md
index e970afa..78aadb7 100644
--- a/zh/1-1000/303-range-sum-query-immutable.md
+++ b/zh/1-1000/303-range-sum-query-immutable.md
@@ -1,6 +1,6 @@
-# 303. 区域和检索 - 数组不可变 - LeetCode Python/Java/C++ 题解
+# 303. 区域和检索 - 数组不可变 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[303. 区域和检索 - 数组不可变 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/303-range-sum-query-immutable)，体验更佳！
+访问原文链接：[303. 区域和检索 - 数组不可变 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/303-range-sum-query-immutable)，体验更佳！
力扣链接：[303. 区域和检索 - 数组不可变](https://leetcode.cn/problems/range-sum-query-immutable), 难度等级：**简单**。
@@ -234,7 +234,7 @@ class NumArray:
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[303. 区域和检索 - 数组不可变 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/303-range-sum-query-immutable).
+原文链接：[303. 区域和检索 - 数组不可变 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/303-range-sum-query-immutable).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/344-reverse-string.md b/zh/1-1000/344-reverse-string.md
index f4d3ed3..64b18ca 100644
--- a/zh/1-1000/344-reverse-string.md
+++ b/zh/1-1000/344-reverse-string.md
@@ -1,6 +1,6 @@
-# 344. 反转字符串 - LeetCode Python/Java/C++ 题解
+# 344. 反转字符串 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[344. 反转字符串 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/344-reverse-string)，体验更佳！
+访问原文链接：[344. 反转字符串 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/344-reverse-string)，体验更佳！
力扣链接：[344. 反转字符串](https://leetcode.cn/problems/reverse-string), 难度等级：**简单**。
@@ -215,7 +215,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[344. 反转字符串 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/344-reverse-string).
+原文链接：[344. 反转字符串 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/344-reverse-string).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/345-reverse-vowels-of-a-string.md b/zh/1-1000/345-reverse-vowels-of-a-string.md
index 92ba617..0bb139d 100644
--- a/zh/1-1000/345-reverse-vowels-of-a-string.md
+++ b/zh/1-1000/345-reverse-vowels-of-a-string.md
@@ -1,6 +1,6 @@
-# 345. 反转字符串中的元音字母 - LeetCode Python/Java/C++ 题解
+# 345. 反转字符串中的元音字母 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[345. 反转字符串中的元音字母 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/345-reverse-vowels-of-a-string)，体验更佳！
+访问原文链接：[345. 反转字符串中的元音字母 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/345-reverse-vowels-of-a-string)，体验更佳！
力扣链接：[345. 反转字符串中的元音字母](https://leetcode.cn/problems/reverse-vowels-of-a-string), 难度等级：**简单**。
@@ -297,7 +297,7 @@ func reverseVowels(s string) string {
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[345. 反转字符串中的元音字母 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/345-reverse-vowels-of-a-string).
+原文链接：[345. 反转字符串中的元音字母 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/345-reverse-vowels-of-a-string).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/349-intersection-of-two-arrays.md b/zh/1-1000/349-intersection-of-two-arrays.md
index ad3b52a..d10ffb9 100644
--- a/zh/1-1000/349-intersection-of-two-arrays.md
+++ b/zh/1-1000/349-intersection-of-two-arrays.md
@@ -1,6 +1,6 @@
-# 349. 两个数组的交集 - LeetCode Python/Java/C++ 题解
+# 349. 两个数组的交集 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[349. 两个数组的交集 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/349-intersection-of-two-arrays)，体验更佳！
+访问原文链接：[349. 两个数组的交集 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/349-intersection-of-two-arrays)，体验更佳！
力扣链接：[349. 两个数组的交集](https://leetcode.cn/problems/intersection-of-two-arrays), 难度等级：**简单**。
@@ -188,7 +188,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[349. 两个数组的交集 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/349-intersection-of-two-arrays).
+原文链接：[349. 两个数组的交集 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/349-intersection-of-two-arrays).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/383-ransom-note.md b/zh/1-1000/383-ransom-note.md
index de18712..1ef9177 100644
--- a/zh/1-1000/383-ransom-note.md
+++ b/zh/1-1000/383-ransom-note.md
@@ -1,6 +1,6 @@
-# 383. 赎金信 - LeetCode Python/Java/C++ 题解
+# 383. 赎金信 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[383. 赎金信 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/383-ransom-note)，体验更佳！
+访问原文链接：[383. 赎金信 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/383-ransom-note)，体验更佳！
力扣链接：[383. 赎金信](https://leetcode.cn/problems/ransom-note), 难度等级：**简单**。
@@ -246,7 +246,7 @@ public:
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[383. 赎金信 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/383-ransom-note).
+原文链接：[383. 赎金信 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/383-ransom-note).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/392-is-subsequence.md b/zh/1-1000/392-is-subsequence.md
index 89ff7a5..a4fdbc6 100644
--- a/zh/1-1000/392-is-subsequence.md
+++ b/zh/1-1000/392-is-subsequence.md
@@ -1,6 +1,6 @@
-# 392. 判断子序列 - LeetCode Python/Java/C++ 题解
+# 392. 判断子序列 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[392. 判断子序列 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/392-is-subsequence)，体验更佳！
+访问原文链接：[392. 判断子序列 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/392-is-subsequence)，体验更佳！
力扣链接：[392. 判断子序列](https://leetcode.cn/problems/is-subsequence), 难度等级：**中等**。
@@ -512,7 +512,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[392. 判断子序列 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/392-is-subsequence).
+原文链接：[392. 判断子序列 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/392-is-subsequence).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/416-partition-equal-subset-sum.md b/zh/1-1000/416-partition-equal-subset-sum.md
index 3a3ec25..ba2e232 100644
--- a/zh/1-1000/416-partition-equal-subset-sum.md
+++ b/zh/1-1000/416-partition-equal-subset-sum.md
@@ -1,6 +1,6 @@
-# 416. 分割等和子集 - LeetCode Python/Java/C++ 题解
+# 416. 分割等和子集 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[416. 分割等和子集 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/416-partition-equal-subset-sum)，体验更佳！
+访问原文链接：[416. 分割等和子集 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/416-partition-equal-subset-sum)，体验更佳！
力扣链接：[416. 分割等和子集](https://leetcode.cn/problems/partition-equal-subset-sum), 难度等级：**中等**。
@@ -596,7 +596,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[416. 分割等和子集 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/416-partition-equal-subset-sum).
+原文链接：[416. 分割等和子集 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/416-partition-equal-subset-sum).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/454-4sum-ii.md b/zh/1-1000/454-4sum-ii.md
index 7135380..f54ad60 100644
--- a/zh/1-1000/454-4sum-ii.md
+++ b/zh/1-1000/454-4sum-ii.md
@@ -1,6 +1,6 @@
-# 454. 四数相加 II - LeetCode Python/Java/C++ 题解
+# 454. 四数相加 II - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[454. 四数相加 II - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/454-4sum-ii)，体验更佳！
+访问原文链接：[454. 四数相加 II - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/454-4sum-ii)，体验更佳！
力扣链接：[454. 四数相加 II](https://leetcode.cn/problems/4sum-ii), 难度等级：**中等**。
@@ -274,7 +274,7 @@ public:
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[454. 四数相加 II - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/454-4sum-ii).
+原文链接：[454. 四数相加 II - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/454-4sum-ii).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/459-repeated-substring-pattern.md b/zh/1-1000/459-repeated-substring-pattern.md
index c4636e9..9f802a0 100644
--- a/zh/1-1000/459-repeated-substring-pattern.md
+++ b/zh/1-1000/459-repeated-substring-pattern.md
@@ -1,6 +1,6 @@
-# 459. 重复的子字符串 - LeetCode Python/Java/C++ 题解
+# 459. 重复的子字符串 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[459. 重复的子字符串 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/459-repeated-substring-pattern)，体验更佳！
+访问原文链接：[459. 重复的子字符串 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/459-repeated-substring-pattern)，体验更佳！
力扣链接：[459. 重复的子字符串](https://leetcode.cn/problems/repeated-substring-pattern), 难度等级：**简单**。
@@ -223,7 +223,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[459. 重复的子字符串 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/459-repeated-substring-pattern).
+原文链接：[459. 重复的子字符串 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/459-repeated-substring-pattern).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/474-ones-and-zeroes.md b/zh/1-1000/474-ones-and-zeroes.md
index b2d8b88..7203d15 100644
--- a/zh/1-1000/474-ones-and-zeroes.md
+++ b/zh/1-1000/474-ones-and-zeroes.md
@@ -1,6 +1,6 @@
-# 474. 一和零 - LeetCode Python/Java/C++ 题解
+# 474. 一和零 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[474. 一和零 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/474-ones-and-zeroes)，体验更佳！
+访问原文链接：[474. 一和零 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/474-ones-and-zeroes)，体验更佳！
力扣链接：[474. 一和零](https://leetcode.cn/problems/ones-and-zeroes), 难度等级：**中等**。
@@ -467,7 +467,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[474. 一和零 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/474-ones-and-zeroes).
+原文链接：[474. 一和零 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/474-ones-and-zeroes).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/49-group-anagrams.md b/zh/1-1000/49-group-anagrams.md
index b0a5f30..f496d2a 100644
--- a/zh/1-1000/49-group-anagrams.md
+++ b/zh/1-1000/49-group-anagrams.md
@@ -1,6 +1,6 @@
-# 49. 字母异位词分组 - LeetCode Python/Java/C++ 题解
+# 49. 字母异位词分组 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[49. 字母异位词分组 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/49-group-anagrams)，体验更佳！
+访问原文链接：[49. 字母异位词分组 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/49-group-anagrams)，体验更佳！
力扣链接：[49. 字母异位词分组](https://leetcode.cn/problems/group-anagrams), 难度等级：**中等**。
@@ -105,7 +105,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[49. 字母异位词分组 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/49-group-anagrams).
+原文链接：[49. 字母异位词分组 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/49-group-anagrams).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/494-target-sum.md b/zh/1-1000/494-target-sum.md
index 9fc1a25..105fdbc 100644
--- a/zh/1-1000/494-target-sum.md
+++ b/zh/1-1000/494-target-sum.md
@@ -1,6 +1,6 @@
-# 494. 目标和 - LeetCode Python/Java/C++ 题解
+# 494. 目标和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[494. 目标和 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/494-target-sum)，体验更佳！
+访问原文链接：[494. 目标和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/494-target-sum)，体验更佳！
力扣链接：[494. 目标和](https://leetcode.cn/problems/target-sum), 难度等级：**中等**。
@@ -336,7 +336,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[494. 目标和 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/494-target-sum).
+原文链接：[494. 目标和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/494-target-sum).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/5-longest-palindromic-substring.md b/zh/1-1000/5-longest-palindromic-substring.md
index 96097e4..4cd6342 100644
--- a/zh/1-1000/5-longest-palindromic-substring.md
+++ b/zh/1-1000/5-longest-palindromic-substring.md
@@ -1,6 +1,6 @@
-# 5. 最长回文子串 - LeetCode Python/Java/C++ 题解
+# 5. 最长回文子串 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[5. 最长回文子串 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/5-longest-palindromic-substring)，体验更佳！
+访问原文链接：[5. 最长回文子串 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/5-longest-palindromic-substring)，体验更佳！
力扣链接：[5. 最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring), 难度等级：**中等**。
@@ -143,7 +143,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[5. 最长回文子串 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/5-longest-palindromic-substring).
+原文链接：[5. 最长回文子串 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/5-longest-palindromic-substring).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/509-fibonacci-number.md b/zh/1-1000/509-fibonacci-number.md
index c14d032..1ddab6a 100644
--- a/zh/1-1000/509-fibonacci-number.md
+++ b/zh/1-1000/509-fibonacci-number.md
@@ -1,6 +1,6 @@
-# 509. 斐波那契数 - LeetCode Python/Java/C++ 题解
+# 509. 斐波那契数 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[509. 斐波那契数 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/509-fibonacci-number)，体验更佳！
+访问原文链接：[509. 斐波那契数 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/509-fibonacci-number)，体验更佳！
力扣链接：[509. 斐波那契数](https://leetcode.cn/problems/fibonacci-number), 难度等级：**简单**。
@@ -606,7 +606,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[509. 斐波那契数 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/509-fibonacci-number).
+原文链接：[509. 斐波那契数 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/509-fibonacci-number).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/53-maximum-subarray.md b/zh/1-1000/53-maximum-subarray.md
index b203d5f..7dac03d 100644
--- a/zh/1-1000/53-maximum-subarray.md
+++ b/zh/1-1000/53-maximum-subarray.md
@@ -1,6 +1,6 @@
-# 53. 最大子数组和 - LeetCode Python/Java/C++ 题解
+# 53. 最大子数组和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[53. 最大子数组和 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/53-maximum-subarray)，体验更佳！
+访问原文链接：[53. 最大子数组和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/53-maximum-subarray)，体验更佳！
力扣链接：[53. 最大子数组和](https://leetcode.cn/problems/maximum-subarray), 难度等级：**中等**。
@@ -391,7 +391,7 @@ class Solution {
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[53. 最大子数组和 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/53-maximum-subarray).
+原文链接：[53. 最大子数组和 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/53-maximum-subarray).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/541-reverse-string-ii.md b/zh/1-1000/541-reverse-string-ii.md
index 7a40e3f..c4af70d 100644
--- a/zh/1-1000/541-reverse-string-ii.md
+++ b/zh/1-1000/541-reverse-string-ii.md
@@ -1,6 +1,6 @@
-# 541. 反转字符串 II - LeetCode Python/Java/C++ 题解
+# 541. 反转字符串 II - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[541. 反转字符串 II - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/541-reverse-string-ii)，体验更佳！
+访问原文链接：[541. 反转字符串 II - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/541-reverse-string-ii)，体验更佳！
力扣链接：[541. 反转字符串 II](https://leetcode.cn/problems/reverse-string-ii), 难度等级：**简单**。
@@ -279,7 +279,7 @@ func reverseStr(s string, k int) string {
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[541. 反转字符串 II - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/541-reverse-string-ii).
+原文链接：[541. 反转字符串 II - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/541-reverse-string-ii).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/583-delete-operation-for-two-strings.md b/zh/1-1000/583-delete-operation-for-two-strings.md
index c7d5b74..0337e59 100644
--- a/zh/1-1000/583-delete-operation-for-two-strings.md
+++ b/zh/1-1000/583-delete-operation-for-two-strings.md
@@ -1,6 +1,6 @@
-# 583. 两个字符串的删除操作 - LeetCode Python/Java/C++ 题解
+# 583. 两个字符串的删除操作 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[583. 两个字符串的删除操作 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/583-delete-operation-for-two-strings)，体验更佳！
+访问原文链接：[583. 两个字符串的删除操作 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/583-delete-operation-for-two-strings)，体验更佳！
力扣链接：[583. 两个字符串的删除操作](https://leetcode.cn/problems/delete-operation-for-two-strings), 难度等级：**中等**。
@@ -330,7 +330,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[583. 两个字符串的删除操作 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/583-delete-operation-for-two-strings).
+原文链接：[583. 两个字符串的删除操作 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/583-delete-operation-for-two-strings).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/59-spiral-matrix-ii.md b/zh/1-1000/59-spiral-matrix-ii.md
index b73fc1f..ced8f60 100644
--- a/zh/1-1000/59-spiral-matrix-ii.md
+++ b/zh/1-1000/59-spiral-matrix-ii.md
@@ -1,6 +1,6 @@
-# 59. 螺旋矩阵 II - LeetCode Python/Java/C++ 题解
+# 59. 螺旋矩阵 II - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[59. 螺旋矩阵 II - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/59-spiral-matrix-ii)，体验更佳！
+访问原文链接：[59. 螺旋矩阵 II - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/59-spiral-matrix-ii)，体验更佳！
力扣链接：[59. 螺旋矩阵 II](https://leetcode.cn/problems/spiral-matrix-ii), 难度等级：**中等**。
@@ -411,7 +411,7 @@ private:
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[59. 螺旋矩阵 II - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/59-spiral-matrix-ii).
+原文链接：[59. 螺旋矩阵 II - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/59-spiral-matrix-ii).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/605-can-place-flowers.md b/zh/1-1000/605-can-place-flowers.md
index ecbb5d5..caec650 100644
--- a/zh/1-1000/605-can-place-flowers.md
+++ b/zh/1-1000/605-can-place-flowers.md
@@ -1,6 +1,6 @@
-# 605. 种花问题 - LeetCode Python/Java/C++ 题解
+# 605. 种花问题 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[605. 种花问题 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/605-can-place-flowers)，体验更佳！
+访问原文链接：[605. 种花问题 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/605-can-place-flowers)，体验更佳！
力扣链接：[605. 种花问题](https://leetcode.cn/problems/can-place-flowers), 难度等级：**简单**。
@@ -218,7 +218,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[605. 种花问题 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/605-can-place-flowers).
+原文链接：[605. 种花问题 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/605-can-place-flowers).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/704-binary-search.md b/zh/1-1000/704-binary-search.md
index ae44a55..823b84e 100644
--- a/zh/1-1000/704-binary-search.md
+++ b/zh/1-1000/704-binary-search.md
@@ -1,6 +1,6 @@
-# 704. 二分查找 - LeetCode Python/Java/C++ 题解
+# 704. 二分查找 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[704. 二分查找 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/704-binary-search)，体验更佳！
+访问原文链接：[704. 二分查找 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/704-binary-search)，体验更佳！
力扣链接：[704. 二分查找](https://leetcode.cn/problems/binary-search), 难度等级：**简单**。
@@ -237,7 +237,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[704. 二分查找 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/704-binary-search).
+原文链接：[704. 二分查找 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/704-binary-search).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/707-design-linked-list.md b/zh/1-1000/707-design-linked-list.md
index ed0812d..09fdc8b 100644
--- a/zh/1-1000/707-design-linked-list.md
+++ b/zh/1-1000/707-design-linked-list.md
@@ -1,6 +1,6 @@
-# 707. 设计链表 - LeetCode Python/Java/C++ 题解
+# 707. 设计链表 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[707. 设计链表 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/707-design-linked-list)，体验更佳！
+访问原文链接：[707. 设计链表 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/707-design-linked-list)，体验更佳！
力扣链接：[707. 设计链表](https://leetcode.cn/problems/design-linked-list), 难度等级：**中等**。
@@ -635,7 +635,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[707. 设计链表 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/707-design-linked-list).
+原文链接：[707. 设计链表 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/707-design-linked-list).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/72-edit-distance.md b/zh/1-1000/72-edit-distance.md
index 8d4391e..2d833a4 100644
--- a/zh/1-1000/72-edit-distance.md
+++ b/zh/1-1000/72-edit-distance.md
@@ -1,6 +1,6 @@
-# 72. 编辑距离 - LeetCode Python/Java/C++ 题解
+# 72. 编辑距离 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[72. 编辑距离 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/72-edit-distance)，体验更佳！
+访问原文链接：[72. 编辑距离 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/72-edit-distance)，体验更佳！
力扣链接：[72. 编辑距离](https://leetcode.cn/problems/edit-distance), 难度等级：**中等**。
@@ -377,7 +377,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[72. 编辑距离 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/72-edit-distance).
+原文链接：[72. 编辑距离 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/72-edit-distance).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/797-all-paths-from-source-to-target.md b/zh/1-1000/797-all-paths-from-source-to-target.md
index 6f8827d..bd8ee95 100644
--- a/zh/1-1000/797-all-paths-from-source-to-target.md
+++ b/zh/1-1000/797-all-paths-from-source-to-target.md
@@ -1,6 +1,6 @@
-# 797. 所有可能的路径 - LeetCode Python/Java/C++ 题解
+# 797. 所有可能的路径 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[797. 所有可能的路径 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/797-all-paths-from-source-to-target)，体验更佳！
+访问原文链接：[797. 所有可能的路径 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/797-all-paths-from-source-to-target)，体验更佳！
力扣链接：[797. 所有可能的路径](https://leetcode.cn/problems/all-paths-from-source-to-target), 难度等级：**中等**。
@@ -860,7 +860,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[797. 所有可能的路径 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/797-all-paths-from-source-to-target).
+原文链接：[797. 所有可能的路径 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/797-all-paths-from-source-to-target).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/833-find-and-replace-in-string.md b/zh/1-1000/833-find-and-replace-in-string.md
index 8840cd5..f1a3a65 100644
--- a/zh/1-1000/833-find-and-replace-in-string.md
+++ b/zh/1-1000/833-find-and-replace-in-string.md
@@ -1,6 +1,6 @@
-# 833. 字符串中的查找与替换 - LeetCode Python/Java/C++ 题解
+# 833. 字符串中的查找与替换 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[833. 字符串中的查找与替换 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/833-find-and-replace-in-string)，体验更佳！
+访问原文链接：[833. 字符串中的查找与替换 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/833-find-and-replace-in-string)，体验更佳！
力扣链接：[833. 字符串中的查找与替换](https://leetcode.cn/problems/find-and-replace-in-string), 难度等级：**中等**。
@@ -108,7 +108,7 @@ class Solution:
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[833. 字符串中的查找与替换 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/833-find-and-replace-in-string).
+原文链接：[833. 字符串中的查找与替换 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/833-find-and-replace-in-string).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1-1000/977-squares-of-a-sorted-array.md b/zh/1-1000/977-squares-of-a-sorted-array.md
index 6fc2101..907d450 100644
--- a/zh/1-1000/977-squares-of-a-sorted-array.md
+++ b/zh/1-1000/977-squares-of-a-sorted-array.md
@@ -1,6 +1,6 @@
-# 977. 有序数组的平方 - LeetCode Python/Java/C++ 题解
+# 977. 有序数组的平方 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[977. 有序数组的平方 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/977-squares-of-a-sorted-array)，体验更佳！
+访问原文链接：[977. 有序数组的平方 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/977-squares-of-a-sorted-array)，体验更佳！
力扣链接：[977. 有序数组的平方](https://leetcode.cn/problems/squares-of-a-sorted-array), 难度等级：**简单**。
@@ -349,7 +349,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[977. 有序数组的平方 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/977-squares-of-a-sorted-array).
+原文链接：[977. 有序数组的平方 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/977-squares-of-a-sorted-array).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1001-2000/1049-last-stone-weight-ii.md b/zh/1001-2000/1049-last-stone-weight-ii.md
index 74ea08e..290c7ad 100644
--- a/zh/1001-2000/1049-last-stone-weight-ii.md
+++ b/zh/1001-2000/1049-last-stone-weight-ii.md
@@ -1,6 +1,6 @@
-# 1049. 最后一块石头的重量 II - LeetCode Python/Java/C++ 题解
+# 1049. 最后一块石头的重量 II - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[1049. 最后一块石头的重量 II - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/1049-last-stone-weight-ii)，体验更佳！
+访问原文链接：[1049. 最后一块石头的重量 II - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/1049-last-stone-weight-ii)，体验更佳！
力扣链接：[1049. 最后一块石头的重量 II](https://leetcode.cn/problems/last-stone-weight-ii), 难度等级：**中等**。
@@ -592,7 +592,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[1049. 最后一块石头的重量 II - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/1049-last-stone-weight-ii).
+原文链接：[1049. 最后一块石头的重量 II - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/1049-last-stone-weight-ii).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1001-2000/1071-greatest-common-divisor-of-strings.md b/zh/1001-2000/1071-greatest-common-divisor-of-strings.md
index 10e6d1a..1529810 100644
--- a/zh/1001-2000/1071-greatest-common-divisor-of-strings.md
+++ b/zh/1001-2000/1071-greatest-common-divisor-of-strings.md
@@ -1,6 +1,6 @@
-# 1071. 字符串的最大公因子 - LeetCode Python/Java/C++ 题解
+# 1071. 字符串的最大公因子 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[1071. 字符串的最大公因子 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/1071-greatest-common-divisor-of-strings)，体验更佳！
+访问原文链接：[1071. 字符串的最大公因子 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/1071-greatest-common-divisor-of-strings)，体验更佳！
力扣链接：[1071. 字符串的最大公因子](https://leetcode.cn/problems/greatest-common-divisor-of-strings), 难度等级：**简单**。
@@ -258,7 +258,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[1071. 字符串的最大公因子 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/1071-greatest-common-divisor-of-strings).
+原文链接：[1071. 字符串的最大公因子 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/1071-greatest-common-divisor-of-strings).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1001-2000/1431-kids-with-the-greatest-number-of-candies.md b/zh/1001-2000/1431-kids-with-the-greatest-number-of-candies.md
index 15265f5..2324549 100644
--- a/zh/1001-2000/1431-kids-with-the-greatest-number-of-candies.md
+++ b/zh/1001-2000/1431-kids-with-the-greatest-number-of-candies.md
@@ -1,6 +1,6 @@
-# 1431. 拥有最多糖果的孩子 - LeetCode Python/Java/C++ 题解
+# 1431. 拥有最多糖果的孩子 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[1431. 拥有最多糖果的孩子 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/1431-kids-with-the-greatest-number-of-candies)，体验更佳！
+访问原文链接：[1431. 拥有最多糖果的孩子 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/1431-kids-with-the-greatest-number-of-candies)，体验更佳！
力扣链接：[1431. 拥有最多糖果的孩子](https://leetcode.cn/problems/kids-with-the-greatest-number-of-candies), 难度等级：**简单**。
@@ -183,7 +183,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[1431. 拥有最多糖果的孩子 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/1431-kids-with-the-greatest-number-of-candies).
+原文链接：[1431. 拥有最多糖果的孩子 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/1431-kids-with-the-greatest-number-of-candies).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/1001-2000/1768-merge-strings-alternately.md b/zh/1001-2000/1768-merge-strings-alternately.md
index c3bc033..3a03ebb 100644
--- a/zh/1001-2000/1768-merge-strings-alternately.md
+++ b/zh/1001-2000/1768-merge-strings-alternately.md
@@ -1,6 +1,6 @@
-# 1768. 交替合并字符串 - LeetCode Python/Java/C++ 题解
+# 1768. 交替合并字符串 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[1768. 交替合并字符串 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/1768-merge-strings-alternately)，体验更佳！
+访问原文链接：[1768. 交替合并字符串 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/1768-merge-strings-alternately)，体验更佳！
力扣链接：[1768. 交替合并字符串](https://leetcode.cn/problems/merge-strings-alternately), 难度等级：**简单**。
@@ -238,7 +238,7 @@ end
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[1768. 交替合并字符串 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/1768-merge-strings-alternately).
+原文链接：[1768. 交替合并字符串 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/1768-merge-strings-alternately).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/3001-4000/3478-choose-k-elements-with-maximum-sum.md b/zh/3001-4000/3478-choose-k-elements-with-maximum-sum.md
index b314eef..e9a5c1e 100644
--- a/zh/3001-4000/3478-choose-k-elements-with-maximum-sum.md
+++ b/zh/3001-4000/3478-choose-k-elements-with-maximum-sum.md
@@ -1,6 +1,6 @@
-# 3478. 选出和最大的 K 个元素 - LeetCode Python/Java/C++ 题解
+# 3478. 选出和最大的 K 个元素 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[3478. 选出和最大的 K 个元素 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/3478-choose-k-elements-with-maximum-sum)，体验更佳！
+访问原文链接：[3478. 选出和最大的 K 个元素 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/3478-choose-k-elements-with-maximum-sum)，体验更佳！
力扣链接：[3478. 选出和最大的 K 个元素](https://leetcode.cn/problems/choose-k-elements-with-maximum-sum), 难度等级：**中等**。
@@ -134,7 +134,7 @@ class Solution:
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[3478. 选出和最大的 K 个元素 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/3478-choose-k-elements-with-maximum-sum).
+原文链接：[3478. 选出和最大的 K 个元素 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/3478-choose-k-elements-with-maximum-sum).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).
diff --git a/zh/3001-4000/3494-find-the-minimum-amount-of-time-to-brew-potions.md b/zh/3001-4000/3494-find-the-minimum-amount-of-time-to-brew-potions.md
index 27f8c45..01e3bb0 100644
--- a/zh/3001-4000/3494-find-the-minimum-amount-of-time-to-brew-potions.md
+++ b/zh/3001-4000/3494-find-the-minimum-amount-of-time-to-brew-potions.md
@@ -1,6 +1,6 @@
-# 3494. 酿造药水需要的最少总时间 - LeetCode Python/Java/C++ 题解
+# 3494. 酿造药水需要的最少总时间 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解
-访问原文链接：[3494. 酿造药水需要的最少总时间 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/3494-find-the-minimum-amount-of-time-to-brew-potions)，体验更佳！
+访问原文链接：[3494. 酿造药水需要的最少总时间 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/3494-find-the-minimum-amount-of-time-to-brew-potions)，体验更佳！
力扣链接：[3494. 酿造药水需要的最少总时间](https://leetcode.cn/problems/find-the-minimum-amount-of-time-to-brew-potions), 难度等级：**中等**。
@@ -435,7 +435,7 @@ func minTime(skill []int, mana []int) int64 {
亲爱的力扣人，为了您更好的刷题体验，请访问 [LeetCode.blog](https://leetcode.blog/zh)。
本站敢称力扣题解最佳实践，终将省你大量刷题时间！
-原文链接：[3494. 酿造药水需要的最少总时间 - LeetCode Python/Java/C++ 题解](https://leetcode.blog/zh/leetcode/3494-find-the-minimum-amount-of-time-to-brew-potions).
+原文链接：[3494. 酿造药水需要的最少总时间 - LeetCode Python/Java/C++/JS/C#/Go/Ruby 题解](https://leetcode.blog/zh/leetcode/3494-find-the-minimum-amount-of-time-to-brew-potions).
-GitHub 仓库: [f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
+GitHub 仓库: [leetcode-python-java](https://github.com/leetcode-python-java/leetcode-python-java).