Leetcode-Solutions

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

Name		Name	Last commit message	Last commit date
Latest commit History 262 Commits
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0025-reverse-nodes-in-k-group		0025-reverse-nodes-in-k-group
0039-combination-sum		0039-combination-sum
0045-jump-game-ii		0045-jump-game-ii
0046-permutations		0046-permutations
0055-jump-game		0055-jump-game
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0077-combinations		0077-combinations
0100-same-tree		0100-same-tree
0101-symmetric-tree		0101-symmetric-tree
0102-binary-tree-level-order-traversal		0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0134-gas-station		0134-gas-station
0139-word-break		0139-word-break
0149-max-points-on-a-line		0149-max-points-on-a-line
0226-invert-binary-tree		0226-invert-binary-tree
0290-word-pattern		0290-word-pattern
0326-power-of-three		0326-power-of-three
0342-power-of-four		0342-power-of-four
0345-reverse-vowels-of-a-string		0345-reverse-vowels-of-a-string
0530-minimum-absolute-difference-in-bst		0530-minimum-absolute-difference-in-bst
0543-diameter-of-binary-tree		0543-diameter-of-binary-tree
0783-minimum-distance-between-bst-nodes		0783-minimum-distance-between-bst-nodes
0989-add-to-array-form-of-integer		0989-add-to-array-form-of-integer
1049-last-stone-weight-ii		1049-last-stone-weight-ii
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
1108-defanging-an-ip-address		1108-defanging-an-ip-address
1137-n-th-tribonacci-number		1137-n-th-tribonacci-number
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
1221-split-a-string-in-balanced-strings		1221-split-a-string-in-balanced-strings
1302-deepest-leaves-sum		1302-deepest-leaves-sum
1306-jump-game-iii		1306-jump-game-iii
1443-minimum-time-to-collect-all-apples-in-a-tree		1443-minimum-time-to-collect-all-apples-in-a-tree
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
155-min-stack		155-min-stack
1662-check-if-two-string-arrays-are-equivalent		1662-check-if-two-string-arrays-are-equivalent
1757-recyclable-and-low-fat-products		1757-recyclable-and-low-fat-products
1758-minimum-changes-to-make-alternating-binary-string		1758-minimum-changes-to-make-alternating-binary-string
1833-maximum-ice-cream-bars		1833-maximum-ice-cream-bars
1876-substrings-of-size-three-with-distinct-characters		1876-substrings-of-size-three-with-distinct-characters
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
20-valid-parentheses		20-valid-parentheses
206-reverse-linked-list		206-reverse-linked-list
2114-maximum-number-of-words-found-in-sentences		2114-maximum-number-of-words-found-in-sentences
239-sliding-window-maximum		239-sliding-window-maximum
2415-reverse-odd-levels-of-binary-tree		2415-reverse-odd-levels-of-binary-tree
27-remove-element		27-remove-element
2966-divide-array-into-arrays-with-max-difference		2966-divide-array-into-arrays-with-max-difference
389-find-the-difference		389-find-the-difference
392-is-subsequence		392-is-subsequence
41-first-missing-positive		41-first-missing-positive
416-partition-equal-subset-sum		416-partition-equal-subset-sum
429-n-ary-tree-level-order-traversal		429-n-ary-tree-level-order-traversal
48-rotate-image		48-rotate-image
485-max-consecutive-ones		485-max-consecutive-ones
54-spiral-matrix		54-spiral-matrix
559-maximum-depth-of-n-ary-tree		559-maximum-depth-of-n-ary-tree
589-n-ary-tree-preorder-traversal		589-n-ary-tree-preorder-traversal
590-n-ary-tree-postorder-traversal		590-n-ary-tree-postorder-traversal
595-big-countries		595-big-countries
605-can-place-flowers		605-can-place-flowers
704-binary-search		704-binary-search
733-flood-fill		733-flood-fill
746-min-cost-climbing-stairs		746-min-cost-climbing-stairs
771-jewels-and-stones		771-jewels-and-stones
832-flipping-an-image		832-flipping-an-image
84-largest-rectangle-in-histogram		84-largest-rectangle-in-histogram
863-all-nodes-distance-k-in-binary-tree		863-all-nodes-distance-k-in-binary-tree
876-middle-of-the-linked-list		876-middle-of-the-linked-list
96-unique-binary-search-trees		96-unique-binary-search-trees
98-validate-binary-search-tree		98-validate-binary-search-tree
BFS of graph - GFG		BFS of graph - GFG
Cyclically rotate an array by one - GFG		Cyclically rotate an array by one - GFG
DFS of Graph - GFG		DFS of Graph - GFG
Kadane's Algorithm - GFG		Kadane's Algorithm - GFG
Reverse Spiral Form of Matrix - GFG		Reverse Spiral Form of Matrix - GFG
Rotten Oranges - GFG		Rotten Oranges - GFG
Subarray with given sum - GFG		Subarray with given sum - GFG
Subset Sums - GFG		Subset Sums - GFG
Union of two arrays - GFG		Union of two arrays - GFG
1.jpeg		1.jpeg
README.md		README.md

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Leetcode-Solutions

About

Uh oh!

Releases

Packages

Languages

jatinS-dev/Leetcode-Solutions

Folders and files

Latest commit

History

Repository files navigation

Leetcode-Solutions

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages