GitHub - Master-Helix/LeetCode_Practice: Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

LeetCode Questions Repository

-> This Repository contains Solutions of all my Accepted Questions on Leetcode
-> Give a Star if you find it Useful
-> Thank You

Name		Name	Last commit message	Last commit date
Latest commit History 923 Commits
0 - 1 Knapsack Problem - GFG		0 - 1 Knapsack Problem - GFG
0012-integer-to-roman		0012-integer-to-roman
0038-count-and-say		0038-count-and-say
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
0127-word-ladder		0127-word-ladder
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0220-contains-duplicate-iii		0220-contains-duplicate-iii
0309-best-time-to-buy-and-sell-stock-with-cooldown		0309-best-time-to-buy-and-sell-stock-with-cooldown
0402-remove-k-digits		0402-remove-k-digits
0416-partition-equal-subset-sum		0416-partition-equal-subset-sum
0433-minimum-genetic-mutation		0433-minimum-genetic-mutation
0509-fibonacci-number		0509-fibonacci-number
0518-coin-change-ii		0518-coin-change-ii
0523-continuous-subarray-sum		0523-continuous-subarray-sum
0583-delete-operation-for-two-strings		0583-delete-operation-for-two-strings
0645-set-mismatch		0645-set-mismatch
0692-top-k-frequent-words		0692-top-k-frequent-words
0714-best-time-to-buy-and-sell-stock-with-transaction-fee		0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0766-toeplitz-matrix		0766-toeplitz-matrix
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1007-minimum-domino-rotations-for-equal-row		1007-minimum-domino-rotations-for-equal-row
1008-construct-binary-search-tree-from-preorder-traversal		1008-construct-binary-search-tree-from-preorder-traversal
1010-pairs-of-songs-with-total-durations-divisible-by-60		1010-pairs-of-songs-with-total-durations-divisible-by-60
1029-two-city-scheduling		1029-two-city-scheduling
1038-binary-search-tree-to-greater-sum-tree		1038-binary-search-tree-to-greater-sum-tree
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1043-partition-array-for-maximum-sum		1043-partition-array-for-maximum-sum
1046-last-stone-weight		1046-last-stone-weight
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1081-smallest-subsequence-of-distinct-characters		1081-smallest-subsequence-of-distinct-characters
11-container-with-most-water		11-container-with-most-water
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
1143-longest-common-subsequence		1143-longest-common-subsequence
115-distinct-subsequences		115-distinct-subsequences
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
118-pascals-triangle		118-pascals-triangle
12. Closet 0s 1s and 2s - GFG		12. Closet 0s 1s and 2s - GFG
12. Find median in a stream - GFG		12. Find median in a stream - GFG
120-triangle		120-triangle
1206-design-skiplist		1206-design-skiplist
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
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
1260-shift-2d-grid		1260-shift-2d-grid
1268-search-suggestions-system		1268-search-suggestions-system
128-longest-consecutive-sequence		128-longest-consecutive-sequence
1290-convert-binary-number-in-a-linked-list-to-integer		1290-convert-binary-number-in-a-linked-list-to-integer
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
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
1315-sum-of-nodes-with-even-valued-grandparent		1315-sum-of-nodes-with-even-valued-grandparent
132-palindrome-partitioning-ii		132-palindrome-partitioning-ii
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
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
1344-angle-between-hands-of-a-clock		1344-angle-between-hands-of-a-clock
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
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
1424-diagonal-traverse-ii		1424-diagonal-traverse-ii
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
146-lru-cache		146-lru-cache
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
1493-longest-subarray-of-1s-after-deleting-one-element		1493-longest-subarray-of-1s-after-deleting-one-element
15-3sum		15-3sum
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
154-find-minimum-in-rotated-sorted-array-ii		154-find-minimum-in-rotated-sorted-array-ii
1588-sum-of-all-odd-length-subarrays		1588-sum-of-all-odd-length-subarrays
16-3sum-closest		16-3sum-closest
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
1609-even-odd-tree		1609-even-odd-tree
162-find-peak-element		162-find-peak-element
1647-minimum-deletions-to-make-character-frequencies-unique		1647-minimum-deletions-to-make-character-frequencies-unique
1657-determine-if-two-strings-are-close		1657-determine-if-two-strings-are-close
1658-minimum-operations-to-reduce-x-to-zero		1658-minimum-operations-to-reduce-x-to-zero
1662-check-if-two-string-arrays-are-equivalent		1662-check-if-two-string-arrays-are-equivalent
1663-smallest-string-with-a-given-numeric-value		1663-smallest-string-with-a-given-numeric-value
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1680-concatenation-of-consecutive-binary-numbers		1680-concatenation-of-consecutive-binary-numbers
1685-sum-of-absolute-differences-in-a-sorted-array		1685-sum-of-absolute-differences-in-a-sorted-array
1689-partitioning-into-minimum-number-of-deci-binary-numbers		1689-partitioning-into-minimum-number-of-deci-binary-numbers
169-majority-element		169-majority-element
1695-maximum-erasure-value		1695-maximum-erasure-value
17-letter-combinations-of-a-phone-number		17-letter-combinations-of-a-phone-number
1706-where-will-the-ball-fall		1706-where-will-the-ball-fall
1707-maximum-xor-with-an-element-from-array		1707-maximum-xor-with-an-element-from-array
1710-maximum-units-on-a-truck		1710-maximum-units-on-a-truck
1721-swapping-nodes-in-a-linked-list		1721-swapping-nodes-in-a-linked-list

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Folders and files

Latest commit

History

Repository files navigation

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages