Name	Name	Last commit message	Last commit date
Latest commit History 340 Commits
0031-next-permutation	0031-next-permutation
0037-sudoku-solver	0037-sudoku-solver
0048-rotate-image	0048-rotate-image
0053-maximum-subarray	0053-maximum-subarray
0056-merge-intervals	0056-merge-intervals
0060-permutation-sequence	0060-permutation-sequence
0062-unique-paths	0062-unique-paths
0063-unique-paths-ii	0063-unique-paths-ii
0064-minimum-path-sum	0064-minimum-path-sum
0069-sqrtx	0069-sqrtx
0070-climbing-stairs	0070-climbing-stairs
0072-edit-distance	0072-edit-distance
0073-set-matrix-zeroes	0073-set-matrix-zeroes
0074-search-a-2d-matrix	0074-search-a-2d-matrix
0075-sort-colors	0075-sort-colors
0088-merge-sorted-array	0088-merge-sorted-array
0115-distinct-subsequences	0115-distinct-subsequences
0118-pascals-triangle	0118-pascals-triangle
0120-triangle	0120-triangle
0121-best-time-to-buy-and-sell-stock	0121-best-time-to-buy-and-sell-stock
0131-palindrome-partitioning	0131-palindrome-partitioning
0140-word-break-ii	0140-word-break-ii
0213-house-robber-ii	0213-house-robber-ii
0268-missing-number	0268-missing-number
0300-longest-increasing-subsequence	0300-longest-increasing-subsequence
0309-best-time-to-buy-and-sell-stock-with-cooldown	0309-best-time-to-buy-and-sell-stock-with-cooldown
0368-largest-divisible-subset	0368-largest-divisible-subset
0416-partition-equal-subset-sum	0416-partition-equal-subset-sum
0509-fibonacci-number	0509-fibonacci-number
0516-longest-palindromic-subsequence	0516-longest-palindromic-subsequence
0673-number-of-longest-increasing-subsequence	0673-number-of-longest-increasing-subsequence
0674-longest-continuous-increasing-subsequence	0674-longest-continuous-increasing-subsequence
0714-best-time-to-buy-and-sell-stock-with-transaction-fee	0714-best-time-to-buy-and-sell-stock-with-transaction-fee
1011-capacity-to-ship-packages-within-d-days	1011-capacity-to-ship-packages-within-d-days
1547-minimum-cost-to-cut-a-stick	1547-minimum-cost-to-cut-a-stick
1760-minimum-limit-of-balls-in-a-bag	1760-minimum-limit-of-balls-in-a-bag
1979-find-greatest-common-divisor-of-array	1979-find-greatest-common-divisor-of-array
2317-maximum-xor-after-operations	2317-maximum-xor-after-operations
2413-smallest-even-multiple	2413-smallest-even-multiple
2540-minimum-common-value	2540-minimum-common-value
Account Merge - GFG	Account Merge - GFG
Activity Selection - GFG	Activity Selection - GFG
Add 1 to a number represented as linked list - GFG	Add 1 to a number represented as linked list - GFG
Alex Travelling - GFG	Alex Travelling - GFG
Alien Dictionary - GFG	Alien Dictionary - GFG
Bipartite Graph - GFG	Bipartite Graph - GFG
Cheapest Flights Within K Stops - GFG	Cheapest Flights Within K Stops - GFG
City With the Smallest Number of Neighbors at a Threshold Distance - GFG	City With the Smallest Number of Neighbors at a Threshold Distance - GFG
Connecting the graph - GFG	Connecting the graph - GFG
Count nodes of linked list - GFG	Count nodes of linked list - GFG
Course Schedule - GFG	Course Schedule - GFG
Delete all occurrences of a given key in a doubly linked list - GFG	Delete all occurrences of a given key in a doubly linked list - GFG
Delete node in Doubly Linked List - GFG	Delete node in Doubly Linked List - 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
Doubly linked list Insertion at given position - GFG	Doubly linked list Insertion at given position - GFG
Eventual Safe States - GFG	Eventual Safe States - GFG
Find length of Loop - GFG	Find length of Loop - GFG
Find pairs with given sum in doubly linked list - GFG	Find pairs with given sum in doubly linked list - GFG
Find the number of islands - GFG	Find the number of islands - GFG
Flood fill Algorithm - GFG	Flood fill Algorithm - GFG
Floyd Warshall - GFG	Floyd Warshall - GFG
Given a linked list of 0s, 1s and 2s, sort it. - GFG	Given a linked list of 0s, 1s and 2s, sort it. - GFG
Implementing Dijkstra Algorithm - GFG	Implementing Dijkstra Algorithm - GFG
Introduction to Doubly Linked List - GFG	Introduction to Doubly Linked List - GFG
Job Sequencing Problem - GFG	Job Sequencing Problem - GFG
Longest Common Increasing Subsequence - GFG	Longest Common Increasing Subsequence - GFG
Maximum Connected group - GFG	Maximum Connected group - GFG
Maximum Stone Removal - GFG	Maximum Stone Removal - GFG
Maximum XOR subset - GFG	Maximum XOR subset - GFG
Merge Sort - GFG	Merge Sort - GFG
Minimum Multiplications to reach End - GFG	Minimum Multiplications to reach End - GFG
Minimum Spanning Tree - GFG	Minimum Spanning Tree - GFG
Minimum Swaps for Bracket Balancing - GFG	Minimum Swaps for Bracket Balancing - GFG
Number Of Enclaves - GFG	Number Of Enclaves - GFG
Number Of Islands - GFG	Number Of Islands - GFG
Number of Distinct Islands - GFG	Number of Distinct Islands - GFG
Number of Provinces - GFG	Number of Provinces - GFG
Number of Ways to Arrive at Destination - GFG	Number of Ways to Arrive at Destination - GFG
Path With Minimum Effort - GFG	Path With Minimum Effort - GFG
Police and Thieves - GFG	Police and Thieves - GFG
Prerequisite Tasks - GFG	Prerequisite Tasks - GFG
Rat in a Maze Problem - I - GFG	Rat in a Maze Problem - I - GFG
Remove duplicates from a sorted doubly linked list - GFG	Remove duplicates from a sorted doubly linked list - GFG
Replace O's with X's - GFG	Replace O's with X's - GFG
Reverse a Doubly Linked List - GFG	Reverse a Doubly Linked List - GFG
Root to leaf path sum - GFG	Root to leaf path sum - GFG
Rotten Oranges - GFG	Rotten Oranges - GFG
Search in Linked List - GFG	Search in Linked List - GFG
Shortest Distance in a Binary Maze - GFG	Shortest Distance in a Binary Maze - GFG
Shortest Path in Weighted undirected graph - GFG	Shortest Path in Weighted undirected graph - GFG
Shortest path in Directed Acyclic Graph - GFG	Shortest path in Directed Acyclic Graph - GFG
Strongly Connected Components (Kosaraju's Algo) - GFG	Strongly Connected Components (Kosaraju's Algo) - GFG
Topological sort - GFG	Topological sort - GFG
Travelling Salesman Problem - GFG	Travelling Salesman Problem - GFG
Word Ladder I - GFG	Word Ladder I - GFG
Word Ladder II - GFG	Word Ladder II - GFG
k largest elements - GFG	k largest elements - GFG

Name

Last commit message

Last commit date

340 Commits

0031-next-permutation

0037-sudoku-solver

0048-rotate-image

0053-maximum-subarray

0056-merge-intervals

0060-permutation-sequence

0062-unique-paths

0063-unique-paths-ii