leetcode

This is a project that recording my journey to practice LeetCode.

Learning resources:

Name		Name	Last commit message	Last commit date
Latest commit History 315 Commits
0001-two-sum		0001-two-sum
0002-Add-Two-Numbers		0002-Add-Two-Numbers
0003-Longest-Substring-Without-Repeating-Characters		0003-Longest-Substring-Without-Repeating-Characters
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0007-Reverse-Integer		0007-Reverse-Integer
0009-Palindrome-Number		0009-Palindrome-Number
0011-container-with-most-water		0011-container-with-most-water
0012-Integer-to-Roman		0012-Integer-to-Roman
0013-Roman-to-Integer		0013-Roman-to-Integer
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
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
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0035-Search-Insert-Position		0035-Search-Insert-Position
0036-valid-sudoku		0036-valid-sudoku
0038-Count-and-Say		0038-Count-and-Say
0039-combination-sum		0039-combination-sum
0040-combination-sum-ii		0040-combination-sum-ii
0041-first-missing-positive		0041-first-missing-positive
0043-Multiply-Strings		0043-Multiply-Strings
0046-permutations		0046-permutations
0047-permutations-ii		0047-permutations-ii
0049-group-anagrams		0049-group-anagrams
0053-Maximum-Subarray		0053-Maximum-Subarray
0054-spiral-matrix		0054-spiral-matrix
0056-merge-intervals		0056-merge-intervals
0057-insert-interval		0057-insert-interval
0066-Plus-One		0066-Plus-One
0067-Add-Binary		0067-Add-Binary
0069-Sqrt(x)		0069-Sqrt(x)
0070-climbing-stairs		0070-climbing-stairs
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0076-minimum-window-substring		0076-minimum-window-substring
0077-combinations		0077-combinations
0078-subsets		0078-subsets
0079-word-search		0079-word-search
0083-Remove-Duplicates-from-Sorted-List		0083-Remove-Duplicates-from-Sorted-List
0088-Merge-Sorted-Array		0088-Merge-Sorted-Array
0090-subsets-ii		0090-subsets-ii
0091-decode-ways		0091-decode-ways
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
0102-binary-tree-level-order-traversal		0102-binary-tree-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
0106-construct-binary-tree-from-inorder-and-postorder-traversal		0106-construct-binary-tree-from-inorder-and-postorder-traversal
0110-balanced-binary-tree		0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0118-Pascal's-Triangle		0118-Pascal's-Triangle
0119-Pascal's-Triangle-II		0119-Pascal's-Triangle-II
0121-Best-Time-to-Buy-and-Sell-Stock		0121-Best-Time-to-Buy-and-Sell-Stock
0125-valid-palindrome		0125-valid-palindrome
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0130-surrounded-regions		0130-surrounded-regions
0131-palindrome-partitioning		0131-palindrome-partitioning
0133-clone-graph		0133-clone-graph
0136-Single-Number		0136-Single-Number
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
0152-maximum-product-subarray		0152-maximum-product-subarray
0153-find-minimum-in-rotated-sorted-array		0153-find-minimum-in-rotated-sorted-array
0155-min-stack		0155-min-stack
0160-Intersection-of-Two-Linked-Lists		0160-Intersection-of-Two-Linked-Lists
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0198-house-robber		0198-house-robber
0199-binary-tree-right-side-view		0199-binary-tree-right-side-view
0200-number-of-islands		0200-number-of-islands
0202-Happy-Number		0202-Happy-Number
0203-Remove-Linked-List-Elements		0203-Remove-Linked-List-Elements
0206-Reverse-Linked-List		0206-Reverse-Linked-List
0207-course-schedule		0207-course-schedule
0208-implement-trie-prefix-tree		0208-implement-trie-prefix-tree
0210-course-schedule-ii		0210-course-schedule-ii
0211-design-add-and-search-words-data-structure		0211-design-add-and-search-words-data-structure
0213-house-robber-ii		0213-house-robber-ii
0215-kth-largest-element-in-an-array		0215-kth-largest-element-in-an-array
0217-contains-duplicate		0217-contains-duplicate
0225-implement-stack-using-queues		0225-implement-stack-using-queues
0226-invert-binary-tree		0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst		0230-kth-smallest-element-in-a-bst
0232-implement-queue-using-stacks		0232-implement-queue-using-stacks
0234-Palindrome-Linked-List		0234-Palindrome-Linked-List
0235-lowest-common-ancestor-of-a-binary-search-tree		0235-lowest-common-ancestor-of-a-binary-search-tree
0237-Delete-Node-in-a-Linked-List		0237-Delete-Node-in-a-Linked-List
0238-product-of-array-except-self		0238-product-of-array-except-self
0239-sliding-window-maximum		0239-sliding-window-maximum
0242-valid-anagram		0242-valid-anagram
0258-Add-Digits		0258-Add-Digits
0261-graph-valid-tree		0261-graph-valid-tree

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

leetcode

About

Uh oh!

Releases

Packages

Uh oh!

Languages

apriil15/leetcode

Folders and files

Latest commit

History

Repository files navigation

leetcode

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Languages

Packages