|
1 |
| -# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (519 solved) |
| 1 | +# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (520 solved) |
2 | 2 |
|
3 | 3 | <!-- This readme was generated using [WikiLeet](<https://github.com/Zanger67/WikiLeet>) -->
|
4 | 4 |
|
@@ -201,6 +201,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
|
201 | 201 | | 540 | [Single Element in a Sorted Array](<https://leetcode.com/problems/single-element-in-a-sorted-array>) | Medium | | [solution](<markdowns/_540. Single Element in a Sorted Array.md>) | py |
|
202 | 202 | | 542 | [01 Matrix](<https://leetcode.com/problems/01-matrix>) | Medium | | [solution](<markdowns/_542. 01 Matrix.md>) | py |
|
203 | 203 | | 543 | [Diameter of Binary Tree](<https://leetcode.com/problems/diameter-of-binary-tree>) | Easy | N150 | [solution](<markdowns/_543. Diameter of Binary Tree.md>) | c, java, py |
|
| 204 | +| 559 | [Maximum Depth of N-ary Tree](<https://leetcode.com/problems/maximum-depth-of-n-ary-tree>) | Easy | | [solution](<markdowns/_559. Maximum Depth of N-ary Tree.md>) | py | |
204 | 205 | | 565 | [Array Nesting](<https://leetcode.com/problems/array-nesting>) | Medium | | [solution](<markdowns/_565. Array Nesting.md>) | py |
|
205 | 206 | | 567 | [Permutation in String](<https://leetcode.com/problems/permutation-in-string>) | Medium | N150 | [solution](<markdowns/_567. Permutation in String.md>) | py |
|
206 | 207 | | 572 | [Subtree of Another Tree](<https://leetcode.com/problems/subtree-of-another-tree>) | Easy | B75, N150 | [solution](<markdowns/_572. Subtree of Another Tree.md>) | py |
|
@@ -518,7 +519,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
|
518 | 519 | | 2979 | [Most Expensive Item That Can Not Be Bought](<https://leetcode.com/problems/most-expensive-item-that-can-not-be-bought>) | Medium | | [solution](<markdowns/_2979. Most Expensive Item That Can Not Be Bought.md>) | c, cpp, go, java, js, kt, py, rs, swift, ts |
|
519 | 520 | | 2997 | [Minimum Number of Operations to Make Array XOR Equal to K](<https://leetcode.com/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k>) | Medium | | [solution](<markdowns/_2997. Minimum Number of Operations to Make Array XOR Equal to K.md>) | java, py |
|
520 | 521 | | 3016 | [Minimum Number of Pushes to Type Word II](<https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-ii>) | Medium | Daily | [solution](<markdowns/_3016. Minimum Number of Pushes to Type Word II.md>) | py |
|
521 |
| -| 3043 | [Find the Length of the Longest Common Prefix](<https://leetcode.com/problems/find-the-length-of-the-longest-common-prefix>) | Medium | | [solution](<markdowns/_3043. Find the Length of the Longest Common Prefix.md>) | py | |
| 522 | +| 3043 | [Find the Length of the Longest Common Prefix](<https://leetcode.com/problems/find-the-length-of-the-longest-common-prefix>) | Medium | Daily | [solution](<markdowns/_3043. Find the Length of the Longest Common Prefix.md>) | py | |
522 | 523 | | 3045 | [Count Prefix and Suffix Pairs II](<https://leetcode.com/problems/count-prefix-and-suffix-pairs-ii>) | Hard | | [solution](<markdowns/_3045. Count Prefix and Suffix Pairs II.md>) | py |
|
523 | 524 | | 3064 | [Guess the Number Using Bitwise Questions I](<https://leetcode.com/problems/guess-the-number-using-bitwise-questions-i>) | Medium | | [solution](<markdowns/_3064. Guess the Number Using Bitwise Questions I.md>) | c, py |
|
524 | 525 | | 3074 | [Apple Redistribution into Boxes](<https://leetcode.com/problems/apple-redistribution-into-boxes>) | Easy | | [solution](<markdowns/_3074. Apple Redistribution into Boxes.md>) | py |
|
|
0 commit comments