LeetCode-Problems

This repo is to document my exciting journey to finish all the existing easy and medium problems on LeetCode!

Name		Name	Last commit message	Last commit date
Latest commit History 776 Commits
0013-roman-to-integer		0013-roman-to-integer
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0054-spiral-matrix		0054-spiral-matrix
0062-unique-paths		0062-unique-paths
0063-unique-paths-ii		0063-unique-paths-ii
0064-minimum-path-sum		0064-minimum-path-sum
0066-plus-one		0066-plus-one
0067-add-binary		0067-add-binary
0069-sqrtx		0069-sqrtx
0070-climbing-stairs		0070-climbing-stairs
0072-edit-distance		0072-edit-distance
0077-combinations		0077-combinations
0078-subsets		0078-subsets
0098-validate-binary-search-tree		0098-validate-binary-search-tree
0100-same-tree		0100-same-tree
0101-symmetric-tree		0101-symmetric-tree
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
0110-balanced-binary-tree		0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0112-path-sum		0112-path-sum
0118-pascals-triangle		0118-pascals-triangle
0119-pascals-triangle-ii		0119-pascals-triangle-ii
0120-triangle		0120-triangle
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0169-majority-element		0169-majority-element
0171-excel-sheet-column-number		0171-excel-sheet-column-number
0175-combine-two-tables		0175-combine-two-tables
0190-reverse-bits		0190-reverse-bits
0191-number-of-1-bits		0191-number-of-1-bits
0198-house-robber		0198-house-robber
0200-number-of-islands		0200-number-of-islands
0203-remove-linked-list-elements		0203-remove-linked-list-elements
0204-count-primes		0204-count-primes
0206-reverse-linked-list		0206-reverse-linked-list
0221-maximal-square		0221-maximal-square
0225-implement-stack-using-queues		0225-implement-stack-using-queues
0226-invert-binary-tree		0226-invert-binary-tree
0231-power-of-two		0231-power-of-two
0232-implement-queue-using-stacks		0232-implement-queue-using-stacks
0234-palindrome-linked-list		0234-palindrome-linked-list
0238-product-of-array-except-self		0238-product-of-array-except-self
0257-binary-tree-paths		0257-binary-tree-paths
0268-missing-number		0268-missing-number
0273-integer-to-english-words		0273-integer-to-english-words
0287-find-the-duplicate-number		0287-find-the-duplicate-number
0322-coin-change		0322-coin-change
0326-power-of-three		0326-power-of-three
0338-counting-bits		0338-counting-bits
0342-power-of-four		0342-power-of-four
0344-reverse-string		0344-reverse-string
0347-top-k-frequent-elements		0347-top-k-frequent-elements
0387-first-unique-character-in-a-string		0387-first-unique-character-in-a-string
0389-find-the-difference		0389-find-the-difference
0394-decode-string		0394-decode-string
0404-sum-of-left-leaves		0404-sum-of-left-leaves
0405-convert-a-number-to-hexadecimal		0405-convert-a-number-to-hexadecimal
0461-hamming-distance		0461-hamming-distance
0476-number-complement		0476-number-complement
0501-find-mode-in-binary-search-tree		0501-find-mode-in-binary-search-tree
0509-fibonacci-number		0509-fibonacci-number
0515-find-largest-value-in-each-tree-row		0515-find-largest-value-in-each-tree-row
0518-coin-change-ii		0518-coin-change-ii
0530-minimum-absolute-difference-in-bst		0530-minimum-absolute-difference-in-bst
0543-diameter-of-binary-tree		0543-diameter-of-binary-tree
0547-number-of-provinces		0547-number-of-provinces
0559-maximum-depth-of-n-ary-tree		0559-maximum-depth-of-n-ary-tree
0561-array-partition		0561-array-partition
0563-binary-tree-tilt		0563-binary-tree-tilt
0590-n-ary-tree-postorder-traversal		0590-n-ary-tree-postorder-traversal
0606-construct-string-from-binary-tree		0606-construct-string-from-binary-tree
0617-merge-two-binary-trees		0617-merge-two-binary-trees
0637-average-of-levels-in-binary-tree		0637-average-of-levels-in-binary-tree
0645-set-mismatch		0645-set-mismatch
0649-dota2-senate		0649-dota2-senate
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
0671-second-minimum-node-in-a-binary-tree		0671-second-minimum-node-in-a-binary-tree
0684-redundant-connection		0684-redundant-connection
0693-binary-number-with-alternating-bits		0693-binary-number-with-alternating-bits
0695-max-area-of-island		0695-max-area-of-island
0700-search-in-a-binary-search-tree		0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree		0701-insert-into-a-binary-search-tree
0704-binary-search		0704-binary-search
0733-flood-fill		0733-flood-fill
0740-delete-and-earn		0740-delete-and-earn
0746-min-cost-climbing-stairs		0746-min-cost-climbing-stairs
0762-prime-number-of-set-bits-in-binary-representation		0762-prime-number-of-set-bits-in-binary-representation
0771-jewels-and-stones		0771-jewels-and-stones
0783-minimum-distance-between-bst-nodes		0783-minimum-distance-between-bst-nodes
0784-letter-case-permutation		0784-letter-case-permutation
0797-all-paths-from-source-to-target		0797-all-paths-from-source-to-target
0804-unique-morse-code-words		0804-unique-morse-code-words
0814-binary-tree-pruning		0814-binary-tree-pruning
0841-keys-and-rooms		0841-keys-and-rooms
0868-binary-gap		0868-binary-gap
0872-leaf-similar-trees		0872-leaf-similar-trees

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LeetCode-Problems

About

Releases

Packages

Languages

License

Ashh98/LeetCode-Problems

Folders and files

Latest commit

History

Repository files navigation

LeetCode-Problems

About

Resources

License

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages