Name	Name	Last commit message	Last commit date
Latest commit History 610 Commits
0104-maximum-depth-of-binary-tree	0104-maximum-depth-of-binary-tree
0344-reverse-string	0344-reverse-string
0876-middle-of-the-linked-list	0876-middle-of-the-linked-list
1-two-sum	1-two-sum
102-binary-tree-level-order-traversal	102-binary-tree-level-order-traversal
1029-two-city-scheduling	1029-two-city-scheduling
112-path-sum	112-path-sum
1137-n-th-tribonacci-number	1137-n-th-tribonacci-number
121-best-time-to-buy-and-sell-stock	121-best-time-to-buy-and-sell-stock
1249-minimum-remove-to-make-valid-parentheses	1249-minimum-remove-to-make-valid-parentheses
1290-convert-binary-number-in-a-linked-list-to-integer	1290-convert-binary-number-in-a-linked-list-to-integer
1337-the-k-weakest-rows-in-a-matrix	1337-the-k-weakest-rows-in-a-matrix
138-copy-list-with-random-pointer	138-copy-list-with-random-pointer
141-linked-list-cycle	141-linked-list-cycle
142-linked-list-cycle-ii	142-linked-list-cycle-ii
146-lru-cache	146-lru-cache
148-sort-list	148-sort-list
1480-running-sum-of-1d-array	1480-running-sum-of-1d-array
160-intersection-of-two-linked-lists	160-intersection-of-two-linked-lists
19-remove-nth-node-from-end-of-list	19-remove-nth-node-from-end-of-list
199-binary-tree-right-side-view	199-binary-tree-right-side-view
2-add-two-numbers	2-add-two-numbers
20-valid-parentheses	20-valid-parentheses
202-happy-number	202-happy-number
206-reverse-linked-list	206-reverse-linked-list
21-merge-two-sorted-lists	21-merge-two-sorted-lists
2194-cells-in-a-range-on-an-excel-sheet	2194-cells-in-a-range-on-an-excel-sheet
2195-append-k-integers-with-minimal-sum	2195-append-k-integers-with-minimal-sum
234-palindrome-linked-list	234-palindrome-linked-list
237-delete-node-in-a-linked-list	237-delete-node-in-a-linked-list
24-swap-nodes-in-pairs	24-swap-nodes-in-pairs
240-search-a-2d-matrix-ii	240-search-a-2d-matrix-ii
25-reverse-nodes-in-k-group	25-reverse-nodes-in-k-group
283-move-zeroes	283-move-zeroes
300-longest-increasing-subsequence	300-longest-increasing-subsequence
316-remove-duplicate-letters	316-remove-duplicate-letters
322-coin-change	322-coin-change
344-reverse-string	344-reverse-string
347-top-k-frequent-elements	347-top-k-frequent-elements
413-arithmetic-slices	413-arithmetic-slices
509-fibonacci-number	509-fibonacci-number
61-rotate-list	61-rotate-list
62-unique-paths	62-unique-paths
7-reverse-integer	7-reverse-integer
705-design-hashset	705-design-hashset
706-design-hashmap	706-design-hashmap
724-find-pivot-index	724-find-pivot-index
73-set-matrix-zeroes	73-set-matrix-zeroes
74-search-a-2d-matrix	74-search-a-2d-matrix
740-delete-and-earn	740-delete-and-earn
763-partition-labels	763-partition-labels
80-remove-duplicates-from-sorted-array-ii	80-remove-duplicates-from-sorted-array-ii
82-remove-duplicates-from-sorted-list-ii	82-remove-duplicates-from-sorted-list-ii
83-remove-duplicates-from-sorted-list	83-remove-duplicates-from-sorted-list
856-score-of-parentheses	856-score-of-parentheses
876-middle-of-the-linked-list	876-middle-of-the-linked-list
88-merge-sorted-array	88-merge-sorted-array
881-boats-to-save-people	881-boats-to-save-people
92-reverse-linked-list-ii	92-reverse-linked-list-ii
938-range-sum-of-bst	938-range-sum-of-bst
94-binary-tree-inorder-traversal	94-binary-tree-inorder-traversal
946-validate-stack-sequences	946-validate-stack-sequences
98-validate-binary-search-tree	98-validate-binary-search-tree
991-broken-calculator	991-broken-calculator
Activity Selection - GFG	Activity Selection - GFG
Binary Tree to BST - GFG	Binary Tree to BST - GFG
Boolean Matrix - GFG	Boolean Matrix - GFG
Check for BST - GFG	Check for BST - GFG
Check whether K-th bit is set or not - GFG	Check whether K-th bit is set or not - GFG
Count pairs with given sum - GFG	Count pairs with given sum - GFG
Delete nodes having greater value on right - GFG	Delete nodes having greater value on right - GFG
Equilibrium Point - GFG	Equilibrium Point - GFG
Eventual Safe States - GFG	Eventual Safe States - GFG
Find All Four Sum Numbers - GFG	Find All Four Sum Numbers - GFG
Find minimum and maximum element in an array - GFG	Find minimum and maximum element in an array - GFG
Minimum Platforms - GFG	Minimum Platforms - GFG
Perfect Sum Problem - GFG	Perfect Sum Problem - GFG
Reverse a String - GFG	Reverse a String - GFG
Reverse an Array - GFG	Reverse an Array - GFG
Roman Number to Integer - GFG	Roman Number to Integer - GFG
Search a node in BST - GFG	Search a node in BST - GFG
Sort an array of 0s, 1s and 2s - GFG	Sort an array of 0s, 1s and 2s - GFG
Sum of two numbers without using arithmetic operators - GFG	Sum of two numbers without using arithmetic operators - GFG
The Celebrity Problem - GFG	The Celebrity Problem - GFG
Total Decoding Messages - GFG	Total Decoding Messages - GFG
Union of two arrays - GFG	Union of two arrays - GFG
interview	interview
107binarytreelevelordertraversal,py	107binarytreelevelordertraversal,py
2arraysequalreverse.py	2arraysequalreverse.py
2sum.cpp	2sum.cpp
3Sum.py	3Sum.py
4Sum.py	4Sum.py
AddOneRowToTree.py	AddOneRowToTree.py
AddTwoNumbers.py	AddTwoNumbers.py
ArrangingCoins441.py	ArrangingCoins441.py
BFS.py	BFS.py
Backspacestringcompare.cpp	Backspacestringcompare.cpp
BestSellingWtihTransaction.cpp	BestSellingWtihTransaction.cpp
ClimbingStairs.cpp	ClimbingStairs.cpp
Closest3Sum.py	Closest3Sum.py

Name

Last commit message

Last commit date

610 Commits

0104-maximum-depth-of-binary-tree

0344-reverse-string

0876-middle-of-the-linked-list

1-two-sum

102-binary-tree-level-order-traversal

1029-two-city-scheduling

112-path-sum

1137-n-th-tribonacci-number