A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2
See more about solutions at my Notion
| Problem Name | Difficulty |
|---|---|
| 0020-valid-parentheses | |
| 0042-trapping-rain-water | |
| 0094-binary-tree-inorder-traversal | |
| 0234-palindrome-linked-list | undefined |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | |
| 0083-remove-duplicates-from-sorted-list | |
| 0141-linked-list-cycle | undefined |
| 0142-linked-list-cycle-ii | undefined |
| 0160-intersection-of-two-linked-lists | undefined |
| 0206-reverse-linked-list | undefined |
| 0234-palindrome-linked-list | undefined |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | |
| 0206-reverse-linked-list | undefined |
| 0234-palindrome-linked-list | undefined |
| Problem Name | Difficulty |
|---|---|
| 0028-find-the-index-of-the-first-occurrence-in-a-string |
| Problem Name | Difficulty |
|---|---|
| 0067-add-binary | |
| 0090-subsets-ii | undefined |
| 0187-repeated-dna-sequences | |
| 1360-maximum-length-of-a-concatenated-string-with-unique-characters | undefined |
| 1381-maximum-score-words-formed-by-letters | undefined |
| 1723-maximum-number-of-achievable-transfer-requests | undefined |
| 1873-longest-nice-substring | |
| 2130-maximum-product-of-the-length-of-two-palindromic-subsequences | undefined |
| 2482-maximum-rows-covered-by-columns | undefined |
| 3092-minimum-moves-to-spread-stones-over-grid | undefined |
| 3217-number-of-possible-sets-of-closing-branches | undefined |
| 3649-minimum-time-to-break-locks-i | undefined |
| 3852-path-existence-queries-in-a-graph-ii | undefined |
| 1000434-UEcfPD | undefined |
| Problem Name | Difficulty |
|---|---|
| 0054-spiral-matrix | |
| 0067-add-binary | |
| 0068-text-justification |
| Problem Name | Difficulty |
|---|---|
| 0070-climbing-stairs | |
| 0140-word-break-ii | undefined |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | |
| 0100-same-tree | |
| 0101-symmetric-tree | |
| 0104-maximum-depth-of-binary-tree | |
| 0108-convert-sorted-array-to-binary-search-tree |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | |
| 0100-same-tree | |
| 0101-symmetric-tree | |
| 0104-maximum-depth-of-binary-tree | |
| 0108-convert-sorted-array-to-binary-search-tree |
| Problem Name | Difficulty |
|---|---|
| 0108-convert-sorted-array-to-binary-search-tree |
| Problem Name | Difficulty |
|---|---|
| 0274-h-index |
| Problem Name | Difficulty |
|---|---|
| 0042-trapping-rain-water |
| Problem Name | Difficulty |
|---|---|
| 0014-longest-common-prefix | |
| 0140-word-break-ii | undefined |
| Problem Name | Difficulty |
|---|---|
| 0187-repeated-dna-sequences |
| Problem Name | Difficulty |
|---|---|
| 0187-repeated-dna-sequences |
| Problem Name | Difficulty |
|---|---|
| 0239-sliding-window-maximum | undefined |
| 0658-find-k-closest-elements | |
| 3217-number-of-possible-sets-of-closing-branches | undefined |
| Problem Name | Difficulty |
|---|---|
| 0036-valid-sudoku | |
| 0054-spiral-matrix | |
| 0073-set-matrix-zeroes | undefined |
| 0130-surrounded-regions | undefined |
| 0200-number-of-islands | undefined |
| 0417-pacific-atlantic-water-flow | undefined |
| 0463-island-perimeter | undefined |
| 0542-01-matrix | undefined |
| 0695-max-area-of-island | undefined |
| 0733-flood-fill | undefined |
| 0928-surface-area-of-3d-shapes | undefined |
| 0971-shortest-bridge | undefined |
| 1036-rotting-oranges | undefined |
| 1073-number-of-enclaves | undefined |
| 1171-shortest-path-in-binary-matrix | undefined |
| 1234-number-of-paths-with-max-score | undefined |
| 1380-number-of-closed-islands | undefined |
| 1876-map-of-highest-peak | undefined |
| 2035-count-sub-islands | undefined |
| 2038-nearest-exit-from-entrance-in-maze | undefined |
| 2482-maximum-rows-covered-by-columns | undefined |
| 2794-maximum-number-of-moves-in-a-grid | undefined |
| 3092-minimum-moves-to-spread-stones-over-grid | undefined |
| 3823-count-islands-with-total-value-divisible-by-k | undefined |
| 1000005-pond-sizes-lcci | undefined |
| 1000227-YesdPw | undefined |
| Problem Name | Difficulty |
|---|---|
| 1723-maximum-number-of-achievable-transfer-requests | undefined |
| 1976-splitting-a-string-into-descending-consecutive-values | undefined |
| 2482-maximum-rows-covered-by-columns | undefined |
| 3217-number-of-possible-sets-of-closing-branches | undefined |
| 4071-word-squares-ii | undefined |
| 1000434-UEcfPD | undefined |
| Problem Name | Difficulty |
|---|---|
| 1381-maximum-score-words-formed-by-letters | undefined |
| 2130-maximum-product-of-the-length-of-two-palindromic-subsequences | undefined |
| 3092-minimum-moves-to-spread-stones-over-grid | undefined |
| 3649-minimum-time-to-break-locks-i | undefined |
| Problem Name | Difficulty |
|---|---|
| 2696-the-number-of-beautiful-subsets | undefined |
| Problem Name | Difficulty |
|---|---|
| 0547-number-of-provinces | undefined |
| 0813-all-paths-from-source-to-target | undefined |
| 0871-keys-and-rooms | undefined |
| 1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph | undefined |
| 1436-get-watched-videos-by-your-friends | undefined |
| 1442-number-of-operations-to-make-network-connected | undefined |
| 2121-find-if-path-exists-in-graph | undefined |
| 2206-detonate-the-maximum-bombs | undefined |
| 2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph | undefined |
| 2582-minimum-score-of-a-path-between-two-cities | undefined |
| 2793-count-the-number-of-complete-components | undefined |
| 3217-number-of-possible-sets-of-closing-branches | undefined |
| 3517-shortest-distance-after-road-addition-queries-i | undefined |
| 3561-remove-methods-from-project | undefined |
| 3838-path-existence-queries-in-a-graph-i | undefined |
| 3852-path-existence-queries-in-a-graph-ii | undefined |
| Problem Name | Difficulty |
|---|---|
| 3217-number-of-possible-sets-of-closing-branches | undefined |
| Problem Name | Difficulty |
|---|---|
| 1211-iterator-for-combination | undefined |
| Problem Name | Difficulty |
|---|---|
| 1211-iterator-for-combination | undefined |
| Problem Name | Difficulty |
|---|---|
| 0130-surrounded-regions | undefined |
| 0200-number-of-islands | undefined |
| 0547-number-of-provinces | undefined |
| 0695-max-area-of-island | undefined |
| 1073-number-of-enclaves | undefined |
| 1380-number-of-closed-islands | undefined |
| 1442-number-of-operations-to-make-network-connected | undefined |
| 2035-count-sub-islands | undefined |
| 2121-find-if-path-exists-in-graph | undefined |
| 2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph | undefined |
| 2582-minimum-score-of-a-path-between-two-cities | undefined |
| 2793-count-the-number-of-complete-components | undefined |
| 3823-count-islands-with-total-value-divisible-by-k | undefined |
| 3838-path-existence-queries-in-a-graph-i | undefined |
| 1000005-pond-sizes-lcci | undefined |
| 1000227-YesdPw | undefined |
| Problem Name | Difficulty |
|---|---|
| 0928-surface-area-of-3d-shapes | undefined |
| 2206-detonate-the-maximum-bombs | undefined |
| Problem Name | Difficulty |
|---|---|
| 0239-sliding-window-maximum | undefined |
| Problem Name | Difficulty |
|---|---|
| 0239-sliding-window-maximum | undefined |
| Problem Name | Difficulty |
|---|---|
| 1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph | undefined |