|
1 | | -# [LeetCode](https://leetcode.com/problemset/algorithms/)  [](./LICENSE.md)   [](https://saythanks.io/to/kamyu104)  |
| 1 | +# [LeetCode](https://leetcode.com/problemset/algorithms/)  [](./LICENSE.md)   [](https://saythanks.io/to/kamyu104)  |
2 | 2 |
|
3 | 3 | * R.I.P. to my old Leetcode repository, where there were ever `5.7k+` stars and `2.2k+` forks. 👼 |
4 | 4 | * Since free questions may be even mistakenly taken down by some companies, only solutions will be post on now. |
|
213 | 213 | 1089 | [Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/) | [C++](./C++/duplicate-zeros.cpp) [Python](./Python/duplicate-zeros.py) | _O(n)_ | _O(1)_ | Easy || |
214 | 214 | 1093 | [Statistics from a Large Sample](https://leetcode.com/problems/statistics-from-a-large-sample/) | [C++](./C++/statistics-from-a-large-sample.cpp) [Python](./Python/statistics-from-a-large-sample.py) | _O(n)_ | _O(1)_ | Medium || |
215 | 215 | 1099 | [Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/) | [C++](./C++/two-sum-less-than-k.cpp) [Python](./Python/two-sum-less-than-k.py) | _O(nlogn)_ | _O(1)_ | Easy |🔒| |
| 216 | +1109 | [Corporate Flight Bookings](https://leetcode.com/problems/corporate-flight-bookings/) | [C++](./C++/corporate-flight-bookings.cpp) [Python](./Python/corporate-flight-bookings.py) | _O(n)_ | _O(1)_ | Medium || Line Sweep |
216 | 217 |
|
217 | 218 | ## String |
218 | 219 | | # | Title | Solution | Time | Space | Difficulty | Tag | Note| |
|
306 | 307 | 1071 | [Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/) | [C++](./C++/greatest-common-divisor-of-strings.cpp) [Python](./Python/greatest-common-divisor-of-strings.py) | _O(m + n)_ | _O(1)_ | Easy || |
307 | 308 | 1078 | [Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/) | [C++](./C++/occurrences-after-bigram.cpp) [Python](./Python/occurrences-after-bigram.py) | _O(n)_ | _O(1)_ | Easy || |
308 | 309 | 1100 | [Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/) | [C++](./C++/find-k-length-substrings-with-no-repeated-characters.cpp) [Python](./Python/find-k-length-substrings-with-no-repeated-characters.py) | _O(n)_ | _O(k)_ | Medium |🔒| |
| 310 | +1108 | [Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/) | [C++](./C++/defanging-an-ip-address.cpp) [Python](./Python/defanging-an-ip-address.py) | _O(n)_ | _O(1)_ | Easy || |
309 | 311 |
|
310 | 312 | ## Linked List |
311 | 313 | | # | Title | Solution | Time | Space | Difficulty | Tag | Note| |
|
781 | 783 | 1062 | [Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/) | [C++](./C++/longest-repeating-substring.cpp) [Python](./Python/longest-repeating-substring.py) | _O(nlogn)_ | _O(n)_ | Medium |🔒| `Rabin-Karp Algorithm` |
782 | 784 | 1064 |[Fixed Point](https://leetcode.com/problems/fixed-point/)| [C++](./C++/fixed-point.cpp) [Python](./Python/fixed-point.py) | _O(logn)_ | _O(1)_ | Easy |🔒| | |
783 | 785 | 1095 |[Find in Mountain Array](https://leetcode.com/problems/find-in-mountain-array/)| [C++](./C++/find-in-mountain-array.cpp) [Python](./Python/find-in-mountain-array.py) | _O(logn)_ | _O(1)_ | Hard | | | |
| 786 | +1110 | [Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/) | [C++](./C++/delete-nodes-and-return-forest.cpp) [Python](./Python/delete-nodes-and-return-forest.py) | _O(n)_ | _O(h + d)_ | Medium | | |
784 | 787 |
|
785 | 788 | ## Binary Search Tree |
786 | 789 | | # | Title | Solution | Time | Space | Difficulty | Tag | Note| |
|
1092 | 1095 | 1058 | [Minimize Rounding Error to Meet Target](https://leetcode.com/problems/minimize-rounding-error-to-meet-target/) | [C++](./C++/minimize-rounding-error-to-meet-target.cpp) [Python](./Python/minimize-rounding-error-to-meet-target.py) | _O(n)_ on average | _O(n)_ | Medium | 🔒 | Quick Select |
1093 | 1096 | 1081| [Smallest Subsequence of Distinct Characters](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/) | [C++](./C++/smallest-subsequence-of-distinct-characters.cpp) [Python](./Python/smallest-subsequence-of-distinct-characters.py) | _O(n)_| _O(1)_| Medium | same as [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/) | Mono Stack | |
1094 | 1097 | 1090 | [Largest Values From Labels](https://leetcode.com/problems/largest-values-from-labels/) | [C++](./C++/largest-values-from-labels.cpp) [Python](./Python/largest-values-from-labels.py) | _O(nlogn)_ | _O(n)_ | Medium || |
| 1098 | +1111 | [Maximum Nesting Depth of Two Valid Parentheses Strings](https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/) | [C++](./C++/lmaximum-nesting-depth-of-two-valid-parentheses-strings.cpp) [Python](./Python/maximum-nesting-depth-of-two-valid-parentheses-strings.py) | _O(n)_ | _O(1)_ | Medium || |
1095 | 1099 |
|
1096 | 1100 | ## Graph |
1097 | 1101 | | # | Title | Solution | Time | Space | Difficulty | Tag | Note| |
|
1175 | 1179 | 1084| [Sales Analysis III](https://leetcode.com/problems/sales-analysis-iii/) | [MySQL](./MySQL/sales-analysis-iii.sql) | _O(m + n)_ | _O(m + n)_ | Easy |🔒| | |
1176 | 1180 | 1097| [Game Play Analysis V](https://leetcode.com/problems/game-play-analysis-v/) | [MySQL](./MySQL/game-play-analysis-v.sql) | _O(n^2)_ | _O(n)_ | Hard |🔒| | |
1177 | 1181 | 1098| [Unpopular Books](https://leetcode.com/problems/unpopular-books/) | [MySQL](./MySQL/unpopular-books.sql) | _O(m + n)_ | _O(n)_ | Medium |🔒| | |
| 1182 | +1107| [New Users Daily Count](https://leetcode.com/problems/new-users-daily-count/) | [MySQL](./MySQL/new-users-daily-count.sql) | _O(n)_ | _O(n)_ | Medium |🔒| | |
1178 | 1183 |
|
1179 | 1184 | ## Shell Script |
1180 | 1185 | | # | Title | Solution | Time | Space | Difficulty | Tag | Note| |
|
0 commit comments