Name	Name	Last commit message	Last commit date
Latest commit History 1,759 Commits
0 - 1 Knapsack Problem - GFG	0 - 1 Knapsack Problem - GFG
0001-two-sum	0001-two-sum
0002-add-two-numbers	0002-add-two-numbers
0003-longest-substring-without-repeating-characters	0003-longest-substring-without-repeating-characters
0004-median-of-two-sorted-arrays	0004-median-of-two-sorted-arrays
0011-container-with-most-water	0011-container-with-most-water
0012-integer-to-roman	0012-integer-to-roman
0013-roman-to-integer	0013-roman-to-integer
0021-merge-two-sorted-lists	0021-merge-two-sorted-lists
0023-merge-k-sorted-lists	0023-merge-k-sorted-lists
0040-combination-sum-ii	0040-combination-sum-ii
0046-permutations	0046-permutations
0056-merge-intervals	0056-merge-intervals
0057-insert-interval	0057-insert-interval
0064-minimum-path-sum	0064-minimum-path-sum
0071-simplify-path	0071-simplify-path
0078-subsets	0078-subsets
0087-scramble-string	0087-scramble-string
0090-subsets-ii	0090-subsets-ii
0096-unique-binary-search-trees	0096-unique-binary-search-trees
0101-symmetric-tree	0101-symmetric-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal	0106-construct-binary-tree-from-inorder-and-postorder-traversal
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
0129-sum-root-to-leaf-numbers	0129-sum-root-to-leaf-numbers
0133-clone-graph	0133-clone-graph
0153-find-minimum-in-rotated-sorted-array	0153-find-minimum-in-rotated-sorted-array
0189-rotate-array	0189-rotate-array
0198-house-robber	0198-house-robber
0208-implement-trie-prefix-tree	0208-implement-trie-prefix-tree
0210-course-schedule-ii	0210-course-schedule-ii
0211-design-add-and-search-words-data-structure	0211-design-add-and-search-words-data-structure
0213-house-robber-ii	0213-house-robber-ii
0225-implement-stack-using-queues	0225-implement-stack-using-queues
0237-delete-node-in-a-linked-list	0237-delete-node-in-a-linked-list
0279-perfect-squares	0279-perfect-squares
0300-longest-increasing-subsequence	0300-longest-increasing-subsequence
0322-coin-change	0322-coin-change
0344-reverse-string	0344-reverse-string
0445-add-two-numbers-ii	0445-add-two-numbers-ii
0456-132-pattern	0456-132-pattern
0547-number-of-provinces	0547-number-of-provinces
0605-can-place-flowers	0605-can-place-flowers
0784-letter-case-permutation	0784-letter-case-permutation
0958-check-completeness-of-a-binary-tree	0958-check-completeness-of-a-binary-tree
0983-minimum-cost-for-tickets	0983-minimum-cost-for-tickets
0994-rotting-oranges	0994-rotting-oranges
1008-construct-binary-search-tree-from-preorder-traversal	1008-construct-binary-search-tree-from-preorder-traversal
1192-critical-connections-in-a-network	1192-critical-connections-in-a-network
1319-number-of-operations-to-make-network-connected	1319-number-of-operations-to-make-network-connected
132 Geeky Buildings - GFG	132 Geeky Buildings - GFG
1402-reducing-dishes	1402-reducing-dishes
1444-number-of-ways-of-cutting-a-pizza	1444-number-of-ways-of-cutting-a-pizza
1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero	1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero
1472-design-browser-history	1472-design-browser-history
2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph	2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph
2348-number-of-zero-filled-subarrays	2348-number-of-zero-filled-subarrays
2360-longest-cycle-in-a-graph	2360-longest-cycle-in-a-graph
2492-minimum-score-of-a-path-between-two-cities	2492-minimum-score-of-a-path-between-two-cities
3 Divisors - GFG	3 Divisors - GFG
Activity Selection - GFG	Activity Selection - GFG
Add two numbers represented by linked lists - GFG	Add two numbers represented by linked lists - GFG
Adding Ones - GFG	Adding Ones - GFG
All divisors of a Number - GFG	All divisors of a Number - GFG
Anagram - GFG	Anagram - GFG
Arranging the array - GFG	Arranging the array - GFG
Array to BST - GFG	Array to BST - GFG
Articulation Point - I - GFG	Articulation Point - I - GFG
BFS of graph - GFG	BFS of graph - GFG
Binary Array Sorting - GFG	Binary Array Sorting - GFG
Binary Search - GFG	Binary Search - GFG
Binary String - GFG	Binary String - GFG
Binary Tree to BST - GFG	Binary Tree to BST - GFG
Binary Tree to DLL - GFG	Binary Tree to DLL - GFG
Bipartite Graph - GFG	Bipartite Graph - GFG
Bottom View of Binary Tree - GFG	Bottom View of Binary Tree - GFG
Boundary Elements of Matrix - GFG	Boundary Elements of Matrix - GFG
Boundary Traversal of binary tree - GFG	Boundary Traversal of binary tree - GFG
Boundary traversal of matrix - GFG	Boundary traversal of matrix - GFG
Build the smallest - GFG	Build the smallest - GFG
Cheapest Flights Within K Stops - GFG	Cheapest Flights Within K Stops - GFG
Check If Circular Linked List - GFG	Check If Circular Linked List - GFG
Check for Balanced Tree - GFG	Check for Balanced Tree - GFG
Check for subsequence - GFG	Check for subsequence - GFG
Check if Linked List is Palindrome - GFG	Check if Linked List is Palindrome - GFG
Check set bits - GFG	Check set bits - GFG
Check whether K-th bit is set or not - GFG	Check whether K-th bit is set or not - GFG
Clone Graph - GFG	Clone Graph - GFG
Clone a linked list with next and random pointer - GFG	Clone a linked list with next and random pointer - GFG
Clone a stack without using extra space - GFG	Clone a stack without using extra space - GFG
Coin Change - GFG	Coin Change - GFG
Combination Sum - GFG	Combination Sum - GFG
Combination Sum II - GFG	Combination Sum II - GFG
Connect Nodes at Same Level - GFG	Connect Nodes at Same Level - GFG
Connecting the graph - GFG	Connecting the graph - GFG
Construct BST from Postorder - GFG	Construct BST from Postorder - GFG
Construct Binary Tree from Parent Array - GFG	Construct Binary Tree from Parent Array - GFG
Construct Tree from Inorder & Preorder - GFG	Construct Tree from Inorder & Preorder - GFG
Convert array into Zig-Zag fashion - GFG	Convert array into Zig-Zag fashion - GFG
Convert to Roman No - GFG	Convert to Roman No - GFG

Name

Last commit message

Last commit date