leetcode

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub.

Name		Name	Last commit message	Last commit date
Latest commit History 1,690 Commits
100-same-tree		100-same-tree
1007-minimum-domino-rotations-for-equal-row		1007-minimum-domino-rotations-for-equal-row
101-symmetric-tree		101-symmetric-tree
1014-best-sightseeing-pair		1014-best-sightseeing-pair
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1020-number-of-enclaves		1020-number-of-enclaves
1022-sum-of-root-to-leaf-binary-numbers		1022-sum-of-root-to-leaf-binary-numbers
1029-two-city-scheduling		1029-two-city-scheduling
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1041-robot-bounded-in-circle		1041-robot-bounded-in-circle
1046-last-stone-weight		1046-last-stone-weight
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
1050-actors-and-directors-who-cooperated-at-least-three-times		1050-actors-and-directors-who-cooperated-at-least-three-times
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
107-binary-tree-level-order-traversal-ii		107-binary-tree-level-order-traversal-ii
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1084-sales-analysis-iii		1084-sales-analysis-iii
109-convert-sorted-list-to-binary-search-tree		109-convert-sorted-list-to-binary-search-tree
1091-shortest-path-in-binary-matrix		1091-shortest-path-in-binary-matrix
1094-car-pooling		1094-car-pooling
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
111-minimum-depth-of-binary-tree		111-minimum-depth-of-binary-tree
1114-print-in-order		1114-print-in-order
1115-print-foobar-alternately		1115-print-foobar-alternately
112-path-sum		112-path-sum
1129-shortest-path-with-alternating-colors		1129-shortest-path-with-alternating-colors
113-path-sum-ii		113-path-sum-ii
1137-n-th-tribonacci-number		1137-n-th-tribonacci-number
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
1141-user-activity-for-the-past-30-days-i		1141-user-activity-for-the-past-30-days-i
1143-longest-common-subsequence		1143-longest-common-subsequence
1146-snapshot-array		1146-snapshot-array
1148-article-views-i		1148-article-views-i
115-distinct-subsequences		115-distinct-subsequences
1158-market-analysis-i		1158-market-analysis-i
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
1162-as-far-from-land-as-possible		1162-as-far-from-land-as-possible
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
1179-reformat-department-table		1179-reformat-department-table
118-pascals-triangle		118-pascals-triangle
119-pascals-triangle-ii		119-pascals-triangle-ii
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
1201-ugly-number-iii		1201-ugly-number-iii
1202-smallest-string-with-swaps		1202-smallest-string-with-swaps
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
1232-check-if-it-is-a-straight-line		1232-check-if-it-is-a-straight-line
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
1249-minimum-remove-to-make-valid-parentheses		1249-minimum-remove-to-make-valid-parentheses
1254-number-of-closed-islands		1254-number-of-closed-islands
1260-shift-2d-grid		1260-shift-2d-grid
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
1281-subtract-the-product-and-sum-of-digits-of-an-integer		1281-subtract-the-product-and-sum-of-digits-of-an-integer
1283-find-the-smallest-divisor-given-a-threshold		1283-find-the-smallest-divisor-given-a-threshold
1288-remove-covered-intervals		1288-remove-covered-intervals
1290-convert-binary-number-in-a-linked-list-to-integer		1290-convert-binary-number-in-a-linked-list-to-integer
1291-sequential-digits		1291-sequential-digits
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold		1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
130-surrounded-regions		130-surrounded-regions
1300-sum-of-mutated-array-closest-to-target		1300-sum-of-mutated-array-closest-to-target
1302-deepest-leaves-sum		1302-deepest-leaves-sum
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
1306-jump-game-iii		1306-jump-game-iii
1309-decrypt-string-from-alphabet-to-integer-mapping		1309-decrypt-string-from-alphabet-to-integer-mapping
131-palindrome-partitioning		131-palindrome-partitioning
1314-matrix-block-sum		1314-matrix-block-sum
1319-number-of-operations-to-make-network-connected		1319-number-of-operations-to-make-network-connected
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1337-the-k-weakest-rows-in-a-matrix		1337-the-k-weakest-rows-in-a-matrix
134-gas-station		134-gas-station
1342-number-of-steps-to-reduce-a-number-to-zero		1342-number-of-steps-to-reduce-a-number-to-zero
1345-jump-game-iv		1345-jump-game-iv
1346-check-if-n-and-its-double-exist		1346-check-if-n-and-its-double-exist
1351-count-negative-numbers-in-a-sorted-matrix		1351-count-negative-numbers-in-a-sorted-matrix
1356-sort-integers-by-the-number-of-1-bits		1356-sort-integers-by-the-number-of-1-bits
1359-count-all-valid-pickup-and-delivery-options		1359-count-all-valid-pickup-and-delivery-options
136-single-number		136-single-number
1367-linked-list-in-binary-tree		1367-linked-list-in-binary-tree
1376-time-needed-to-inform-all-employees		1376-time-needed-to-inform-all-employees
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree		1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1385-find-the-distance-value-between-two-arrays		1385-find-the-distance-value-between-two-arrays
139-word-break		139-word-break
1393-capital-gain-loss		1393-capital-gain-loss
1396-design-underground-system		1396-design-underground-system
14-longest-common-prefix		14-longest-common-prefix
1407-top-travellers		1407-top-travellers
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
143-reorder-list		143-reorder-list
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1461-check-if-a-string-contains-all-binary-codes-of-size-k		1461-check-if-a-string-contains-all-binary-codes-of-size-k

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

leetcode

About

Uh oh!

Languages

License

froghramar/leetcode

Folders and files

Latest commit

History

Repository files navigation

leetcode

About

Topics

Resources

License

Uh oh!

Stars

Watchers

Forks

Languages