Updated Description of to LeetCode description of.

gazeldx · gazeldx · commit 4c899141601b · 2025-02-08T09:53:40.000+08:00
diff --git a/en/1-1000/1-two-sum.md b/en/1-1000/1-two-sum.md
@@ -1,7 +1,7 @@
 # 1. Two Sum - Best Practices of LeetCode Solutions
 LeetCode link: [1. Two Sum](https://leetcode.com/problems/two-sum), difficulty: **Easy**
 
-## Description of "1. Two Sum"
+## LeetCode description of "1. Two Sum"
 Given an array of integers `nums` and an integer `target`, return _indices of the two numbers such that they add up to `target`_.
 
 You may assume that each input would have **_exactly_ one solution**, and you may not use the same element twice.
diff --git a/en/1-1000/15-3sum.md b/en/1-1000/15-3sum.md
@@ -1,7 +1,7 @@
 # 15. 3Sum - Best Practices of LeetCode Solutions
 LeetCode link: [15. 3Sum](https://leetcode.com/problems/3sum), difficulty: **Medium**
 
-## Description of "15. 3Sum"
+## LeetCode description of "15. 3Sum"
 Given an integer array nums, return all the triplets `[nums[i], nums[j], nums[k]]` such that `i != j`, `i != k`, and `j != k`, and `nums[i] + nums[j] + nums[k] == 0`.
 
 Notice that the solution set must not contain duplicate triplets.
diff --git a/en/1-1000/160-intersection-of-two-linked-lists.md b/en/1-1000/160-intersection-of-two-linked-lists.md
@@ -1,7 +1,7 @@
 # 160. Intersection of Two Linked Lists - Best Practices of LeetCode Solutions
 LeetCode link: [160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists), difficulty: **Easy**.
 
-## Description of "160. Intersection of Two Linked Lists"
+## LeetCode description of "160. Intersection of Two Linked Lists"
 Given the heads of two singly linked-lists `headA` and `headB`, return _the node at which the two lists intersect_. If the two linked lists have no intersection at all, return `null`.
 
 For example, the following two linked lists begin to intersect at node `c1`:
diff --git a/en/1-1000/18-4sum.md b/en/1-1000/18-4sum.md
@@ -1,7 +1,7 @@
 # 18. 4Sum - Best Practices of LeetCode Solutions
 LeetCode link: [18. 4Sum](https://leetcode.com/problems/4sum), difficulty: **Medium**
 
-## Description of "18. 4Sum"
+## LeetCode description of "18. 4Sum"
 Given an array `nums` of `n` integers, return _an array of all the **unique** quadruplets_ `[nums[a], nums[b], nums[c], nums[d]]` such that:
 
 * `0 <= a, b, c, d < n`
diff --git a/en/1-1000/20-valid-parentheses.md b/en/1-1000/20-valid-parentheses.md
@@ -1,7 +1,7 @@
 # 20. Valid Parentheses - Best Practices of LeetCode Solutions
 LeetCode link: [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses), difficulty: **Easy**
 
-## Description of "20. Valid Parentheses"
+## LeetCode description of "20. Valid Parentheses"
 Given a string `s` containing just the characters `(`, `)`, `{`, `}`, `[` and `]`, determine if the input string is valid.
 
 An input string is valid if:
diff --git a/en/1-1000/202-happy-number.md b/en/1-1000/202-happy-number.md
@@ -1,7 +1,7 @@
 # 202. Happy Number - Best Practices of LeetCode Solutions
 LeetCode link: [202. Happy Number](https://leetcode.com/problems/happy-number), difficulty: **Easy**.
 
-## Description of "202. Happy Number"
+## LeetCode description of "202. Happy Number"
 Write an algorithm to determine if a number `n` is happy.
 
 A **happy number** is a number defined by the following process:
diff --git a/en/1-1000/225-implement-stack-using-queues.md b/en/1-1000/225-implement-stack-using-queues.md
@@ -1,7 +1,7 @@
 # 225. Implement Stack using Queues - Best Practices of LeetCode Solutions
 LeetCode link: [225. Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues), difficulty: **Easy**
 
-## Description of "225. Implement Stack using Queues"
+## LeetCode description of "225. Implement Stack using Queues"
 Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (`push`, `top`, `pop`, and `empty`).
 
 Implement the `MyStack` class:
diff --git a/en/1-1000/24-swap-nodes-in-pairs.md b/en/1-1000/24-swap-nodes-in-pairs.md
@@ -1,7 +1,7 @@
 # 24. Swap Nodes in Pairs - Best Practices of LeetCode Solutions
 LeetCode link: [24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs), difficulty: **Medium**
 
-## Description of "24. Swap Nodes in Pairs"
+## LeetCode description of "24. Swap Nodes in Pairs"
 Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes (i.e., only nodes themselves may be changed.)
 
 ### [Example 1]
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
@@ -1,7 +1,7 @@
 # 28. Find the Index of the First Occurrence in a String - Best Practices of LeetCode Solutions
 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**.
 
-## Description of "28. Find the Index of the First Occurrence in a String"
+## LeetCode description of "28. Find the Index of the First Occurrence in a String"
 Given two strings `needle` and `haystack`, return the **index** of the first occurrence of `needle` in `haystack`, or `-1` if `needle` is not part of `haystack`.
 
 ### [Example 1]
diff --git a/en/1-1000/459-repeated-substring-pattern.md b/en/1-1000/459-repeated-substring-pattern.md
@@ -1,7 +1,7 @@
 # 459. Repeated Substring Pattern - Best Practices of LeetCode Solutions
 LeetCode link: [459. Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern), difficulty: **Easy**.
 
-## Description of "459. Repeated Substring Pattern"
+## LeetCode description of "459. Repeated Substring Pattern"
 Given a string `s`, check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.
 
 ### [Example 1]
