GitHub - Badhansen/LeetCode-Solutions: Collection of LeetCode solutions that will help you to do well in your interview.

Badhansen / LeetCode-Solutions Public

Notifications You must be signed in to change notification settings
Fork 2
Star 8

Collection of LeetCode solutions that will help you to do well in your interview.

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 4,912 Commits
Sorry, we had to truncate this directory to 1,000 files. 134 entries were omitted from the list.
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
0004-median-of-two-sorted-arrays		0004-median-of-two-sorted-arrays
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0006-zigzag-conversion		0006-zigzag-conversion
0007-reverse-integer		0007-reverse-integer
0009-palindrome-number		0009-palindrome-number
0011-container-with-most-water		0011-container-with-most-water
0013-roman-to-integer		0013-roman-to-integer
0015-3sum		0015-3sum
0016-3sum-closest		0016-3sum-closest
0018-4sum		0018-4sum
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0022-generate-parentheses		0022-generate-parentheses
0023-merge-k-sorted-lists		0023-merge-k-sorted-lists
0025-reverse-nodes-in-k-group		0025-reverse-nodes-in-k-group
0027-remove-element		0027-remove-element
0029-divide-two-integers		0029-divide-two-integers
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
0035-search-insert-position		0035-search-insert-position
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
0042-trapping-rain-water		0042-trapping-rain-water
0046-permutations		0046-permutations
0047-permutations-ii		0047-permutations-ii
0048-rotate-image		0048-rotate-image
0049-group-anagrams		0049-group-anagrams
0053-maximum-subarray		0053-maximum-subarray
0054-spiral-matrix		0054-spiral-matrix
0055-jump-game		0055-jump-game
0056-merge-intervals		0056-merge-intervals
0057-insert-interval		0057-insert-interval
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
0070-climbing-stairs		0070-climbing-stairs
0071-simplify-path		0071-simplify-path
0072-edit-distance		0072-edit-distance
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
0086-partition-list		0086-partition-list
0087-scramble-string		0087-scramble-string
0090-subsets-ii		0090-subsets-ii
0091-decode-ways		0091-decode-ways
0092-reverse-linked-list-ii		0092-reverse-linked-list-ii
0093-restore-ip-addresses		0093-restore-ip-addresses
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
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
0106-construct-binary-tree-from-inorder-and-postorder-traversal		0106-construct-binary-tree-from-inorder-and-postorder-traversal
0109-convert-sorted-list-to-binary-search-tree		0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree		0110-balanced-binary-tree
0116-populating-next-right-pointers-in-each-node		0116-populating-next-right-pointers-in-each-node
0118-pascals-triangle		0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0125-valid-palindrome		0125-valid-palindrome
0127-word-ladder		0127-word-ladder
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0131-palindrome-partitioning		0131-palindrome-partitioning
0133-clone-graph		0133-clone-graph
0134-gas-station		0134-gas-station
0136-single-number		0136-single-number
0139-word-break		0139-word-break
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0143-reorder-list		0143-reorder-list
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0146-lru-cache		0146-lru-cache
0149-max-points-on-a-line		0149-max-points-on-a-line
0150-evaluate-reverse-polish-notation		0150-evaluate-reverse-polish-notation
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
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
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0169-majority-element		0169-majority-element
0186-reverse-words-in-a-string-ii		0186-reverse-words-in-a-string-ii
0190-reverse-bits		0190-reverse-bits
0191-number-of-1-bits		0191-number-of-1-bits
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