Hey There! Welcome to my leetcode problem solving repository.Here I solve atleast one problem daily in java to improve my DSA and Problem-solving skills.
| Problem Name | Difficulty |
|---|---|
| 0011-container-with-most-water | Medium |
| 0037-sudoku-solver | Hard |
| 0051-n-queens | Hard |
| 0074-search-a-2d-matrix | Medium |
| 0078-subsets | Medium |
| 0084-largest-rectangle-in-histogram | Hard |
| 0108-convert-sorted-array-to-binary-search-tree | Easy |
| 0283-move-zeroes | Easy |
| 0496-next-greater-element-i | Easy |
| 0643-maximum-average-subarray-i | Easy |
| 0646-maximum-length-of-pair-chain | Medium |
| 1008-construct-binary-search-tree-from-preorder-traversal | Medium |
| Problem Name | Difficulty |
|---|---|
| 0074-search-a-2d-matrix | Medium |
| 0222-count-complete-tree-nodes | Easy |
| Problem Name | Difficulty |
|---|---|
| 0037-sudoku-solver | Hard |
| 0074-search-a-2d-matrix | Medium |
| Problem Name | Difficulty |
|---|---|
| 0011-container-with-most-water | Medium |
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0125-valid-palindrome | Easy |
| 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 |
| 0234-palindrome-linked-list | Easy |
| 0283-move-zeroes | Easy |
| 0443-string-compression | Medium |
| 0844-backspace-string-compare | Easy |
| 0876-middle-of-the-linked-list | Easy |
| 1721-swapping-nodes-in-a-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0020-valid-parentheses | Easy |
| 0125-valid-palindrome | Easy |
| 0257-binary-tree-paths | Easy |
| 0387-first-unique-character-in-a-string | Easy |
| 0443-string-compression | Medium |
| 0844-backspace-string-compare | Easy |
| 1047-remove-all-adjacent-duplicates-in-string | Easy |
| 1614-maximum-nesting-depth-of-the-parentheses | Easy |
| Problem Name | Difficulty |
|---|---|
| 0002-add-two-numbers | Medium |
| 0070-climbing-stairs | Easy |
| Problem Name | Difficulty |
|---|---|
| 0070-climbing-stairs | Easy |
| 0646-maximum-length-of-pair-chain | Medium |
| Problem Name | Difficulty |
|---|---|
| 0070-climbing-stairs | Easy |
| Problem Name | Difficulty |
|---|---|
| 0037-sudoku-solver | Hard |
| 0051-n-queens | Hard |
| 0052-n-queens-ii | Hard |
| 0078-subsets | Medium |
| 0257-binary-tree-paths | Easy |
| Problem Name | Difficulty |
|---|---|
| 0078-subsets | Medium |
| 0222-count-complete-tree-nodes | Easy |
| Problem Name | Difficulty |
|---|---|
| 0037-sudoku-solver | Hard |
| 0141-linked-list-cycle | Easy |
| 0142-linked-list-cycle-ii | Medium |
| 0160-intersection-of-two-linked-lists | Easy |
| 0387-first-unique-character-in-a-string | Easy |
| 0496-next-greater-element-i | Easy |
| Problem Name | Difficulty |
|---|---|
| 0011-container-with-most-water | Medium |
| 0646-maximum-length-of-pair-chain | Medium |
| 1382-balance-a-binary-search-tree | Medium |
| Problem Name | Difficulty |
|---|---|
| 0002-add-two-numbers | Medium |
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0021-merge-two-sorted-lists | Easy |
| 0025-reverse-nodes-in-k-group | Hard |
| 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 |
| 0206-reverse-linked-list | Easy |
| 0234-palindrome-linked-list | Easy |
| 0237-delete-node-in-a-linked-list | Medium |
| 0707-design-linked-list | Medium |
| 0876-middle-of-the-linked-list | Easy |
| 1721-swapping-nodes-in-a-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0707-design-linked-list | Medium |
| 0901-online-stock-span | Medium |
| Problem Name | Difficulty |
|---|---|
| 0002-add-two-numbers | Medium |
| 0021-merge-two-sorted-lists | Easy |
| 0025-reverse-nodes-in-k-group | Hard |
| 0143-reorder-list | Medium |
| 0206-reverse-linked-list | Easy |
| 0234-palindrome-linked-list | Easy |
| Problem Name | Difficulty |
|---|---|
| 0108-convert-sorted-array-to-binary-search-tree | Easy |
| 0148-sort-list | Medium |
| 1382-balance-a-binary-search-tree | Medium |
| Problem Name | Difficulty |
|---|---|
| 0148-sort-list | Medium |
| 0646-maximum-length-of-pair-chain | Medium |
| Problem Name | Difficulty |
|---|---|
| 0148-sort-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0084-largest-rectangle-in-histogram | Hard |
| 0496-next-greater-element-i | Easy |
| 0901-online-stock-span | Medium |
| 1008-construct-binary-search-tree-from-preorder-traversal | Medium |
| Problem Name | Difficulty |
|---|---|
| 0901-online-stock-span | Medium |
| Problem Name | Difficulty |
|---|---|
| 0387-first-unique-character-in-a-string | Easy |
| Problem Name | Difficulty |
|---|---|
| 0387-first-unique-character-in-a-string | Easy |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | Easy |
| 0098-validate-binary-search-tree | Medium |
| 0101-symmetric-tree | Easy |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0110-balanced-binary-tree | Easy |
| 0144-binary-tree-preorder-traversal | Easy |
| 0145-binary-tree-postorder-traversal | Easy |
| 0226-invert-binary-tree | Easy |
| 0236-lowest-common-ancestor-of-a-binary-tree | Medium |
| 0257-binary-tree-paths | Easy |
| 0543-diameter-of-binary-tree | Easy |
| 0572-subtree-of-another-tree | Easy |
| 0993-cousins-in-binary-tree | Easy |
| 1382-balance-a-binary-search-tree | Medium |
| 1971-find-if-path-exists-in-graph | Easy |
| Problem Name | Difficulty |
|---|---|
| 0101-symmetric-tree | Easy |
| 0102-binary-tree-level-order-traversal | Medium |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0226-invert-binary-tree | Easy |
| 0993-cousins-in-binary-tree | Easy |
| 1971-find-if-path-exists-in-graph | Easy |
| Problem Name | Difficulty |
|---|---|
| 0572-subtree-of-another-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0572-subtree-of-another-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0098-validate-binary-search-tree | Medium |
| 0108-convert-sorted-array-to-binary-search-tree | Easy |
| 0450-delete-node-in-a-bst | Medium |
| 0700-search-in-a-binary-search-tree | Easy |
| 1008-construct-binary-search-tree-from-preorder-traversal | Medium |
| 1382-balance-a-binary-search-tree | Medium |
| Problem Name | Difficulty |
|---|---|
| 0844-backspace-string-compare | Easy |
| Problem Name | Difficulty |
|---|---|
| 0643-maximum-average-subarray-i | Easy |
| Problem Name | Difficulty |
|---|---|
| 1971-find-if-path-exists-in-graph | Easy |
| Problem Name | Difficulty |
|---|---|
| 1971-find-if-path-exists-in-graph | Easy |