LeetCodeQuestion

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

Name		Name	Last commit message	Last commit date
Latest commit History 1,571 Commits
0012-integer-to-roman		0012-integer-to-roman
0038-count-and-say		0038-count-and-say
0049-group-anagrams		0049-group-anagrams
0076-minimum-window-substring		0076-minimum-window-substring
0093-restore-ip-addresses		0093-restore-ip-addresses
0100-same-tree		0100-same-tree
0134-gas-station		0134-gas-station
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0203-remove-linked-list-elements		0203-remove-linked-list-elements
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0295-find-median-from-data-stream		0295-find-median-from-data-stream
0334-increasing-triplet-subsequence		0334-increasing-triplet-subsequence
0433-minimum-genetic-mutation		0433-minimum-genetic-mutation
0452-minimum-number-of-arrows-to-burst-balloons		0452-minimum-number-of-arrows-to-burst-balloons
0520-detect-capital		0520-detect-capital
0523-continuous-subarray-sum		0523-continuous-subarray-sum
0540-single-element-in-a-sorted-array		0540-single-element-in-a-sorted-array
0645-set-mismatch		0645-set-mismatch
0692-top-k-frequent-words		0692-top-k-frequent-words
0766-toeplitz-matrix		0766-toeplitz-matrix
0787-cheapest-flights-within-k-stops		0787-cheapest-flights-within-k-stops
0835-image-overlap		0835-image-overlap
0901-online-stock-span		0901-online-stock-span
0944-delete-columns-to-make-sorted		0944-delete-columns-to-make-sorted
0976-largest-perimeter-triangle		0976-largest-perimeter-triangle
1007-minimum-domino-rotations-for-equal-row		1007-minimum-domino-rotations-for-equal-row
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1022-sum-of-root-to-leaf-binary-numbers		1022-sum-of-root-to-leaf-binary-numbers
1026-maximum-difference-between-node-and-ancestor		1026-maximum-difference-between-node-and-ancestor
1029-two-city-scheduling		1029-two-city-scheduling
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1041-robot-bounded-in-circle		1041-robot-bounded-in-circle
1043-partition-array-for-maximum-sum		1043-partition-array-for-maximum-sum
1046-last-stone-weight		1046-last-stone-weight
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
1055-shortest-way-to-form-string		1055-shortest-way-to-form-string
1074-number-of-submatrices-that-sum-to-target		1074-number-of-submatrices-that-sum-to-target
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1091-shortest-path-in-binary-matrix		1091-shortest-path-in-binary-matrix
1092-shortest-common-supersequence		1092-shortest-common-supersequence
1094-car-pooling		1094-car-pooling
11-container-with-most-water		11-container-with-most-water
112-path-sum		112-path-sum
113-path-sum-ii		113-path-sum-ii
1130-minimum-cost-tree-from-leaf-values		1130-minimum-cost-tree-from-leaf-values
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
1155-number-of-dice-rolls-with-target-sum		1155-number-of-dice-rolls-with-target-sum
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
118-pascals-triangle		118-pascals-triangle
120-triangle		120-triangle
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
1220-count-vowels-permutation		1220-count-vowels-permutation
1239-maximum-length-of-a-concatenated-string-with-unique-characters		1239-maximum-length-of-a-concatenated-string-with-unique-characters
1249-minimum-remove-to-make-valid-parentheses		1249-minimum-remove-to-make-valid-parentheses
1255-maximum-score-words-formed-by-letters		1255-maximum-score-words-formed-by-letters
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
1288-remove-covered-intervals		1288-remove-covered-intervals
1291-sequential-digits		1291-sequential-digits
1293-shortest-path-in-a-grid-with-obstacles-elimination		1293-shortest-path-in-a-grid-with-obstacles-elimination
13-roman-to-integer		13-roman-to-integer
130-surrounded-regions		130-surrounded-regions
1302-deepest-leaves-sum		1302-deepest-leaves-sum
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
1319-number-of-operations-to-make-network-connected		1319-number-of-operations-to-make-network-connected
1323-maximum-69-number		1323-maximum-69-number
1328-break-a-palindrome		1328-break-a-palindrome
133-clone-graph		133-clone-graph
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance		1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1335-minimum-difficulty-of-a-job-schedule		1335-minimum-difficulty-of-a-job-schedule
1337-the-k-weakest-rows-in-a-matrix		1337-the-k-weakest-rows-in-a-matrix
1338-reduce-array-size-to-the-half		1338-reduce-array-size-to-the-half
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
1358-number-of-substrings-containing-all-three-characters		1358-number-of-substrings-containing-all-three-characters
1359-count-all-valid-pickup-and-delivery-options		1359-count-all-valid-pickup-and-delivery-options
136-single-number		136-single-number
1361-validate-binary-tree-nodes		1361-validate-binary-tree-nodes
1376-time-needed-to-inform-all-employees		1376-time-needed-to-inform-all-employees
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
1392-longest-happy-prefix		1392-longest-happy-prefix
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1423-maximum-points-you-can-obtain-from-cards		1423-maximum-points-you-can-obtain-from-cards
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1443-minimum-time-to-collect-all-apples-in-a-tree		1443-minimum-time-to-collect-all-apples-in-a-tree
1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts		1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
148-sort-list		148-sort-list
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
1482-minimum-number-of-days-to-make-m-bouquets		1482-minimum-number-of-days-to-make-m-bouquets
1483-kth-ancestor-of-a-tree-node		1483-kth-ancestor-of-a-tree-node

AayushSaini101/LeetCodeQuestion

Folders and files

Latest commit

History