Name	Name	Last commit message	Last commit date
Latest commit History 255 Commits
0 - 1 Knapsack Problem - GFG	0 - 1 Knapsack Problem - GFG
Add 1 to a number represented as linked list - GFG	Add 1 to a number represented as linked list - GFG
Anagram Palindrome - GFG	Anagram Palindrome - GFG
Array Subset of another array - GFG	Array Subset of another array - GFG
BFS of graph - GFG	BFS of graph - GFG
Boundary Traversal of binary tree - GFG	Boundary Traversal of binary tree - GFG
Convert array into Zig-Zag fashion - GFG	Convert array into Zig-Zag fashion - GFG
Count Inversions - GFG	Count Inversions - GFG
DFS of Graph - GFG	DFS of 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
Find Missing And Repeating - GFG	Find Missing And Repeating - GFG
Find first repeated character - GFG	Find first repeated character - GFG
Find length of Loop - GFG	Find length of Loop - GFG
Flattening a Linked List - GFG	Flattening a Linked List - GFG
Floor in BST - GFG	Floor in BST - GFG
Fractional Knapsack - GFG	Fractional Knapsack - 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
Graph and Vertices - GFG	Graph and Vertices - GFG
Height of Binary Tree - GFG	Height of Binary Tree - GFG
Implement Queue using array - GFG	Implement Queue using array - GFG
Implement stack using array - GFG	Implement stack using array - GFG
Implement strstr - GFG	Implement strstr - GFG
Kth smallest element - GFG	Kth smallest element - GFG
Largest Element in Array - GFG	Largest Element in Array - GFG
Largest subarray with 0 sum - GFG	Largest subarray with 0 sum - GFG
Leaders in an array - GFG	Leaders in an array - GFG
Longest Increasing Path in a Matrix - GFG	Longest Increasing Path in a Matrix - GFG
Longest K unique characters substring - GFG	Longest K unique characters substring - GFG
Max sum in sub-arrays - GFG	Max sum in sub-arrays - GFG
Maximum sum leaf to root path - GFG	Maximum sum leaf to root path - GFG
Minimum element in BST - GFG	Minimum element in BST - GFG
Minimum number of Coins - GFG	Minimum number of Coins - GFG
Minimum sum partition - GFG	Minimum sum partition - GFG
Missing number - GFG	Missing number - GFG
N meetings in one room - GFG	N meetings in one room - GFG
Non Repeating Character - GFG	Non Repeating Character - GFG
Number of Distinct Islands - GFG	Number of Distinct Islands - GFG
Number of Provinces - GFG	Number of Provinces - GFG
Number of occurrence - GFG	Number of occurrence - GFG
Party of Couples - GFG	Party of Couples - GFG
Print adjacency list - GFG	Print adjacency list - GFG
Print first n Fibonacci Numbers - GFG	Print first n Fibonacci Numbers - GFG
Quick Sort - GFG	Quick Sort - GFG
Rat in a Maze Problem - I - GFG	Rat in a Maze Problem - I - GFG
Root to Leaf Paths - GFG	Root to Leaf Paths - GFG
Rotation - GFG	Rotation - GFG
Row with max 1s - GFG	Row with max 1s - GFG
Second Largest - GFG	Second Largest - GFG
Square root of a number - GFG	Square root of a number - GFG
Subset Sum Problem - GFG	Subset Sum Problem - GFG
Topological sort - GFG	Topological sort - GFG
Uncommon characters - GFG	Uncommon characters - GFG
Union of Two Sorted Arrays - GFG	Union of Two Sorted Arrays - GFG
100SameTree.cpp	100SameTree.cpp
101SymmetricTree.cpp	101SymmetricTree.cpp
1022SumOfRootToLeafBinaryNumbers.cpp	1022SumOfRootToLeafBinaryNumbers.cpp
102BinaryTreeLevelOrderTraversal.cpp	102BinaryTreeLevelOrderTraversal.cpp
104MaximumDepthOfBinaryTree.cpp	104MaximumDepthOfBinaryTree.cpp
112PathSumInBST.cpp	112PathSumInBST.cpp
118. Pascal's Triangle.cpp	118. Pascal's Triangle.cpp
121BestTimetoBuyandSellStock.cpp	121BestTimetoBuyandSellStock.cpp
1281. Subtract the Product and Sum of Digits of an Integer.cpp	1281. Subtract the Product and Sum of Digits of an Integer.cpp
1291SequentialDigits.cpp	1291SequentialDigits.cpp
1343NumberofSub-arrays of Size K and Average Greater thanorEqualtoThreshold.cpp	1343NumberofSub-arrays of Size K and Average Greater thanorEqualtoThreshold.cpp
134GasStation.cpp	134GasStation.cpp
136SingleNumber.cpp	136SingleNumber.cpp
141LinkedListCycle.cpp	141LinkedListCycle.cpp
142LinkedListCycleII.cpp	142LinkedListCycleII.cpp
144BinaryTreePreorderTraversal.cpp	144BinaryTreePreorderTraversal.cpp
145BinaryTreePostorderTraversal.cpp	145BinaryTreePostorderTraversal.cpp
1491. Average Salary Excluding the Minimum and Maximum Salary.cpp	1491. Average Salary Excluding the Minimum and Maximum Salary.cpp
1502. Can Make Arithmetic Progression From Sequence.cpp	1502. Can Make Arithmetic Progression From Sequence.cpp
1523. Count Odd Numbers in an Interval Range.cpp	1523. Count Odd Numbers in an Interval Range.cpp
1672RichestCustomerWealth.cpp	1672RichestCustomerWealth.cpp
167Two SumII-Input ArrayIsSorted.cpp	167Two SumII-Input ArrayIsSorted.cpp
172. Factorial Trailing Zeroes.cpp	172. Factorial Trailing Zeroes.cpp
1790. Check if One String Swap Can Make Strings Equal.cpp	1790. Check if One String Swap Can Make Strings Equal.cpp
1822. Sign of the Product of an Array.cpp	1822. Sign of the Product of an Array.cpp
189RotateArray.cpp	189RotateArray.cpp
191. Number of 1 Bits.cpp	191. Number of 1 Bits.cpp
19RemoveNthNodeFromEndofList.cpp	19RemoveNthNodeFromEndofList.cpp
202. Happy Number.cpp	202. Happy Number.cpp
203RemoveLinkedListElement.cpp	203RemoveLinkedListElement.cpp
205IsomorphicStrings.cpp	205IsomorphicStrings.cpp
206ReverseLinkedList.cpp	206ReverseLinkedList.cpp
2091. Removing Minimum and Maximum From Array.cpp	2091. Removing Minimum and Maximum From Array.cpp
20ValidParanthesis.cpp	20ValidParanthesis.cpp
2124CheckIf'All'a'Before'b'.cpp	2124CheckIf'All'a'Before'b'.cpp
2125NoOfLasersInTheBank.cpp	2125NoOfLasersInTheBank.cpp
2126DestroyingAsteroids.cpp	2126DestroyingAsteroids.cpp
2130MaximumTwinSumOfLinkedList.cpp	2130MaximumTwinSumOfLinkedList.cpp
215. Kth Largest Element in an Array.cpp	215. Kth Largest Element in an Array.cpp
2154KeepMultiplyingFoundValuesbyTwo.cpp	2154KeepMultiplyingFoundValuesbyTwo.cpp
2155AllDivisionsWiththeHighestScoreofaBinaryArray.cpp	2155AllDivisionsWiththeHighestScoreofaBinaryArray.cpp
21MergeTwoSortedList.cpp	21MergeTwoSortedList.cpp
2244. Minimum Rounds to Complete All Tasks.cpp	2244. Minimum Rounds to Complete All Tasks.cpp
226InvertBinaryTree.cpp	226InvertBinaryTree.cpp
232ImplementQueueUsingStacks.cpp	232ImplementQueueUsingStacks.cpp
242Validanagram.cpp	242Validanagram.cpp

Name

Last commit message

Last commit date

255 Commits

0 - 1 Knapsack Problem - GFG

Add 1 to a number represented as linked list - GFG

Anagram Palindrome - GFG

Array Subset of another array - GFG

BFS of graph - GFG

Boundary Traversal of binary tree - GFG

Convert array into Zig-Zag fashion - GFG

Count Inversions - GFG