Skip to content

adamtang5/leethub_adamtang5

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5,548 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
 
 
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
 
 
0008-string-to-integer-atoi
0008-string-to-integer-atoi
 
 
0009-palindrome-number
0009-palindrome-number
 
 
0010-regular-expression-matching
0010-regular-expression-matching
 
 
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
 
 
0016-3sum-closest
0016-3sum-closest
 
 
0017-letter-combinations-of-a-phone-number
0017-letter-combinations-of-a-phone-number
 
 
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
 
 
0024-swap-nodes-in-pairs
0024-swap-nodes-in-pairs
 
 
0025-reverse-nodes-in-k-group
0025-reverse-nodes-in-k-group
 
 
0026-remove-duplicates-from-sorted-array
0026-remove-duplicates-from-sorted-array
 
 
0027-remove-element
0027-remove-element
 
 
0028-find-the-index-of-the-first-occurrence-in-a-string
0028-find-the-index-of-the-first-occurrence-in-a-string
 
 
0029-divide-two-integers
0029-divide-two-integers
 
 
0030-substring-with-concatenation-of-all-words
0030-substring-with-concatenation-of-all-words
 
 
0031-next-permutation
0031-next-permutation
 
 
0032-longest-valid-parentheses
0032-longest-valid-parentheses
 
 
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
 
 
0036-valid-sudoku
0036-valid-sudoku
 
 
0037-sudoku-solver
0037-sudoku-solver
 
 
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
 
 
0043-multiply-strings
0043-multiply-strings
 
 
0044-wildcard-matching
0044-wildcard-matching
 
 
0045-jump-game-ii
0045-jump-game-ii
 
 
0046-permutations
0046-permutations
 
 
0047-permutations-ii
0047-permutations-ii
 
 
0048-rotate-image
0048-rotate-image
 
 
0049-group-anagrams
0049-group-anagrams
 
 
0050-powx-n
0050-powx-n
 
 
0051-n-queens
0051-n-queens
 
 
0052-n-queens-ii
0052-n-queens-ii
 
 
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
 
 
0058-length-of-last-word
0058-length-of-last-word
 
 
0059-spiral-matrix-ii
0059-spiral-matrix-ii
 
 
0060-permutation-sequence
0060-permutation-sequence
 
 
0061-rotate-list
0061-rotate-list
 
 
0062-unique-paths
0062-unique-paths
 
 
0063-unique-paths-ii
0063-unique-paths-ii
 
 
0064-minimum-path-sum
0064-minimum-path-sum
 
 
0065-valid-number
0065-valid-number
 
 
0066-plus-one
0066-plus-one
 
 
0067-add-binary
0067-add-binary
 
 
0068-text-justification
0068-text-justification
 
 
0069-sqrtx
0069-sqrtx
 
 
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
 
 
0075-sort-colors
0075-sort-colors
 
 
0076-minimum-window-substring
0076-minimum-window-substring
 
 
0077-combinations
0077-combinations
 
 
0078-subsets
0078-subsets
 
 
0079-word-search
0079-word-search
 
 
0080-remove-duplicates-from-sorted-array-ii
0080-remove-duplicates-from-sorted-array-ii
 
 
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
 
 
0083-remove-duplicates-from-sorted-list
0083-remove-duplicates-from-sorted-list
 
 
0084-largest-rectangle-in-histogram
0084-largest-rectangle-in-histogram
 
 
0085-maximal-rectangle
0085-maximal-rectangle
 
 
0086-partition-list
0086-partition-list
 
 
0087-scramble-string
0087-scramble-string
 
 
0088-merge-sorted-array
0088-merge-sorted-array
 
 
0089-gray-code
0089-gray-code
 
 
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
 
 
0094-binary-tree-inorder-traversal
0094-binary-tree-inorder-traversal
 
 
0095-unique-binary-search-trees-ii
0095-unique-binary-search-trees-ii
 
 
0096-unique-binary-search-trees
0096-unique-binary-search-trees
 
 
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
 
 

Repository files navigation

A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

String
0065-valid-number
0067-add-binary
0068-text-justification
0071-simplify-path
0072-edit-distance
0076-minimum-window-substring
0079-word-search
0087-scramble-string
0091-decode-ways
0093-restore-ip-addresses
0097-interleaving-string
0115-distinct-subsequences
0125-valid-palindrome
0126-word-ladder-ii
0127-word-ladder
0131-palindrome-partitioning
0132-palindrome-partitioning-ii
0139-word-break
0140-word-break-ii

Array
0066-plus-one
0068-text-justification
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0075-sort-colors
0078-subsets
0079-word-search
0080-remove-duplicates-from-sorted-array-ii
0081-search-in-rotated-sorted-array-ii
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0088-merge-sorted-array
0090-subsets-ii
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0118-pascals-triangle
0120-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0128-longest-consecutive-sequence
0130-surrounded-regions
0134-gas-station
0135-candy
0136-single-number
0137-single-number-ii
0139-word-break
0140-word-break-ii

Math
0066-plus-one
0067-add-binary
0069-sqrtx
0070-climbing-stairs
0089-gray-code
0096-unique-binary-search-trees

Bit Manipulation
0067-add-binary
0078-subsets
0089-gray-code
0090-subsets-ii
0136-single-number
0137-single-number-ii

Simulation
0067-add-binary
0068-text-justification

Binary Search
0069-sqrtx
0074-search-a-2d-matrix
0081-search-in-rotated-sorted-array-ii

Dynamic Programming
0070-climbing-stairs
0072-edit-distance
0085-maximal-rectangle
0087-scramble-string
0091-decode-ways
0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0097-interleaving-string
0115-distinct-subsequences
0118-pascals-triangle
0120-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0124-binary-tree-maximum-path-sum
0131-palindrome-partitioning
0132-palindrome-partitioning-ii
0139-word-break
0140-word-break-ii

Memoization
0070-climbing-stairs
0139-word-break
0140-word-break-ii

Stack
0071-simplify-path
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0143-reorder-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Hash Table
0073-set-matrix-zeroes
0076-minimum-window-substring
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0126-word-ladder-ii
0127-word-ladder
0128-longest-consecutive-sequence
0133-clone-graph
0138-copy-list-with-random-pointer
0139-word-break
0140-word-break-ii
0141-linked-list-cycle
0142-linked-list-cycle-ii

Matrix
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0079-word-search
0085-maximal-rectangle
0130-surrounded-regions

Two Pointers
0075-sort-colors
0080-remove-duplicates-from-sorted-array-ii
0082-remove-duplicates-from-sorted-list-ii
0086-partition-list
0088-merge-sorted-array
0125-valid-palindrome
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0148-sort-list

Sorting
0075-sort-colors
0088-merge-sorted-array
0147-insertion-sort-list
0148-sort-list

Sliding Window
0076-minimum-window-substring

Backtracking
0077-combinations
0078-subsets
0079-word-search
0089-gray-code
0090-subsets-ii
0093-restore-ip-addresses
0095-unique-binary-search-trees-ii
0113-path-sum-ii
0126-word-ladder-ii
0131-palindrome-partitioning
0140-word-break-ii

Depth-First Search
0079-word-search
0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0130-surrounded-regions
0133-clone-graph
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Linked List
0082-remove-duplicates-from-sorted-list-ii
0083-remove-duplicates-from-sorted-list
0086-partition-list
0092-reverse-linked-list-ii
0109-convert-sorted-list-to-binary-search-tree
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0138-copy-list-with-random-pointer
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0147-insertion-sort-list
0148-sort-list

Monotonic Stack
0084-largest-rectangle-in-histogram
0085-maximal-rectangle

Tree
0094-binary-tree-inorder-traversal
0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Binary Tree
0094-binary-tree-inorder-traversal
0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Binary Search Tree
0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree

Breadth-First Search
0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0111-minimum-depth-of-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0126-word-ladder-ii
0127-word-ladder
0130-surrounded-regions
0133-clone-graph

Divide and Conquer
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0148-sort-list

Greedy
0122-best-time-to-buy-and-sell-stock-ii
0134-gas-station
0135-candy

Union Find
0128-longest-consecutive-sequence
0130-surrounded-regions

Graph
0133-clone-graph

Trie
0139-word-break
0140-word-break-ii

Recursion
0143-reorder-list

Merge Sort
0148-sort-list

About

Created using LeetHub @ https://github.com/QasimWani/LeetHub

leetcode.com/problemset/all/

Topics

javascript ruby java go typescript sql algorithms python3 data-structures leetcode-solutions coding-challenges leetcode-java leetcode-javascript leetcode-ruby algorithms-and-data-structures leetcode-go leetcode-database leetcode-python3 leetcode-typescript

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages