GitHub - Aarsh30/DSA-Placement-Prep: All Leetcode Important Problems Save it for Future Reference

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1,010 Commits
.vscode		.vscode
0001-two-sum		0001-two-sum
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0004-median-of-two-sorted-arrays		0004-median-of-two-sorted-arrays
0011-container-with-most-water		0011-container-with-most-water
0014-longest-common-prefix		0014-longest-common-prefix
0015-3sum		0015-3sum
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0022-generate-parentheses		0022-generate-parentheses
0027-remove-element		0027-remove-element
0031-next-permutation		0031-next-permutation
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array		0034-find-first-and-last-position-of-element-in-sorted-array
0037-sudoku-solver		0037-sudoku-solver
0039-combination-sum		0039-combination-sum
0040-combination-sum-ii		0040-combination-sum-ii
0042-trapping-rain-water		0042-trapping-rain-water
0046-permutations		0046-permutations
0048-rotate-image		0048-rotate-image
0050-powx-n		0050-powx-n
0053-maximum-subarray		0053-maximum-subarray
0056-merge-intervals		0056-merge-intervals
0058-length-of-last-word		0058-length-of-last-word
0060-permutation-sequence		0060-permutation-sequence
0062-unique-paths		0062-unique-paths
0063-unique-paths-ii		0063-unique-paths-ii
0064-minimum-path-sum		0064-minimum-path-sum
0068-text-justification		0068-text-justification
0069-sqrtx		0069-sqrtx
0070-climbing-stairs		0070-climbing-stairs
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0077-combinations		0077-combinations
0078-subsets		0078-subsets
0081-search-in-rotated-sorted-array-ii		0081-search-in-rotated-sorted-array-ii
0082-remove-duplicates-from-sorted-list-ii		0082-remove-duplicates-from-sorted-list-ii
0084-largest-rectangle-in-histogram		0084-largest-rectangle-in-histogram
0086-partition-list		0086-partition-list
0088-merge-sorted-array		0088-merge-sorted-array
0091-decode-ways		0091-decode-ways
0092-reverse-linked-list-ii		0092-reverse-linked-list-ii
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0095-unique-binary-search-trees-ii		0095-unique-binary-search-trees-ii
0097-interleaving-string		0097-interleaving-string
0098-validate-binary-search-tree		0098-validate-binary-search-tree
0099-recover-binary-search-tree		0099-recover-binary-search-tree
0100-same-tree		0100-same-tree
0102-binary-tree-level-order-traversal		0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal		0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal		0105-construct-binary-tree-from-preorder-and-inorder-traversal
0108-convert-sorted-array-to-binary-search-tree		0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree		0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0114-flatten-binary-tree-to-linked-list		0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node		0116-populating-next-right-pointers-in-each-node
0118-pascals-triangle		0118-pascals-triangle
0119-pascals-triangle-ii		0119-pascals-triangle-ii
0120-triangle		0120-triangle
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0125-valid-palindrome		0125-valid-palindrome
0131-palindrome-partitioning		0131-palindrome-partitioning
0133-clone-graph		0133-clone-graph
0135-candy		0135-candy
0138-copy-list-with-random-pointer		0138-copy-list-with-random-pointer
0139-word-break		0139-word-break
0141-linked-list-cycle		0141-linked-list-cycle
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0146-lru-cache		0146-lru-cache
0153-find-minimum-in-rotated-sorted-array		0153-find-minimum-in-rotated-sorted-array
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0168-excel-sheet-column-title		0168-excel-sheet-column-title
0169-majority-element		0169-majority-element
0173-binary-search-tree-iterator		0173-binary-search-tree-iterator
0189-rotate-array		0189-rotate-array
0199-binary-tree-right-side-view		0199-binary-tree-right-side-view
0200-number-of-islands		0200-number-of-islands
0206-reverse-linked-list		0206-reverse-linked-list
0207-course-schedule		0207-course-schedule
0208-implement-trie-prefix-tree		0208-implement-trie-prefix-tree
0209-minimum-size-subarray-sum		0209-minimum-size-subarray-sum
0215-kth-largest-element-in-an-array		0215-kth-largest-element-in-an-array
0217-contains-duplicate		0217-contains-duplicate
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0222-count-complete-tree-nodes		0222-count-complete-tree-nodes
0225-implement-stack-using-queues		0225-implement-stack-using-queues
0229-majority-element-ii		0229-majority-element-ii
0230-kth-smallest-element-in-a-bst		0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree		0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree		0236-lowest-common-ancestor-of-a-binary-tree
0239-sliding-window-maximum		0239-sliding-window-maximum
0240-search-a-2d-matrix-ii		0240-search-a-2d-matrix-ii
0242-valid-anagram		0242-valid-anagram
0283-move-zeroes		0283-move-zeroes
0287-find-the-duplicate-number		0287-find-the-duplicate-number
0295-find-median-from-data-stream		0295-find-median-from-data-stream
0297-serialize-and-deserialize-binary-tree		0297-serialize-and-deserialize-binary-tree