Skip to content

Commit 89f7be3

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent a13db52 commit 89f7be3

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

61 files changed

+2296
-2294
lines changed

‎.readme_updater

‎README.md

+291-291
Large diffs are not rendered by default.

‎markdowns/Daily_Questions.md

+32-32
Large diffs are not rendered by default.

‎markdowns/Easy.md

+137-428
Large diffs are not rendered by default.

‎markdowns/Medium.md

+294-1
Large diffs are not rendered by default.

‎markdowns/Questions_By_Code_Length.md

+291-291
Large diffs are not rendered by default.

‎markdowns/Questions_By_Recent.md

+291-291
Large diffs are not rendered by default.

‎markdowns/by_topic/Array.md

+138-138
Large diffs are not rendered by default.

‎markdowns/by_topic/Backtracking.md

+13-13
Original file line numberDiff line numberDiff line change
@@ -6,18 +6,18 @@
66

77
| # | Title | Level | Cats | Solution | Languages | Date Complete |
88
|-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:------------------------------------------------------------------------------------------|:------------|:----------------|
9-
| 17 | [Letter Combinations of a Phone Number](<https://leetcode.com/problems/letter-combinations-of-a-phone-number>) | Easy | N150 | [solution](<../_17. Letter Combinations of a Phone Number.md>) | java | Jul 14, 2024 |
10-
| 22 | [Generate Parentheses](<https://leetcode.com/problems/generate-parentheses>) | Easy | N150 | [solution](<../_22. Generate Parentheses.md>) | py | Jun 13, 2024 |
11-
| 39 | [Combination Sum](<https://leetcode.com/problems/combination-sum>) | Easy | B75, N150 | [solution](<../_39. Combination Sum.md>) | py | Jul 16, 2024 |
12-
| 46 | [Permutations](<https://leetcode.com/problems/permutations>) | Easy | N150 | [solution](<../_46. Permutations.md>) | py | Jun 07, 2024 |
13-
| 77 | [Combinations](<https://leetcode.com/problems/combinations>) | Easy | | [solution](<../_77. Combinations.md>) | py | Jun 07, 2024 |
14-
| 78 | [Subsets](<https://leetcode.com/problems/subsets>) | Easy | N150 | [solution](<../_78. Subsets.md>) | py | Jun 02, 2024 |
15-
| 79 | [Word Search](<https://leetcode.com/problems/word-search>) | Easy | B75, N150 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 |
16-
| 90 | [Subsets II](<https://leetcode.com/problems/subsets-ii>) | Easy | N150 | [solution](<../_90. Subsets II.md>) | py | Jul 03, 2024 |
17-
| 113 | [Path Sum II](<https://leetcode.com/problems/path-sum-ii>) | Easy | | [solution](<../_113. Path Sum II.md>) | py | Jul 03, 2024 |
9+
| 17 | [Letter Combinations of a Phone Number](<https://leetcode.com/problems/letter-combinations-of-a-phone-number>) | Medium | N150 | [solution](<../_17. Letter Combinations of a Phone Number.md>) | java | Jul 14, 2024 |
10+
| 22 | [Generate Parentheses](<https://leetcode.com/problems/generate-parentheses>) | Medium | N150 | [solution](<../_22. Generate Parentheses.md>) | py | Jun 13, 2024 |
11+
| 39 | [Combination Sum](<https://leetcode.com/problems/combination-sum>) | Medium | B75, N150 | [solution](<../_39. Combination Sum.md>) | py | Jul 16, 2024 |
12+
| 46 | [Permutations](<https://leetcode.com/problems/permutations>) | Medium | N150 | [solution](<../_46. Permutations.md>) | py | Jun 07, 2024 |
13+
| 77 | [Combinations](<https://leetcode.com/problems/combinations>) | Medium | | [solution](<../_77. Combinations.md>) | py | Jun 07, 2024 |
14+
| 78 | [Subsets](<https://leetcode.com/problems/subsets>) | Medium | N150 | [solution](<../_78. Subsets.md>) | py | Jun 02, 2024 |
15+
| 79 | [Word Search](<https://leetcode.com/problems/word-search>) | Medium | B75, N150 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 |
16+
| 90 | [Subsets II](<https://leetcode.com/problems/subsets-ii>) | Medium | N150 | [solution](<../_90. Subsets II.md>) | py | Jul 03, 2024 |
17+
| 113 | [Path Sum II](<https://leetcode.com/problems/path-sum-ii>) | Medium | | [solution](<../_113. Path Sum II.md>) | py | Jul 03, 2024 |
1818
| 212 | [Word Search II](<https://leetcode.com/problems/word-search-ii>) | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 |
19-
| 784 | [Letter Case Permutation](<https://leetcode.com/problems/letter-case-permutation>) | Easy | | [solution](<../_784. Letter Case Permutation.md>) | py | Jun 15, 2024 |
20-
| 1087 | [Brace Expansion](<https://leetcode.com/problems/brace-expansion>) | Easy | | [solution](<../_1087. Brace Expansion.md>) | py | Jun 15, 2024 |
21-
| 1239 | [Maximum Length of a Concatenated String with Unique Characters](<https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters>) | Easy | | [solution](<../_1239. Maximum Length of a Concatenated String with Unique Characters.md>) | py | Jun 29, 2024 |
19+
| 784 | [Letter Case Permutation](<https://leetcode.com/problems/letter-case-permutation>) | Medium | | [solution](<../_784. Letter Case Permutation.md>) | py | Jun 15, 2024 |
20+
| 1087 | [Brace Expansion](<https://leetcode.com/problems/brace-expansion>) | Medium | | [solution](<../_1087. Brace Expansion.md>) | py | Jun 15, 2024 |
21+
| 1239 | [Maximum Length of a Concatenated String with Unique Characters](<https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters>) | Medium | | [solution](<../_1239. Maximum Length of a Concatenated String with Unique Characters.md>) | py | Jun 29, 2024 |
2222
| 1255 | [Maximum Score Words Formed by Letters](<https://leetcode.com/problems/maximum-score-words-formed-by-letters>) | Hard | | [solution](<../_1255. Maximum Score Words Formed by Letters.md>) | py | Jun 15, 2024 |
23-
| 1980 | [Find Unique Binary String](<https://leetcode.com/problems/find-unique-binary-string>) | Easy | | [solution](<../_1980. Find Unique Binary String.md>) | c, py | Jun 27, 2024 |
23+
| 1980 | [Find Unique Binary String](<https://leetcode.com/problems/find-unique-binary-string>) | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | c, py | Jun 27, 2024 |

‎markdowns/by_topic/Binary Search Tree.md

+11-11
Original file line numberDiff line numberDiff line change
@@ -6,17 +6,17 @@
66

77
| # | Title | Level | Cats | Solution | Languages | Date Complete |
88
|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------|:-------------|:----------------|
9-
| 98 | [Validate Binary Search Tree](<https://leetcode.com/problems/validate-binary-search-tree>) | Easy | B75, N150 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 23, 2024 |
10-
| 173 | [Binary Search Tree Iterator](<https://leetcode.com/problems/binary-search-tree-iterator>) | Easy | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 |
11-
| 230 | [Kth Smallest Element in a BST](<https://leetcode.com/problems/kth-smallest-element-in-a-bst>) | Easy | B75, N150 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 29, 2024 |
12-
| 235 | [Lowest Common Ancestor of a Binary Search Tree](<https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree>) | Easy | B75, N150 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 |
9+
| 98 | [Validate Binary Search Tree](<https://leetcode.com/problems/validate-binary-search-tree>) | Medium | B75, N150 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 23, 2024 |
10+
| 173 | [Binary Search Tree Iterator](<https://leetcode.com/problems/binary-search-tree-iterator>) | Medium | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 |
11+
| 230 | [Kth Smallest Element in a BST](<https://leetcode.com/problems/kth-smallest-element-in-a-bst>) | Medium | B75, N150 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 29, 2024 |
12+
| 235 | [Lowest Common Ancestor of a Binary Search Tree](<https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree>) | Medium | B75, N150 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 |
1313
| 272 | [Closest Binary Search Tree Value II](<https://leetcode.com/problems/closest-binary-search-tree-value-ii>) | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jul 01, 2024 |
14-
| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](<https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list>) | Easy | | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 12, 2024 |
15-
| 450 | [Delete Node in a BST](<https://leetcode.com/problems/delete-node-in-a-bst>) | Easy | | [solution](<../_450. Delete Node in a BST.md>) | py | Jun 29, 2024 |
14+
| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](<https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list>) | Medium | | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 12, 2024 |
15+
| 450 | [Delete Node in a BST](<https://leetcode.com/problems/delete-node-in-a-bst>) | Medium | | [solution](<../_450. Delete Node in a BST.md>) | py | Jun 29, 2024 |
1616
| 700 | [Search in a Binary Search Tree](<https://leetcode.com/problems/search-in-a-binary-search-tree>) | Easy | | [solution](<../_700. Search in a Binary Search Tree.md>) | c, java, py | Jul 17, 2024 |
1717
| 703 | [Kth Largest Element in a Stream](<https://leetcode.com/problems/kth-largest-element-in-a-stream>) | Easy | N150 | [solution](<../_703. Kth Largest Element in a Stream.md>) | py | Jul 05, 2024 |
18-
| 776 | [Split BST](<https://leetcode.com/problems/split-bst>) | Easy | Weekly Premium | [solution](<../_776. Split BST.md>) | py | Jun 29, 2024 |
19-
| 1008 | [Construct Binary Search Tree from Preorder Traversal](<https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal>) | Easy | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, cpp, java | Jun 27, 2024 |
20-
| 1038 | [Binary Search Tree to Greater Sum Tree](<https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree>) | Easy | Daily | [solution](<../_1038. Binary Search Tree to Greater Sum Tree.md>) | c | Jun 26, 2024 |
21-
| 1305 | [All Elements in Two Binary Search Trees](<https://leetcode.com/problems/all-elements-in-two-binary-search-trees>) | Easy | | [solution](<../_1305. All Elements in Two Binary Search Trees.md>) | java | Jun 24, 2024 |
22-
| 1382 | [Balance a Binary Search Tree](<https://leetcode.com/problems/balance-a-binary-search-tree>) | Easy | Daily | [solution](<../_1382. Balance a Binary Search Tree.md>) | py | Jun 29, 2024 |
18+
| 776 | [Split BST](<https://leetcode.com/problems/split-bst>) | Medium | Weekly Premium | [solution](<../_776. Split BST.md>) | py | Jun 29, 2024 |
19+
| 1008 | [Construct Binary Search Tree from Preorder Traversal](<https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal>) | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, cpp, java | Jun 27, 2024 |
20+
| 1038 | [Binary Search Tree to Greater Sum Tree](<https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree>) | Medium | Daily | [solution](<../_1038. Binary Search Tree to Greater Sum Tree.md>) | c | Jun 26, 2024 |
21+
| 1305 | [All Elements in Two Binary Search Trees](<https://leetcode.com/problems/all-elements-in-two-binary-search-trees>) | Medium | | [solution](<../_1305. All Elements in Two Binary Search Trees.md>) | java | Jun 24, 2024 |
22+
| 1382 | [Balance a Binary Search Tree](<https://leetcode.com/problems/balance-a-binary-search-tree>) | Medium | Daily | [solution](<../_1382. Balance a Binary Search Tree.md>) | py | Jun 29, 2024 |

0 commit comments

Comments
 (0)