Just me wrestling with LeetCode problems in Python (for now) for fun"
- Organize the repo with folders. It's not clear if it's better to have easy-medium-hard or just by numbers.
- Create a parallel repo with C++/Rust solutions
0001-two-sum |
0013-roman-to-integer |
0169-majority-element |
0268-missing-number |
0448-find-all-numbers-disappeared-in-an-array |
1482-how-many-numbers-are-smaller-than-the-current-number |
0035-search-insert-position |
0069-sqrtx |
0268-missing-number |
0029-divide-two-integers |
0136-single-number |
0190-reverse-bits |
0191-number-of-1-bits |
0231-power-of-two |
0268-missing-number |
0169-majority-element |
0268-missing-number |
1482-how-many-numbers-are-smaller-than-the-current-number |
0169-majority-element |
1482-how-many-numbers-are-smaller-than-the-current-number |
0013-roman-to-integer |
0014-longest-common-prefix |
0020-valid-parentheses |
0028-find-the-index-of-the-first-occurrence-in-a-string |
0058-length-of-last-word |
0125-valid-palindrome |
0412-fizz-buzz |
0175-combine-two-tables |
1395-minimum-time-visiting-all-points |
0054-spiral-matrix |
0054-spiral-matrix |
0258-add-digits |
0412-fizz-buzz |
0014-longest-common-prefix |
0020-valid-parentheses |
0026-remove-duplicates-from-sorted-array |
0027-remove-element |
0028-find-the-index-of-the-first-occurrence-in-a-string |
0125-valid-palindrome |
0028-find-the-index-of-the-first-occurrence-in-a-string |
0070-climbing-stairs |
0118-pascals-triangle |
0119-pascals-triangle-ii |
0121-best-time-to-buy-and-sell-stock |
0070-climbing-stairs |
0169-majority-element |
0190-reverse-bits |
0191-number-of-1-bits |
0021-merge-two-sorted-lists |
0050-powx-n |
0231-power-of-two |
0258-add-digits |
0021-merge-two-sorted-lists |