LeetCode Problems

Collection of solutions to LeetCode questions to ace the coding interviews

Name		Name	Last commit message	Last commit date
0001-two-sum		0001-two-sum
0014-longest-common-prefix		0014-longest-common-prefix
0015-3sum		0015-3sum
0018-4sum		0018-4sum
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs		0024-swap-nodes-in-pairs
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0027-remove-element		0027-remove-element
0035-search-insert-position		0035-search-insert-position
0036-valid-sudoku		0036-valid-sudoku
0048-rotate-image		0048-rotate-image
0049-group-anagrams		0049-group-anagrams
0053-maximum-subarray		0053-maximum-subarray
0058-length-of-last-word		0058-length-of-last-word
0064-minimum-path-sum		0064-minimum-path-sum
0067-add-binary		0067-add-binary
0070-climbing-stairs		0070-climbing-stairs
0083-remove-duplicates-from-sorted-list		0083-remove-duplicates-from-sorted-list
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree		0098-validate-binary-search-tree
0100-same-tree		0100-same-tree
0101-symmetric-tree		0101-symmetric-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
0108-convert-sorted-array-to-binary-search-tree		0108-convert-sorted-array-to-binary-search-tree
0112-path-sum		0112-path-sum
0118-pascals-triangle		0118-pascals-triangle
0119-pascals-triangle-ii		0119-pascals-triangle-ii
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0125-valid-palindrome		0125-valid-palindrome
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0130-surrounded-regions		0130-surrounded-regions
0134-gas-station		0134-gas-station
0141-linked-list-cycle		0141-linked-list-cycle
0143-reorder-list		0143-reorder-list
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0149-max-points-on-a-line		0149-max-points-on-a-line
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0153-find-minimum-in-rotated-sorted-array		0153-find-minimum-in-rotated-sorted-array
0169-majority-element		0169-majority-element
0187-repeated-dna-sequences		0187-repeated-dna-sequences
0200-number-of-islands		0200-number-of-islands
0206-reverse-linked-list		0206-reverse-linked-list
0208-implement-trie-prefix-tree		0208-implement-trie-prefix-tree
0211-design-add-and-search-words-data-structure		0211-design-add-and-search-words-data-structure
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
0224-basic-calculator		0224-basic-calculator
0225-implement-stack-using-queues		0225-implement-stack-using-queues
0226-invert-binary-tree		0226-invert-binary-tree
0228-summary-ranges		0228-summary-ranges
0230-kth-smallest-element-in-a-bst		0230-kth-smallest-element-in-a-bst
0231-power-of-two		0231-power-of-two
0232-implement-queue-using-stacks		0232-implement-queue-using-stacks
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
0242-valid-anagram		0242-valid-anagram
0263-ugly-number		0263-ugly-number
0268-missing-number		0268-missing-number
0279-perfect-squares		0279-perfect-squares
0287-find-the-duplicate-number		0287-find-the-duplicate-number
0290-word-pattern		0290-word-pattern
0345-reverse-vowels-of-a-string		0345-reverse-vowels-of-a-string
0347-top-k-frequent-elements		0347-top-k-frequent-elements
0363-max-sum-of-rectangle-no-larger-than-k		0363-max-sum-of-rectangle-no-larger-than-k
0367-valid-perfect-square		0367-valid-perfect-square
0374-guess-number-higher-or-lower		0374-guess-number-higher-or-lower
0404-sum-of-left-leaves		0404-sum-of-left-leaves
0417-pacific-atlantic-water-flow		0417-pacific-atlantic-water-flow
0429-n-ary-tree-level-order-traversal		0429-n-ary-tree-level-order-traversal
0451-sort-characters-by-frequency		0451-sort-characters-by-frequency
0452-minimum-number-of-arrows-to-burst-balloons		0452-minimum-number-of-arrows-to-burst-balloons
0460-lfu-cache		0460-lfu-cache
0463-island-perimeter		0463-island-perimeter
0482-license-key-formatting		0482-license-key-formatting
0496-next-greater-element-i		0496-next-greater-element-i
0506-relative-ranks		0506-relative-ranks
0520-detect-capital		0520-detect-capital
0530-minimum-absolute-difference-in-bst		0530-minimum-absolute-difference-in-bst
0540-single-element-in-a-sorted-array		0540-single-element-in-a-sorted-array
0543-diameter-of-binary-tree		0543-diameter-of-binary-tree
0566-reshape-the-matrix		0566-reshape-the-matrix
0587-erect-the-fence		0587-erect-the-fence
0605-can-place-flowers		0605-can-place-flowers
0606-construct-string-from-binary-tree		0606-construct-string-from-binary-tree
0637-average-of-levels-in-binary-tree		0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst		0653-two-sum-iv-input-is-a-bst
0658-find-k-closest-elements		0658-find-k-closest-elements
0661-image-smoother		0661-image-smoother
0692-top-k-frequent-words		0692-top-k-frequent-words
0703-kth-largest-element-in-a-stream		0703-kth-largest-element-in-a-stream
0704-binary-search		0704-binary-search
0705-design-hashset		0705-design-hashset
0709-to-lower-case		0709-to-lower-case
0718-maximum-length-of-repeated-subarray		0718-maximum-length-of-repeated-subarray
0733-flood-fill		0733-flood-fill

Navigation Menu

Repository files navigation

LeetCode Problems

About

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

LeetCode Problems

About

Topics

Resources

Stars

Watchers

Forks

Contributors

Languages