My LeetCode solutions in Python, with problem statements and a topic index maintained by LeetHub v2.
- Practice translating a problem into a clear algorithm.
- Compare approaches and reason about edge cases.
- Build familiarity with arrays, strings, two pointers, binary search, and other patterns.
Solutions use LeetCode's execution format. Open the linked problem statement and use its test harness to run a solution; most files are not standalone command-line programs.
The section below is generated by LeetHub and may change when new solutions are synced.
| 1846-maximum-element-after-decreasing-and-rearranging |
| 1846-maximum-element-after-decreasing-and-rearranging |
| 3010-divide-an-array-into-subarrays-with-minimum-cost-i |
| 0001-two-sum |
| 0030-substring-with-concatenation-of-all-words |
| 3020-find-the-maximum-number-of-elements-in-subset |
| 3010-divide-an-array-into-subarrays-with-minimum-cost-i |
| 3020-find-the-maximum-number-of-elements-in-subset |
| 0069-sqrtx |
| 0744-find-smallest-letter-greater-than-target |
| 0026-remove-duplicates-from-sorted-array |
| 0042-trapping-rain-water |
| 0189-rotate-array |
| 0283-move-zeroes |
| 0029-divide-two-integers |
| 0069-sqrtx |
| 0189-rotate-array |
| 1071-greatest-common-divisor-of-strings |
| 0042-trapping-rain-water |
| 0042-trapping-rain-water |
| 0042-trapping-rain-water |
| 0030-substring-with-concatenation-of-all-words |
| 1071-greatest-common-divisor-of-strings |
| 0029-divide-two-integers |
| 0078-subsets |
| 0030-substring-with-concatenation-of-all-words |
| 0078-subsets |