Name	Name	Last commit message	Last commit date
Latest commit History 650 Commits
0022-generate-parentheses	0022-generate-parentheses
0038-count-and-say	0038-count-and-say
0377-combination-sum-iv	0377-combination-sum-iv
0392-is-subsequence	0392-is-subsequence
0509-fibonacci-number	0509-fibonacci-number
0692-top-k-frequent-words	0692-top-k-frequent-words
100-same-tree	100-same-tree
1008-construct-binary-search-tree-from-preorder-traversal	1008-construct-binary-search-tree-from-preorder-traversal
101-symmetric-tree	101-symmetric-tree
102-binary-tree-level-order-traversal	102-binary-tree-level-order-traversal
1025-divisor-game	1025-divisor-game
103-binary-tree-zigzag-level-order-traversal	103-binary-tree-zigzag-level-order-traversal
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
105-construct-binary-tree-from-preorder-and-inorder-traversal	105-construct-binary-tree-from-preorder-and-inorder-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
109-convert-sorted-list-to-binary-search-tree	109-convert-sorted-list-to-binary-search-tree
110-balanced-binary-tree	110-balanced-binary-tree
111-minimum-depth-of-binary-tree	111-minimum-depth-of-binary-tree
112-path-sum	112-path-sum
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
118-pascals-triangle	118-pascals-triangle
119-pascals-triangle-ii	119-pascals-triangle-ii
121-best-time-to-buy-and-sell-stock	121-best-time-to-buy-and-sell-stock
1373-maximum-sum-bst-in-binary-tree	1373-maximum-sum-bst-in-binary-tree
1382-balance-a-binary-search-tree	1382-balance-a-binary-search-tree
144-binary-tree-preorder-traversal	144-binary-tree-preorder-traversal
145-binary-tree-postorder-traversal	145-binary-tree-postorder-traversal
151-reverse-words-in-a-string	151-reverse-words-in-a-string
155-min-stack	155-min-stack
1646-get-maximum-in-generated-array	1646-get-maximum-in-generated-array
169-majority-element	169-majority-element
19-remove-nth-node-from-end-of-list	19-remove-nth-node-from-end-of-list
2-add-two-numbers	2-add-two-numbers
20-valid-parentheses	20-valid-parentheses
206-reverse-linked-list	206-reverse-linked-list
21-merge-two-sorted-lists	21-merge-two-sorted-lists
211-design-add-and-search-words-data-structure	211-design-add-and-search-words-data-structure
215-kth-largest-element-in-an-array	215-kth-largest-element-in-an-array
225-implement-stack-using-queues	225-implement-stack-using-queues
229-majority-element-ii	229-majority-element-ii
23-merge-k-sorted-lists	23-merge-k-sorted-lists
230-kth-smallest-element-in-a-bst	230-kth-smallest-element-in-a-bst
232-implement-queue-using-stacks	232-implement-queue-using-stacks
235-lowest-common-ancestor-of-a-binary-search-tree	235-lowest-common-ancestor-of-a-binary-search-tree
236-lowest-common-ancestor-of-a-binary-tree	236-lowest-common-ancestor-of-a-binary-tree
237-delete-node-in-a-linked-list	237-delete-node-in-a-linked-list
287-find-the-duplicate-number	287-find-the-duplicate-number
295-find-median-from-data-stream	295-find-median-from-data-stream
31-next-permutation	31-next-permutation
347-top-k-frequent-elements	347-top-k-frequent-elements
373-find-k-pairs-with-smallest-sums	373-find-k-pairs-with-smallest-sums
378-kth-smallest-element-in-a-sorted-matrix	378-kth-smallest-element-in-a-sorted-matrix
450-delete-node-in-a-bst	450-delete-node-in-a-bst
48-rotate-image	48-rotate-image
494-target-sum	494-target-sum
496-next-greater-element-i	496-next-greater-element-i
50-powx-n	50-powx-n
501-find-mode-in-binary-search-tree	501-find-mode-in-binary-search-tree
53-maximum-subarray	53-maximum-subarray
530-minimum-absolute-difference-in-bst	530-minimum-absolute-difference-in-bst
543-diameter-of-binary-tree	543-diameter-of-binary-tree
56-merge-intervals	56-merge-intervals
653-two-sum-iv-input-is-a-bst	653-two-sum-iv-input-is-a-bst
669-trim-a-binary-search-tree	669-trim-a-binary-search-tree
70-climbing-stairs	70-climbing-stairs
700-search-in-a-binary-search-tree	700-search-in-a-binary-search-tree
701-insert-into-a-binary-search-tree	701-insert-into-a-binary-search-tree
703-kth-largest-element-in-a-stream	703-kth-largest-element-in-a-stream
73-set-matrix-zeroes	73-set-matrix-zeroes
74-search-a-2d-matrix	74-search-a-2d-matrix
746-min-cost-climbing-stairs	746-min-cost-climbing-stairs
75-sort-colors	75-sort-colors
783-minimum-distance-between-bst-nodes	783-minimum-distance-between-bst-nodes
84-largest-rectangle-in-histogram	84-largest-rectangle-in-histogram
876-middle-of-the-linked-list	876-middle-of-the-linked-list
88-merge-sorted-array	88-merge-sorted-array
897-increasing-order-search-tree	897-increasing-order-search-tree
938-range-sum-of-bst	938-range-sum-of-bst
94-binary-tree-inorder-traversal	94-binary-tree-inorder-traversal
98-validate-binary-search-tree	98-validate-binary-search-tree
987-vertical-order-traversal-of-a-binary-tree	987-vertical-order-traversal-of-a-binary-tree
Add 1 to a number represented as linked list - GFG	Add 1 to a number represented as linked list - GFG
Add two numbers represented by linked lists - GFG	Add two numbers represented by linked lists - GFG
Aggressive Cows - GFG	Aggressive Cows - GFG
All divisors of a Number - GFG	All divisors of a Number - GFG
Allocate minimum number of pages - GFG	Allocate minimum number of pages - GFG
Alternate positive and negative numbers - GFG	Alternate positive and negative numbers - GFG
Anagram - GFG	Anagram - GFG
Armstrong Numbers - GFG	Armstrong Numbers - GFG
BFS of graph - GFG	BFS of graph - GFG
Bit Difference - GFG	Bit Difference - GFG
Capacity To Ship Packages Within D Days - GFG	Capacity To Ship Packages Within D Days - GFG
Ceil The Floor - GFG	Ceil The Floor - GFG
Check if Linked List is Palindrome - GFG	Check if Linked List is Palindrome - GFG
Check if array is sorted - GFG	Check if array is sorted - GFG
Check if strings are rotations of each other or not - GFG	Check if strings are rotations of each other or not - GFG

Name

Last commit message

Last commit date

650 Commits

0022-generate-parentheses

0038-count-and-say

0377-combination-sum-iv

0392-is-subsequence

0509-fibonacci-number

0692-top-k-frequent-words

100-same-tree

1008-construct-binary-search-tree-from-preorder-traversal