Collection of LeetCode questions to ace the coding interview!
| Problem Name | Difficulty |
|---|---|
| 0070-climbing-stairs | Easy |
| 0089-gray-code | Medium |
| 0189-rotate-array | Medium |
| 0204-count-primes | Medium |
| 0231-power-of-two | Easy |
| 0279-perfect-squares | Medium |
| 0282-expression-add-operators | Hard |
| 0342-power-of-four | Easy |
| 0343-integer-break | Medium |
| 0368-largest-divisible-subset | Medium |
| 0486-predict-the-winner | Medium |
| 0523-continuous-subarray-sum | Medium |
| 0650-2-keys-keyboard | Medium |
| 1317-convert-integer-to-the-sum-of-two-no-zero-integers | Easy |
| 2033-minimum-operations-to-make-a-uni-value-grid | Medium |
| 3558-number-of-ways-to-assign-edge-weights-i | Medium |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | Easy |
| 0025-reverse-nodes-in-k-group | Hard |
| 0143-reorder-list | Medium |
| 0203-remove-linked-list-elements | Easy |
| 0206-reverse-linked-list | Easy |
| 0231-power-of-two | Easy |
| 0342-power-of-four | Easy |
| 0486-predict-the-winner | Medium |
| Problem Name | Difficulty |
|---|---|
| 0486-predict-the-winner | Medium |
| Problem Name | Difficulty |
|---|---|
| 0022-generate-parentheses | Medium |
| 0039-combination-sum | Medium |
| 0040-combination-sum-ii | Medium |
| 0047-permutations-ii | Medium |
| 0051-n-queens | Hard |
| 0052-n-queens-ii | Hard |
| 0077-combinations | Medium |
| 0079-word-search | Medium |
| 0089-gray-code | Medium |
| 0090-subsets-ii | Medium |
| 0093-restore-ip-addresses | Medium |
| 0131-palindrome-partitioning | Medium |
| 0140-word-break-ii | Hard |
| 0212-word-search-ii | Hard |
| 0257-binary-tree-paths | Easy |
| 0282-expression-add-operators | Hard |
| 0494-target-sum | Medium |
| 0698-partition-to-k-equal-sum-subsets | Medium |
| 0797-all-paths-from-source-to-target | Medium |
| 0980-unique-paths-iii | Hard |
| 1980-find-unique-binary-string | Medium |
| Problem Name | Difficulty |
|---|---|
| 0054-spiral-matrix | Medium |
| 0063-unique-paths-ii | Medium |
| 0073-set-matrix-zeroes | Medium |
| 0074-search-a-2d-matrix | Medium |
| 0079-word-search | Medium |
| 0085-maximal-rectangle | Hard |
| 0130-surrounded-regions | Medium |
| 0200-number-of-islands | Medium |
| 0212-word-search-ii | Hard |
| 0221-maximal-square | Medium |
| 0240-search-a-2d-matrix-ii | Medium |
| 0304-range-sum-query-2d-immutable | Medium |
| 0417-pacific-atlantic-water-flow | Medium |
| 0695-max-area-of-island | Medium |
| 0741-cherry-pickup | Hard |
| 0980-unique-paths-iii | Hard |
| 0994-rotting-oranges | Medium |
| 1091-shortest-path-in-binary-matrix | Medium |
| 1254-number-of-closed-islands | Medium |
| 1293-shortest-path-in-a-grid-with-obstacles-elimination | Hard |
| 1391-check-if-there-is-a-valid-path-in-a-grid | Medium |
| 1463-cherry-pickup-ii | Hard |
| 1582-special-positions-in-a-binary-matrix | Easy |
| 1631-path-with-minimum-effort | Medium |
| 1765-map-of-highest-peak | Medium |
| 1937-maximum-number-of-points-with-cost | Medium |
| 2033-minimum-operations-to-make-a-uni-value-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 0011-container-with-most-water | Medium |
| 0045-jump-game-ii | Medium |
| 0055-jump-game | Medium |
| 0134-gas-station | Medium |
| 0179-largest-number | Medium |
| 0334-increasing-triplet-subsequence | Medium |
| 0402-remove-k-digits | Medium |
| 0410-split-array-largest-sum | Hard |
| 0435-non-overlapping-intervals | Medium |
| 0452-minimum-number-of-arrows-to-burst-balloons | Medium |
| 0455-assign-cookies | Easy |
| 0621-task-scheduler | Medium |
| 0767-reorganize-string | Medium |
| 0860-lemonade-change | Easy |
| 0881-boats-to-save-people | Medium |
| 1005-maximize-sum-of-array-after-k-negations | Easy |
| 1642-furthest-building-you-can-reach | Medium |
| 1710-maximum-units-on-a-truck | Easy |
| 1877-minimize-maximum-pair-sum-in-array | Medium |
| 2144-minimum-cost-of-buying-candies-with-discount | Easy |
| 3397-maximum-number-of-distinct-elements-after-operations | Medium |
| 3633-earliest-finish-time-for-land-and-water-rides-i | Easy |
| 3635-earliest-finish-time-for-land-and-water-rides-ii | Medium |
| 3689-maximum-total-subarray-value-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0307-range-sum-query-mutable | Medium |
| 0673-number-of-longest-increasing-subsequence | Medium |
| 1649-create-sorted-array-through-instructions | Hard |
| 2940-find-building-where-alice-and-bob-can-meet | Hard |
| Problem Name | Difficulty |
|---|---|
| 0307-range-sum-query-mutable | Medium |
| 0673-number-of-longest-increasing-subsequence | Medium |
| 1649-create-sorted-array-through-instructions | Hard |
| 2940-find-building-where-alice-and-bob-can-meet | Hard |
| Problem Name | Difficulty |
|---|---|
| 0004-median-of-two-sorted-arrays | Hard |
| 0023-merge-k-sorted-lists | Hard |
| 0053-maximum-subarray | Medium |
| 0105-construct-binary-tree-from-preorder-and-inorder-traversal | Medium |
| 0106-construct-binary-tree-from-inorder-and-postorder-traversal | Medium |
| 0108-convert-sorted-array-to-binary-search-tree | Easy |
| 0148-sort-list | Medium |
| 0169-majority-element | Easy |
| 0215-kth-largest-element-in-an-array | Medium |
| 0240-search-a-2d-matrix-ii | Medium |
| 0307-range-sum-query-mutable | Medium |
| 0347-top-k-frequent-elements | Medium |
| 0654-maximum-binary-tree | Medium |
| 0918-maximum-sum-circular-subarray | Medium |
| 1649-create-sorted-array-through-instructions | Hard |
| Problem Name | Difficulty |
|---|---|
| 0089-gray-code | Medium |
| 0090-subsets-ii | Medium |
| 0231-power-of-two | Easy |
| 0338-counting-bits | Easy |
| 0342-power-of-four | Easy |
| 0421-maximum-xor-of-two-numbers-in-an-array | Medium |
| 0698-partition-to-k-equal-sum-subsets | Medium |
| 0847-shortest-path-visiting-all-nodes | Hard |
| 0980-unique-paths-iii | Hard |
| 1483-kth-ancestor-of-a-tree-node | Hard |
| 1930-unique-length-3-palindromic-subsequences | Medium |
| 2657-find-the-prefix-common-array-of-two-arrays | Medium |
| 2869-minimum-operations-to-collect-elements | Easy |
| Problem Name | Difficulty |
|---|---|
| 0208-implement-trie-prefix-tree | Medium |
| 0297-serialize-and-deserialize-binary-tree | Hard |
| 0303-range-sum-query-immutable | Easy |
| 0304-range-sum-query-2d-immutable | Medium |
| 0307-range-sum-query-mutable | Medium |
| 0460-lfu-cache | Hard |
| 1483-kth-ancestor-of-a-tree-node | Hard |
| Problem Name | Difficulty |
|---|---|
| 0098-validate-binary-search-tree | Medium |
| 0099-recover-binary-search-tree | Medium |
| 0108-convert-sorted-array-to-binary-search-tree | Easy |
| 0230-kth-smallest-element-in-a-bst | Medium |
| 0235-lowest-common-ancestor-of-a-binary-search-tree | Medium |
| 0450-delete-node-in-a-bst | Medium |
| 0653-two-sum-iv-input-is-a-bst | Easy |
| 0700-search-in-a-binary-search-tree | Easy |
| 0701-insert-into-a-binary-search-tree | Medium |
| 1038-binary-search-tree-to-greater-sum-tree | Medium |
| 1373-maximum-sum-bst-in-binary-tree | Hard |
| Problem Name | Difficulty |
|---|---|
| 0303-range-sum-query-immutable | Easy |
| 0304-range-sum-query-2d-immutable | Medium |
| 0410-split-array-largest-sum | Hard |
| 0523-continuous-subarray-sum | Medium |
| 0525-contiguous-array | Medium |
| 0560-subarray-sum-equals-k | Medium |
| 0930-binary-subarrays-with-sum | Medium |
| 0974-subarray-sums-divisible-by-k | Medium |
| 1094-car-pooling | Medium |
| 1109-corporate-flight-bookings | Medium |
| 1871-jump-game-vii | Medium |
| 1930-unique-length-3-palindromic-subsequences | Medium |
| 2302-count-subarrays-with-score-less-than-k | Hard |
| 2381-shifting-letters-ii | Medium |
| 2574-left-and-right-sum-differences | Easy |
| 2845-count-of-interesting-subarrays | Medium |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | Easy |
| 0023-merge-k-sorted-lists | Hard |
| 0025-reverse-nodes-in-k-group | Hard |
| 0061-rotate-list | Medium |
| 0092-reverse-linked-list-ii | Medium |
| 0114-flatten-binary-tree-to-linked-list | Medium |
| 0117-populating-next-right-pointers-in-each-node-ii | Medium |
| 0138-copy-list-with-random-pointer | Medium |
| 0141-linked-list-cycle | Easy |
| 0142-linked-list-cycle-ii | Medium |
| 0143-reorder-list | Medium |
| 0148-sort-list | Medium |
| 0160-intersection-of-two-linked-lists | Easy |
| 0203-remove-linked-list-elements | Easy |
| 0206-reverse-linked-list | Easy |
| 0430-flatten-a-multilevel-doubly-linked-list | Medium |
| 0460-lfu-cache | Hard |
| 0876-middle-of-the-linked-list | Easy |
| 1669-merge-in-between-linked-lists | Medium |
| 2095-delete-the-middle-node-of-a-linked-list | Medium |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0020-valid-parentheses | Easy |
| 0042-trapping-rain-water | Hard |
| 0084-largest-rectangle-in-histogram | Hard |
| 0085-maximal-rectangle | Hard |
| 0094-binary-tree-inorder-traversal | Easy |
| 0114-flatten-binary-tree-to-linked-list | Medium |
| 0143-reorder-list | Medium |
| 0144-binary-tree-preorder-traversal | Easy |
| 0402-remove-k-digits | Medium |
| 0496-next-greater-element-i | Easy |
| 0503-next-greater-element-ii | Medium |
| 0654-maximum-binary-tree | Medium |
| 0735-asteroid-collision | Medium |
| 0739-daily-temperatures | Medium |
| 0907-sum-of-subarray-minimums | Medium |
| 0962-maximum-width-ramp | Medium |
| 2104-sum-of-subarray-ranges | Medium |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| 2940-find-building-where-alice-and-bob-can-meet | Hard |
| Problem Name | Difficulty |
|---|---|
| 0139-word-break | Medium |
| 0140-word-break-ii | Hard |
| 0208-implement-trie-prefix-tree | Medium |
| 0212-word-search-ii | Hard |
| 0421-maximum-xor-of-two-numbers-in-an-array | Medium |
| 0692-top-k-frequent-words | Medium |
| 3043-find-the-length-of-the-longest-common-prefix | Medium |
| 3597-partition-string | Medium |
| Problem Name | Difficulty |
|---|---|
| 0698-partition-to-k-equal-sum-subsets | Medium |
| 0847-shortest-path-visiting-all-nodes | Hard |
| Problem Name | Difficulty |
|---|---|
| 0128-longest-consecutive-sequence | Medium |
| 0130-surrounded-regions | Medium |
| 0200-number-of-islands | Medium |
| 0547-number-of-provinces | Medium |
| 0684-redundant-connection | Medium |
| 0685-redundant-connection-ii | Hard |
| 0695-max-area-of-island | Medium |
| 0785-is-graph-bipartite | Medium |
| 0839-similar-string-groups | Hard |
| 0886-possible-bipartition | Medium |
| 1202-smallest-string-with-swaps | Medium |
| 1254-number-of-closed-islands | Medium |
| 1319-number-of-operations-to-make-network-connected | Medium |
| 1391-check-if-there-is-a-valid-path-in-a-grid | Medium |
| 1584-min-cost-to-connect-all-points | Medium |
| 1631-path-with-minimum-effort | Medium |
| Problem Name | Difficulty |
|---|---|
| 0207-course-schedule | Medium |
| 0802-find-eventual-safe-states | Medium |
| 1857-largest-color-value-in-a-directed-graph | Hard |
| 1976-number-of-ways-to-arrive-at-destination | Medium |
| 2360-longest-cycle-in-a-graph | Hard |
| Problem Name | Difficulty |
|---|---|
| 0023-merge-k-sorted-lists | Hard |
| 0215-kth-largest-element-in-an-array | Medium |
| 0239-sliding-window-maximum | Hard |
| 0347-top-k-frequent-elements | Medium |
| 0451-sort-characters-by-frequency | Medium |
| 0621-task-scheduler | Medium |
| 0692-top-k-frequent-words | Medium |
| 0743-network-delay-time | Medium |
| 0767-reorganize-string | Medium |
| 0787-cheapest-flights-within-k-stops | Medium |
| 1046-last-stone-weight | Easy |
| 1094-car-pooling | Medium |
| 1514-path-with-maximum-probability | Medium |
| 1631-path-with-minimum-effort | Medium |
| 1642-furthest-building-you-can-reach | Medium |
| 2940-find-building-where-alice-and-bob-can-meet | Hard |
| Problem Name | Difficulty |
|---|---|
| 0743-network-delay-time | Medium |
| 0787-cheapest-flights-within-k-stops | Medium |
| 1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance | Medium |
| 1514-path-with-maximum-probability | Medium |
| 1976-number-of-ways-to-arrive-at-destination | Medium |
| Problem Name | Difficulty |
|---|---|
| 0278-first-bad-version | Easy |
| 1095-find-in-mountain-array | Hard |
| Problem Name | Difficulty |
|---|---|
| 0023-merge-k-sorted-lists | Hard |
| 0148-sort-list | Medium |
| 1649-create-sorted-array-through-instructions | Hard |
| Problem Name | Difficulty |
|---|---|
| 1649-create-sorted-array-through-instructions | Hard |
| Problem Name | Difficulty |
|---|---|
| 0042-trapping-rain-water | Hard |
| 0084-largest-rectangle-in-histogram | Hard |
| 0085-maximal-rectangle | Hard |
| 0402-remove-k-digits | Medium |
| 0496-next-greater-element-i | Easy |
| 0503-next-greater-element-ii | Medium |
| 0654-maximum-binary-tree | Medium |
| 0739-daily-temperatures | Medium |
| 0907-sum-of-subarray-minimums | Medium |
| 0962-maximum-width-ramp | Medium |
| 2104-sum-of-subarray-ranges | Medium |
| 2940-find-building-where-alice-and-bob-can-meet | Hard |
| Problem Name | Difficulty |
|---|---|
| 0215-kth-largest-element-in-an-array | Medium |
| 0347-top-k-frequent-elements | Medium |
| Problem Name | Difficulty |
|---|---|
| 0239-sliding-window-maximum | Hard |
| 0918-maximum-sum-circular-subarray | Medium |
| Problem Name | Difficulty |
|---|---|
| 0239-sliding-window-maximum | Hard |
| 0918-maximum-sum-circular-subarray | Medium |
| Problem Name | Difficulty |
|---|---|
| 0169-majority-element | Easy |
| 0347-top-k-frequent-elements | Medium |
| 0451-sort-characters-by-frequency | Medium |
| 0621-task-scheduler | Medium |
| 0692-top-k-frequent-words | Medium |
| 0767-reorganize-string | Medium |
| 0992-subarrays-with-k-different-integers | Hard |
| 1497-check-if-array-pairs-are-divisible-by-k | Medium |
| 1857-largest-color-value-in-a-directed-graph | Hard |
| 2341-maximum-number-of-pairs-in-array | Easy |
| Problem Name | Difficulty |
|---|---|
| 0054-spiral-matrix | Medium |
| 0735-asteroid-collision | Medium |
| 1094-car-pooling | Medium |
| 2161-partition-array-according-to-given-pivot | Medium |
| 2365-task-scheduler-ii | Medium |
| 3597-partition-string | Medium |
| 3612-process-string-with-special-operations-i | Medium |
| 3838-weighted-word-mapping | Easy |
| Problem Name | Difficulty |
|---|---|
| 0070-climbing-stairs | Easy |
| 0139-word-break | Medium |
| 0140-word-break-ii | Hard |
| 0698-partition-to-k-equal-sum-subsets | Medium |
| 1857-largest-color-value-in-a-directed-graph | Hard |
| Problem Name | Difficulty |
|---|---|
| 1584-min-cost-to-connect-all-points | Medium |
| Problem Name | Difficulty |
|---|---|
| 0347-top-k-frequent-elements | Medium |
| 0451-sort-characters-by-frequency | Medium |
| 0692-top-k-frequent-words | Medium |
| Problem Name | Difficulty |
|---|---|
| 0430-flatten-a-multilevel-doubly-linked-list | Medium |
| 0460-lfu-cache | Hard |
| Problem Name | Difficulty |
|---|---|
| 0204-count-primes | Medium |
| 2367-number-of-arithmetic-triplets | Easy |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0204-count-primes | Medium |