A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2
| Problem Name | Difficulty |
|---|---|
| 0061-rotate-list | Medium |
| 0141-linked-list-cycle | Easy |
| 0142-linked-list-cycle-ii | Medium |
| 0148-sort-list | Medium |
| 0234-palindrome-linked-list | Easy |
| 0283-move-zeroes | |
| 1721-swapping-nodes-in-a-linked-list | Medium |
| 1855-maximum-distance-between-a-pair-of-values | Medium |
| 1861-rotating-the-box | Medium |
| 2396-strictly-palindromic-number | |
| 2540-minimum-common-value | Easy |
| 3643-flip-square-submatrix-vertically | Easy |
| 3884-first-matching-character-from-both-ends | Easy |
| Problem Name | Difficulty |
|---|---|
| 0860-lemonade-change | |
| 2078-two-furthest-houses-with-different-colors | Easy |
| Problem Name | Difficulty |
|---|---|
| 0048-rotate-image | Medium |
| 0070-climbing-stairs | Easy |
| 0396-rotate-function | Medium |
| 1486-xor-operation-in-an-array | Easy |
| 2033-minimum-operations-to-make-a-uni-value-grid | Medium |
| 2396-strictly-palindromic-number | |
| 2946-matrix-similarity-after-cyclic-shifts | Easy |
| 3761-minimum-absolute-distance-between-mirror-pairs | Medium |
| 3783-mirror-distance-of-an-integer | Easy |
| Problem Name | Difficulty |
|---|---|
| 2396-strictly-palindromic-number |
| Problem Name | Difficulty |
|---|---|
| 2906-construct-product-matrix | Medium |
| 3427-sum-of-variable-length-subarrays | |
| 3546-equal-sum-grid-partition-i | Medium |
| 3719-longest-balanced-subarray-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0148-sort-list | Medium |
| 0190-reverse-bits | |
| 3719-longest-balanced-subarray-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0190-reverse-bits | |
| 1009-complement-of-base-10-integer | Easy |
| 1486-xor-operation-in-an-array | Easy |
| 2657-find-the-prefix-common-array-of-two-arrays | Medium |
| Problem Name | Difficulty |
|---|---|
| 0141-linked-list-cycle | Easy |
| 0142-linked-list-cycle-ii | Medium |
| 0496-next-greater-element-i | Easy |
| 0705-design-hashset | Easy |
| 0706-design-hashmap | Easy |
| 1345-jump-game-iv | Hard |
| 2540-minimum-common-value | Easy |
| 2657-find-the-prefix-common-array-of-two-arrays | Medium |
| 2784-check-if-array-is-good | Easy |
| 3043-find-the-length-of-the-longest-common-prefix | Medium |
| 3488-closest-equal-element-queries | Medium |
| 3719-longest-balanced-subarray-i | Medium |
| 3740-minimum-distance-between-three-equal-elements-i | Easy |
| 3761-minimum-absolute-distance-between-mirror-pairs | Medium |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | Easy |
| 0061-rotate-list | Medium |
| 0083-remove-duplicates-from-sorted-list | Easy |
| 0141-linked-list-cycle | Easy |
| 0142-linked-list-cycle-ii | Medium |
| 0148-sort-list | Medium |
| 0234-palindrome-linked-list | Easy |
| 0237-delete-node-in-a-linked-list | Medium |
| 0705-design-hashset | Easy |
| 0706-design-hashmap | Easy |
| 1669-merge-in-between-linked-lists | Medium |
| 1721-swapping-nodes-in-a-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | Easy |
| 0100-same-tree | Easy |
| 0102-binary-tree-level-order-traversal | Medium |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0107-binary-tree-level-order-traversal-ii | Medium |
| 0144-binary-tree-preorder-traversal | Easy |
| 0450-delete-node-in-a-bst | Medium |
| Problem Name | Difficulty |
|---|---|
| 0033-search-in-rotated-sorted-array | Medium |
| 0153-find-minimum-in-rotated-sorted-array | Medium |
| 0154-find-minimum-in-rotated-sorted-array-ii | Hard |
| 0450-delete-node-in-a-bst | Medium |
| 1855-maximum-distance-between-a-pair-of-values | Medium |
| 2540-minimum-common-value | Easy |
| 3488-closest-equal-element-queries | Medium |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | Easy |
| 0100-same-tree | Easy |
| 0102-binary-tree-level-order-traversal | Medium |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0107-binary-tree-level-order-traversal-ii | Medium |
| 0144-binary-tree-preorder-traversal | Easy |
| 0450-delete-node-in-a-bst | Medium |
| Problem Name | Difficulty |
|---|---|
| 0100-same-tree | Easy |
| 0102-binary-tree-level-order-traversal | Medium |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0107-binary-tree-level-order-traversal-ii | Medium |
| 0994-rotting-oranges | Medium |
| 1306-jump-game-iii | Medium |
| 1345-jump-game-iv | Hard |
| 1391-check-if-there-is-a-valid-path-in-a-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | Easy |
| 0100-same-tree | Easy |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0144-binary-tree-preorder-traversal | Easy |
| 1306-jump-game-iii | Medium |
| 1391-check-if-there-is-a-valid-path-in-a-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | Easy |
| 0234-palindrome-linked-list | Easy |
| Problem Name | Difficulty |
|---|---|
| 0148-sort-list | Medium |
| 2033-minimum-operations-to-make-a-uni-value-grid | Medium |
| 2784-check-if-array-is-good | Easy |
| 3567-minimum-absolute-difference-in-sliding-submatrix | Medium |
| Problem Name | Difficulty |
|---|---|
| 0148-sort-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0048-rotate-image | Medium |
| 0498-diagonal-traverse | Medium |
| 0994-rotting-oranges | Medium |
| 1391-check-if-there-is-a-valid-path-in-a-grid | Medium |
| 1594-maximum-non-negative-product-in-a-matrix | Medium |
| 1861-rotating-the-box | Medium |
| 1886-determine-whether-matrix-can-be-obtained-by-rotation | Easy |
| 2033-minimum-operations-to-make-a-uni-value-grid | Medium |
| 2906-construct-product-matrix | Medium |
| 2946-matrix-similarity-after-cyclic-shifts | Easy |
| 3546-equal-sum-grid-partition-i | Medium |
| 3567-minimum-absolute-difference-in-sliding-submatrix | Medium |
| 3643-flip-square-submatrix-vertically | Easy |
| 3742-maximum-path-score-in-a-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 0022-generate-parentheses | Medium |
| 0070-climbing-stairs | Easy |
| 0396-rotate-function | Medium |
| 1594-maximum-non-negative-product-in-a-matrix | Medium |
| 2770-maximum-number-of-jumps-to-reach-the-last-index | Medium |
| 3660-jump-game-ix | Medium |
| 3742-maximum-path-score-in-a-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 3546-equal-sum-grid-partition-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0020-valid-parentheses | Easy |
| 0094-binary-tree-inorder-traversal | Easy |
| 0144-binary-tree-preorder-traversal | Easy |
| 0155-min-stack | Medium |
| 0234-palindrome-linked-list | Easy |
| 0496-next-greater-element-i | Easy |
| Problem Name | Difficulty |
|---|---|
| 0155-min-stack | Medium |
| 0705-design-hashset | Easy |
| 0706-design-hashmap | Easy |
| Problem Name | Difficulty |
|---|---|
| 0496-next-greater-element-i | Easy |
| Problem Name | Difficulty |
|---|---|
| 0498-diagonal-traverse | Medium |
| 0657-robot-return-to-origin | Easy |
| 2553-separate-the-digits-in-an-array | Easy |
| 2946-matrix-similarity-after-cyclic-shifts | Easy |
| Problem Name | Difficulty |
|---|---|
| 3719-longest-balanced-subarray-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0070-climbing-stairs | Easy |
| Problem Name | Difficulty |
|---|---|
| 0705-design-hashset | Easy |
| 0706-design-hashmap | Easy |
| Problem Name | Difficulty |
|---|---|
| 0022-generate-parentheses | Medium |
| Problem Name | Difficulty |
|---|---|
| 2833-furthest-point-from-origin | Easy |
| Problem Name | Difficulty |
|---|---|
| 1391-check-if-there-is-a-valid-path-in-a-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 0796-rotate-string | Easy |
| Problem Name | Difficulty |
|---|---|
| 3043-find-the-length-of-the-longest-common-prefix | Medium |