Name	Name	Last commit message	Last commit date
Latest commit History 883 Commits
.Intersection Point in Y Shaped Linked Lists.cpp	.Intersection Point in Y Shaped Linked Lists.cpp
0 - 1 Knapsack Problem(dp).cpp	0 - 1 Knapsack Problem(dp).cpp
0 - 1 Knapsack Problem(recursion).cpp	0 - 1 Knapsack Problem(recursion).cpp
02-12-24 Search Pattern (KMP-Algorithm).cpp	02-12-24 Search Pattern (KMP-Algorithm).cpp
10-11-25 Stock Buy and Sell with Cooldown.cpp	10-11-25 Stock Buy and Sell with Cooldown.cpp
10-12-25 Missing And Repeating.cpp	10-12-25 Missing And Repeating.cpp
11-11-23 Make array elements unique.cpp	11-11-23 Make array elements unique.cpp
11-9-24 Minimum Cost of ropes.cpp	11-9-24 Minimum Cost of ropes.cpp
14Longest Common Substring.cpp	14Longest Common Substring.cpp
19-1-25-Rotate a Linked List.cpp	19-1-25-Rotate a Linked List.cpp
20-12-24-Spirally traversing a matrix.cpp	20-12-24-Spirally traversing a matrix.cpp
21-12-2024-Rotate by 90 degree.cpp	21-12-2024-Rotate by 90 degree.cpp
22-10-2025 Nearly sorted.cpp	22-10-2025 Nearly sorted.cpp
238. Product of Array Except Self.cpp	238. Product of Array Except Self.cpp
24-11-24 Kadane's Algorithm.cpp	24-11-24 Kadane's Algorithm.cpp
26-10-2025 Minimum Cost of ropes.cpp	26-10-2025 Minimum Cost of ropes.cpp
27-12-2026 Word Search.cpp	27-12-2026 Word Search.cpp
28-11-24Implement Atoi.cpp	28-11-24Implement Atoi.cpp
28-12-24-Find All Triplets with Zero Sum.cpp	28-12-24-Find All Triplets with Zero Sum.cpp
29-10-25 Distance of nearest cell having 1.cpp	29-10-25 Distance of nearest cell having 1.cpp
2D Hopscotch.cpp	2D Hopscotch.cpp
3 Divisors.cpp	3 Divisors.cpp
3-2-26 Stock Buy and Sell – Max one Transaction Allowed.cpp	3-2-26 Stock Buy and Sell – Max one Transaction Allowed.cpp
3-5-25 Prime List.cpp	3-5-25 Prime List.cpp
30-4-25 Find length of Loop.cpp	30-4-25 Find length of Loop.cpp
30-9-24Merge two BST 's.cpp	30-9-24Merge two BST 's.cpp
5-12-24 Sort 0s, 1s and 2s.cpp	5-12-24 Sort 0s, 1s and 2s.cpp
6-5-25 Left View of Binary Tree.cpp	6-5-25 Left View of Binary Tree.cpp
7-1-26 Count distinct elements in every window.cpp	7-1-26 Count distinct elements in every window.cpp
7-5-25 Root to Leaf Paths.cpp	7-5-25 Root to Leaf Paths.cpp
A Game of LCM.cpp	A Game of LCM.cpp
A difference of values and indexes.cpp	A difference of values and indexes.cpp
Absolute List Sorting.cpp	Absolute List Sorting.cpp
Absolute difference divisible by K(TLE).cpp	Absolute difference divisible by K(TLE).cpp
Absolute difference divisible by K.cpp	Absolute difference divisible by K.cpp
Account Merge.cpp	Account Merge.cpp
Activity Selection.cpp	Activity Selection.cpp
Add 1 to a Linked List Number.cpp	Add 1 to a Linked List Number.cpp
Add Binary Strings(potd).cpp	Add Binary Strings(potd).cpp
Add Binary Strings.cpp	Add Binary Strings.cpp
Add Minimum Characters.cpp.	Add Minimum Characters.cpp.
Add two numbers represented by linked lists(without extraspace).cpp	Add two numbers represented by linked lists(without extraspace).cpp
Add two numbers represented by linked lists.cpp	Add two numbers represented by linked lists.cpp
Additive sequence.cpp	Additive sequence.cpp
Aggressive Cows.cpp	Aggressive Cows.cpp
Akku and Binary Numbers.cpp	Akku and Binary Numbers.cpp
Alex Travelling.cpp	Alex Travelling.cpp
Alien Dictionary.cpp	Alien Dictionary.cpp
All Subsets Xor Sum.cpp	All Subsets Xor Sum.cpp
All Unique Permutations of an array.cpp	All Unique Permutations of an array.cpp
Allocate Minimum Pages.cpp	Allocate Minimum Pages.cpp
Alternate Vowel and Consonant String.cpp	Alternate Vowel and Consonant String.cpp
Alternate positive and negative numbers.cpp	Alternate positive and negative numbers.cpp
Alternative Sorting.cpp	Alternative Sorting.cpp
Anagram.cpp	Anagram.cpp
Ancestors in Binary Tree.cpp	Ancestors in Binary Tree.cpp
Another Coin Change Problem(TLE).cpp	Another Coin Change Problem(TLE).cpp
Another Coin Change Problem.cpp	Another Coin Change Problem.cpp
Apple Sequences.cpp	Apple Sequences.cpp
Arithmetic Number(TLE).cpp	Arithmetic Number(TLE).cpp
Arithmetic Number.cpp	Arithmetic Number.cpp
Armstrong Numbers.cpp	Armstrong Numbers.cpp
Arrange Consonants and Vowels(O(N)).cpp	Arrange Consonants and Vowels(O(N)).cpp
Arrange Consonants and Vowels.cpp	Arrange Consonants and Vowels.cpp
Arranging the array.cpp	Arranging the array.cpp
Array Duplicates.cpp	Array Duplicates.cpp
Array Operations.cpp	Array Operations.cpp
Array Pair Sum Divisibility Problem.cpp	Array Pair Sum Divisibility Problem.cpp
Array to BST.cpp	Array to BST.cpp
Articulation Point - I.cpp	Articulation Point - I.cpp
Asteroid Collision.cpp	Asteroid Collision.cpp
Avoid Explosion.cpp	Avoid Explosion.cpp
BFS of graph.cpp	BFS of graph.cpp
BST Downward Traversal.cpp	BST Downward Traversal.cpp
BST Maximum Difference.cpp	BST Maximum Difference.cpp
BST to greater sum tree.cpp	BST to greater sum tree.cpp
Balanced string.cpp	Balanced string.cpp
Balloon Everywhere.cpp	Balloon Everywhere.cpp
Base Equivalence.cpp	Base Equivalence.cpp
Best Node.cpp	Best Node.cpp
Bheem Wants Ladoos.cpp	Bheem Wants Ladoos.cpp
Binary Modulo.cpp	Binary Modulo.cpp
Binary Tree to BST.cpp	Binary Tree to BST.cpp
Binary Tree to DLL.cpp	Binary Tree to DLL.cpp
Binary matrix having maximum number of 1s.cpp	Binary matrix having maximum number of 1s.cpp
Binary representation of next number.cpp	Binary representation of next number.cpp
Bit Magic.cpp	Bit Magic.cpp
Bitonic Point.cpp	Bitonic Point.cpp
Black and White.cpp	Black and White.cpp
Boolean Parenthesization.cpp	Boolean Parenthesization.cpp
Bottom View of Binary Tree.cpp	Bottom View of Binary Tree.cpp
Boundary traversal of matrix.cpp	Boundary traversal of matrix.cpp
Brackets in Matrix Chain Multiplication.cpp	Brackets in Matrix Chain Multiplication.cpp
Break a number.cpp	Break a number.cpp
Build the smallest.cpp	Build the smallest.cpp
Burning Tree.cpp	Burning Tree.cpp
Burst Balloons.cpp	Burst Balloons.cpp
Bus Conductor.cpp	Bus Conductor.cpp
Buy and Sell a Share at most twice(TLE).cpp	Buy and Sell a Share at most twice(TLE).cpp
Buy and Sell a Share at most twice.cpp	Buy and Sell a Share at most twice.cpp

Name

Last commit message

Last commit date

883 Commits

.Intersection Point in Y Shaped Linked Lists.cpp

0 - 1 Knapsack Problem(dp).cpp

0 - 1 Knapsack Problem(recursion).cpp

02-12-24 Search Pattern (KMP-Algorithm).cpp

10-11-25 Stock Buy and Sell with Cooldown.cpp

10-12-25 Missing And Repeating.cpp

11-11-23 Make array elements unique.cpp

11-9-24 Minimum Cost of ropes.cpp