Skip to content
BranchesTags

Latest commit

 

History

384 Commits

Folders and files

NameName
Last commit message
Last commit date
0733-flood-fill
0733-flood-fill
 
 
0994-rotting-oranges
0994-rotting-oranges
 
 
100-same-tree
100-same-tree
 
 
102-binary-tree-level-order-traversal
102-binary-tree-level-order-traversal
 
 
104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-tree
 
 
1043-partition-array-for-maximum-sum
1043-partition-array-for-maximum-sum
 
 
1048-longest-string-chain
1048-longest-string-chain
 
 
105-construct-binary-tree-from-preorder-and-inorder-traversal
105-construct-binary-tree-from-preorder-and-inorder-traversal
 
 
11-container-with-most-water
11-container-with-most-water
 
 
1143-longest-common-subsequence
1143-longest-common-subsequence
 
 
115-distinct-subsequences
115-distinct-subsequences
 
 
120-triangle
120-triangle
 
 
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
 
 
128-longest-consecutive-sequence
128-longest-consecutive-sequence
 
 
1312-minimum-insertion-steps-to-make-a-string-palindrome
1312-minimum-insertion-steps-to-make-a-string-palindrome
 
 
133-clone-graph
133-clone-graph
 
 
139-word-break
139-word-break
 
 
141-linked-list-cycle
141-linked-list-cycle
 
 
143-reorder-list
143-reorder-list
 
 
1463-cherry-pickup-ii
1463-cherry-pickup-ii
 
 
15-3sum
15-3sum
 
 
152-maximum-product-subarray
152-maximum-product-subarray
 
 
153-find-minimum-in-rotated-sorted-array
153-find-minimum-in-rotated-sorted-array
 
 
1547-minimum-cost-to-cut-a-stick
1547-minimum-cost-to-cut-a-stick
 
 
167-two-sum-ii-input-array-is-sorted
167-two-sum-ii-input-array-is-sorted
 
 
188-best-time-to-buy-and-sell-stock-iv
188-best-time-to-buy-and-sell-stock-iv
 
 
19-remove-nth-node-from-end-of-list
19-remove-nth-node-from-end-of-list
 
 
198-house-robber
198-house-robber
 
 
20-valid-parentheses
20-valid-parentheses
 
 
200-number-of-islands
200-number-of-islands
 
 
206-reverse-linked-list
206-reverse-linked-list
 
 
207-course-schedule
207-course-schedule
 
 
208-implement-trie-prefix-tree
208-implement-trie-prefix-tree
 
 
21-merge-two-sorted-lists
21-merge-two-sorted-lists
 
 
212-word-search-ii
212-word-search-ii
 
 
213-house-robber-ii
213-house-robber-ii
 
 
226-invert-binary-tree
226-invert-binary-tree
 
 
23-merge-k-sorted-lists
23-merge-k-sorted-lists
 
 
230-kth-smallest-element-in-a-bst
230-kth-smallest-element-in-a-bst
 
 
235-lowest-common-ancestor-of-a-binary-search-tree
235-lowest-common-ancestor-of-a-binary-search-tree
 
 
238-product-of-array-except-self
238-product-of-array-except-self
 
 
268-missing-number
268-missing-number
 
 
3-longest-substring-without-repeating-characters
3-longest-substring-without-repeating-characters
 
 
300-longest-increasing-subsequence
300-longest-increasing-subsequence
 
 
309-best-time-to-buy-and-sell-stock-with-cooldown
309-best-time-to-buy-and-sell-stock-with-cooldown
 
 
322-coin-change
322-coin-change
 
 
347-top-k-frequent-elements
347-top-k-frequent-elements
 
 
368-largest-divisible-subset
368-largest-divisible-subset
 
 
39-combination-sum
39-combination-sum
 
 
416-partition-equal-subset-sum
416-partition-equal-subset-sum
 
 
417-pacific-atlantic-water-flow
417-pacific-atlantic-water-flow
 
 
424-longest-repeating-character-replacement
424-longest-repeating-character-replacement
 
 
44-wildcard-matching
44-wildcard-matching
 
 
49-group-anagrams
49-group-anagrams
 
 
494-target-sum
494-target-sum
 
 
5-longest-palindromic-substring
5-longest-palindromic-substring
 
 
516-longest-palindromic-subsequence
516-longest-palindromic-subsequence
 
 
518-coin-change-2
518-coin-change-2
 
 
547-number-of-provinces
547-number-of-provinces
 
 
56-merge-intervals
56-merge-intervals
 
 
572-subtree-of-another-tree
572-subtree-of-another-tree
 
 
62-unique-paths
62-unique-paths
 
 
63-unique-paths-ii
63-unique-paths-ii
 
 
647-palindromic-substrings
647-palindromic-substrings
 
 
673-number-of-longest-increasing-subsequence
673-number-of-longest-increasing-subsequence
 
 
695-max-area-of-island
695-max-area-of-island
 
 
7-reverse-integer
7-reverse-integer
 
 
70-climbing-stairs
70-climbing-stairs
 
 
703-kth-largest-element-in-a-stream
703-kth-largest-element-in-a-stream
 
 
704-binary-search
704-binary-search
 
 
714-best-time-to-buy-and-sell-stock-with-transaction-fee
714-best-time-to-buy-and-sell-stock-with-transaction-fee
 
 
72-edit-distance
72-edit-distance
 
 
78-subsets
78-subsets
 
 
79-word-search
79-word-search
 
 
9-palindrome-number
9-palindrome-number
 
 
931-minimum-falling-path-sum
931-minimum-falling-path-sum
 
 
98-validate-binary-search-tree
98-validate-binary-search-tree
 
 
Alien Dictionary - GFG
Alien Dictionary - GFG
 
 
Bipartite Graph - GFG
Bipartite Graph - GFG
 
 
Detect cycle in a directed graph - GFG
Detect cycle in a directed graph - GFG
 
 
Detect cycle in an undirected graph - GFG
Detect cycle in an undirected graph - GFG
 
 
Distance from the Source (Bellman-Ford Algorithm) - GFG
Distance from the Source (Bellman-Ford Algorithm) - GFG
 
 
Distance of nearest cell having 1 - GFG
Distance of nearest cell having 1 - GFG
 
 
Eventual Safe States - GFG
Eventual Safe States - GFG
 
 
Floor in a Sorted Array - GFG
Floor in a Sorted Array - GFG
 
 
Floyd Warshall - GFG
Floyd Warshall - GFG
 
 
Implementing Dijkstra Algorithm - GFG
Implementing Dijkstra Algorithm - GFG
 
 
Maximum of all subarrays of size k - GFG
Maximum of all subarrays of size k - GFG
 
 
Number of Distinct Islands - GFG
Number of Distinct Islands - GFG
 
 
Path With Minimum Effort - GFG
Path With Minimum Effort - GFG
 
 
Print 1 To N Without Loop - GFG
Print 1 To N Without Loop - GFG
 
 
Print GFG n times - GFG
Print GFG n times - GFG
 
 
Print N to 1 without loop - GFG
Print N to 1 without loop - GFG
 
 
Replace O's with X's - GFG
Replace O's with X's - GFG
 
 
Shortest Path in Weighted undirected graph - GFG
Shortest Path in Weighted undirected graph - GFG
 
 
Shortest path in Undirected Graph having unit distance - GFG
Shortest path in Undirected Graph having unit distance - GFG
 
 
Subarray with given sum - GFG
Subarray with given sum - GFG
 
 
Topological sort - GFG
Topological sort - GFG
 
 

About

leetCode Solutions

Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages