My LeetCode solutions and DSA practice repository. Consistently solving problems to strengthen problem-solving skills and prepare for technical interviews.
| 0037-sudoku-solver |
| 0051-n-queens |
| 0079-word-search |
| 0105-construct-binary-tree-from-preorder-and-inorder-traversal |
| 0106-construct-binary-tree-from-inorder-and-postorder-traversal |
| 0022-generate-parentheses |
| 0079-word-search |
| 0282-expression-add-operators |
| 0297-serialize-and-deserialize-binary-tree |
| 0022-generate-parentheses |
| 0037-sudoku-solver |
| 0051-n-queens |
| 0079-word-search |
| 0282-expression-add-operators |
| 0037-sudoku-solver |
| 0079-word-search |
| 0282-expression-add-operators |
| 0022-generate-parentheses |
| 0124-binary-tree-maximum-path-sum |
| 0094-binary-tree-inorder-traversal |
| 0114-flatten-binary-tree-to-linked-list |
| 0144-binary-tree-preorder-traversal |
| 0145-binary-tree-postorder-traversal |
| 0124-binary-tree-maximum-path-sum |
| 0543-diameter-of-binary-tree |
| 0987-vertical-order-traversal-of-a-binary-tree |
| 0236-lowest-common-ancestor-of-a-binary-tree |
| 0236-lowest-common-ancestor-of-a-binary-tree |
| 0222-count-complete-tree-nodes |
| 0222-count-complete-tree-nodes |
| 0105-construct-binary-tree-from-preorder-and-inorder-traversal |
| 0106-construct-binary-tree-from-inorder-and-postorder-traversal |
| 0297-serialize-and-deserialize-binary-tree |
| 0114-flatten-binary-tree-to-linked-list |
| 0700-search-in-a-binary-search-tree |