Skip to content

Commit a37f15b

Browse files
hogan-techhogan-tech
committed
update readme
1 parent 0365a05 commit a37f15b

File tree

2 files changed

+12
-8
lines changed

2 files changed

+12
-8
lines changed

‎.github/Question List.txt‎

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,4 +2,6 @@
22
0320-generalized-abbreviation python medium
33
0564-find-the-closest-palindrome python hard
44
0592-fraction-addition-and-subtraction python medium
5-
0290-word-pattern python easy
5+
0290-word-pattern python easy
6+
0219-contains-duplicate-ii python easy
7+
0590-n-ary-tree-postorder-traversal python easy

‎README.md‎

Lines changed: 9 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -10,10 +10,10 @@ Welcome to a robust and versatile repository of LeetCode solutions! This reposit
1010

1111
## What You'll Find Here
1212

13-
- **Wide Range of Problems:** Our collection includes an extensive range of LeetCode problems, covering various topics and difficulty levels – from Easy to Hard.
14-
- **Multi-Language Support:** We offer solutions in several programming languages, including Python, C++, JavaScript, SQL, and TypeScript, catering to a diverse coding community.
15-
- **Organized and Accessible:** Each solution is meticulously organized by difficulty and language, making it easy to navigate and find what you need.
16-
- **In-Depth Explanations:** You'll find README files in each problem folder with detailed explanations of the problem, the approach taken, and a thorough walkthrough of the solution.
13+
- **Wide Range of Problems:** Our collection includes an extensive range of LeetCode problems, covering various topics and difficulty levels – from Easy to Hard.
14+
- **Multi-Language Support:** We offer solutions in several programming languages, including Python, C++, JavaScript, SQL, and TypeScript, catering to a diverse coding community.
15+
- **Organized and Accessible:** Each solution is meticulously organized by difficulty and language, making it easy to navigate and find what you need.
16+
- **In-Depth Explanations:** You'll find README files in each problem folder with detailed explanations of the problem, the approach taken, and a thorough walkthrough of the solution.
1717

1818
## Statistics
1919

@@ -23,9 +23,9 @@ Welcome to a robust and versatile repository of LeetCode solutions! This reposit
2323

2424
The solutions are organized as follows:
2525

26-
- **Difficulty:** Problems are categorized into Easy, Medium, and Hard.
27-
- **Languages:** Solutions are available in multiple programming languages, including Python, C++, JavaScript, SQL, and TypeScript.
28-
- **Problem Titles:** Each problem is named after its LeetCode title.
26+
- **Difficulty:** Problems are categorized into Easy, Medium, and Hard.
27+
- **Languages:** Solutions are available in multiple programming languages, including Python, C++, JavaScript, SQL, and TypeScript.
28+
- **Problem Titles:** Each problem is named after its LeetCode title.
2929

3030
## Question List
3131

@@ -165,6 +165,7 @@ The solutions are organized as follows:
165165
| 0213 | [House Robber II](https://leetcode.com/problems/house-robber-ii/) | [C++](./0213-house-robber-ii/0213-house-robber-ii.cpp) | [Medium](./0213-house-robber-ii/README.md) |
166166
| 0215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [Python](./0215-kth-largest-element-in-an-array/0215-kth-largest-element-in-an-array.py) | [Medium](./0215-kth-largest-element-in-an-array/README.md) |
167167
| 0217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [Python](./0217-contains-duplicate/0217-contains-duplicate.py), [C++](./0217-contains-duplicate/0217-contains-duplicate.cpp), [JavaScript](./0217-contains-duplicate/0217-contains-duplicate.js) | [Easy](./0217-contains-duplicate/README.md) |
168+
| 0219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | [Python](./0219-contains-duplicate-ii/0219-contains-duplicate-ii.py) | [Easy](./0219-contains-duplicate-ii/README.md) |
168169
| 0224 | [Basic Calculator](https://leetcode.com/problems/basic-calculator/) | [Python](./0224-basic-calculator/0224-basic-calculator.py) | [Hard](./0224-basic-calculator/README.md) |
169170
| 0225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/) | [Python](./0225-implement-stack-using-queues/0225-implement-stack-using-queues.py) | [Easy](./0225-implement-stack-using-queues/README.md) |
170171
| 0226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [Python](./0226-invert-binary-tree/0226-invert-binary-tree.py), [JavaScript](./0226-invert-binary-tree/0226-invert-binary-tree.js) | [Easy](./0226-invert-binary-tree/README.md) |
@@ -271,6 +272,7 @@ The solutions are organized as follows:
271272
| 0573 | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation/) | [Python](./0573-squirrel-simulation/0573-squirrel-simulation.py) | [Medium](./0573-squirrel-simulation/README.md) |
272273
| 0576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/) | [Python](./0576-out-of-boundary-paths/0576-out-of-boundary-paths.py) | [Medium](./0576-out-of-boundary-paths/README.md) |
273274
| 0584 | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee/) | [SQL](./0584-find-customer-referee/0584-find-customer-referee.sql) | [Easy](./0584-find-customer-referee/README.md) |
275+
| 0590 | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal/) | [Python](./0590-n-ary-tree-postorder-traversal/0590-n-ary-tree-postorder-traversal.py) | [Easy](./0590-n-ary-tree-postorder-traversal/README.md) |
274276
| 0592 | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction/) | [Python](./0592-fraction-addition-and-subtraction/0592-fraction-addition-and-subtraction.py) | [Medium](./0592-fraction-addition-and-subtraction/README.md) |
275277
| 0595 | [Big Countries](https://leetcode.com/problems/big-countries/) | [SQL](./0595-big-countries/0595-big-countries.sql) | [Easy](./0595-big-countries/README.md) |
276278
| 0606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/) | [Python](./0606-construct-string-from-binary-tree/0606-construct-string-from-binary-tree.py) | [Easy](./0606-construct-string-from-binary-tree/README.md) |

0 commit comments

Comments
 (0)