GitHub - DoanTrungHuy/practice-interview-code: Practice coding every day to train your problem-solving mindset. Includes lessons on gready, dynamic programming, graphs and algorithms, data structures and other techniques.

DoanTrungHuy / practice-interview-code Public

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

Practice coding every day to train your problem-solving mindset. Includes lessons on gready, dynamic programming, graphs and algorithms, data structures and other techniques.

leetcode.com/doantrunghuy/

2 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 6,870 Commits
Sorry, we had to truncate this directory to 1,000 files. 540 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
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0006-zigzag-conversion		0006-zigzag-conversion
0007-reverse-integer		0007-reverse-integer
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
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
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
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
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
0038-count-and-say		0038-count-and-say
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
0059-spiral-matrix-ii		0059-spiral-matrix-ii
0062-unique-paths		0062-unique-paths
0063-unique-paths-ii		0063-unique-paths-ii
0064-minimum-path-sum		0064-minimum-path-sum
0067-add-binary		0067-add-binary
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
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
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
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
0097-interleaving-string		0097-interleaving-string
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
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
0107-binary-tree-level-order-traversal-ii		0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree		0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree		0109-convert-sorted-list-to-binary-search-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0114-flatten-binary-tree-to-linked-list		0114-flatten-binary-tree-to-linked-list
0115-distinct-subsequences		0115-distinct-subsequences
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
0122-best-time-to-buy-and-sell-stock-ii		0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii		0123-best-time-to-buy-and-sell-stock-iii
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0125-valid-palindrome		0125-valid-palindrome

About

Practice coding every day to train your problem-solving mindset. Includes lessons on gready, dynamic programming, graphs and algorithms, data structures and other techniques.

leetcode.com/doantrunghuy/

leetcode-solutions algorithms-and-data-structures

Activity

2 stars

1 watching

0 forks

Report repository