A collection of LeetCode solutions to ace the coding interview!
0128-longest-consecutive-sequence |
0130-surrounded-regions |
0200-number-of-islands |
0684-redundant-connection |
0695-max-area-of-island |
0794-swim-in-rising-water |
1706-min-cost-to-connect-all-points |
0238-product-of-array-except-self |
0347-top-k-frequent-elements |
0347-top-k-frequent-elements |
0621-task-scheduler |
0215-kth-largest-element-in-an-array |
0347-top-k-frequent-elements |
1014-k-closest-points-to-origin |
0042-trapping-rain-water |
0084-largest-rectangle-in-histogram |
0739-daily-temperatures |
0883-car-fleet |
0003-longest-substring-without-repeating-characters |
0076-minimum-window-substring |
0424-longest-repeating-character-replacement |
0567-permutation-in-string |
0940-fruit-into-baskets |
0002-add-two-numbers |
0048-rotate-image |
0062-unique-paths |
0070-climbing-stairs |
0150-evaluate-reverse-polish-notation |
0202-happy-number |
0231-power-of-two |
1014-k-closest-points-to-origin |
0002-add-two-numbers |
0010-regular-expression-matching |
0021-merge-two-sorted-lists |
0025-reverse-nodes-in-k-group |
0143-reorder-list |
0206-reverse-linked-list |
0231-power-of-two |
0232-implement-queue-using-stacks |
0078-subsets |
0090-subsets-ii |
0231-power-of-two |
0287-find-the-duplicate-number |
0023-merge-k-sorted-lists |
0146-lru-cache |
0572-subtree-of-another-tree |
0572-subtree-of-another-tree |
0098-validate-binary-search-tree |
0230-kth-smallest-element-in-a-bst |
0235-lowest-common-ancestor-of-a-binary-search-tree |
0789-kth-largest-element-in-a-stream |
0295-find-median-from-data-stream |
0789-kth-largest-element-in-a-stream |
1014-k-closest-points-to-origin |
0139-word-break |
0208-implement-trie-prefix-tree |
0211-design-add-and-search-words-data-structure |
0212-word-search-ii |
0207-course-schedule |
0210-course-schedule-ii |
0329-longest-increasing-path-in-a-matrix |
0744-network-delay-time |
0803-cheapest-flights-within-k-stops |
0332-reconstruct-itinerary |
1706-min-cost-to-connect-all-points |
0070-climbing-stairs |
0139-word-break |
0329-longest-increasing-path-in-a-matrix |
3790-fruits-into-baskets-ii |
0054-spiral-matrix |
3790-fruits-into-baskets-ii |
3790-fruits-into-baskets-ii |
0062-unique-paths |
1977-minimum-interval-to-include-each-query |