Name		Name	Last commit message	Last commit date
Latest commit History 454 Commits
0 - 1 Knapsack Problem.cpp		0 - 1 Knapsack Problem.cpp
947. Most Stones Removed with Same Row or Column.cpp		947. Most Stones Removed with Same Row or Column.cpp
Absolute difference divisible by K.cpp		Absolute difference divisible by K.cpp
Account Merge.cpp		Account Merge.cpp
Add 1 to a Linked List Number.cpp		Add 1 to a Linked List Number.cpp
Add two numbers represented by linked lists.cpp		Add two numbers represented by linked lists.cpp
Adding Ones.cpp		Adding Ones.cpp
Additive sequence.cpp		Additive sequence.cpp
Alien Dictionary.cpp		Alien Dictionary.cpp
All Unique Permutations of an array.cpp		All Unique Permutations of an array.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
Anti Diagonal Traversal of Matrix.cpp		Anti Diagonal Traversal of Matrix.cpp
Armstrong Numbers.cpp		Armstrong Numbers.cpp
Arrange Consonants and Vowels.cpp		Arrange Consonants and Vowels.cpp
Arranging the array.cpp		Arranging the array.cpp
Array Pair Sum Divisibility Problem.cpp		Array Pair Sum Divisibility Problem.cpp
Array to BST.cpp		Array to BST.cpp
BFS of graph.cpp		BFS of graph.cpp
Better String.cpp		Better String.cpp
Binary Tree to BST.cpp		Binary Tree to BST.cpp
Binary Tree to CDLL.cpp		Binary Tree to CDLL.cpp
Binary Tree to DLL.cpp		Binary Tree to DLL.cpp
Binary representation of next number.cpp		Binary representation of next number.cpp
Bleak Numbers.cpp		Bleak Numbers.cpp
Boolean Matrix.cpp		Boolean Matrix.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
Brothers From Different Roots.cpp		Brothers From Different Roots.cpp
Burning Tree.cpp		Burning Tree.cpp
Bus Conductor.cpp		Bus Conductor.cpp
Buy Maximum Stocks if i stocks can be bought on i-th day.cpp		Buy Maximum Stocks if i stocks can be bought on i-th day.cpp
Buy and Sell a Share at most twice.cpp		Buy and Sell a Share at most twice.cpp
CamelCase Pattern Matching.cpp		CamelCase Pattern Matching.cpp
Candy.cpp		Candy.cpp
Check for Balanced Tree.cpp		Check for Balanced Tree.cpp
Check for Children Sum Property in a Binary Tree.cpp		Check for Children Sum Property in a Binary Tree.cpp
Check if Tree is Isomorphic.cpp		Check if Tree is Isomorphic.cpp
Check if a given graph is tree or not.cpp		Check if a given graph is tree or not.cpp
Check if a number is divisible by 8.cpp		Check if a number is divisible by 8.cpp
Check if a string is repetition of its substring of k-length.cpp		Check if a string is repetition of its substring of k-length.cpp
Check if all leaves are at same level.cpp		Check if all leaves are at same level.cpp
Check if frequencies can be equal.cpp		Check if frequencies can be equal.cpp
Check if strings are rotations of each other or not.cpp		Check if strings are rotations of each other or not.cpp
Check whether K-th bit is set or not.cpp		Check whether K-th bit is set or not.cpp
Chocolate Distribution Problem.cpp		Chocolate Distribution Problem.cpp
City With the Smallest Number of Neighbors at a Threshold Distance.cpp		City With the Smallest Number of Neighbors at a Threshold Distance.cpp
Clone an Undirected Graph.cpp		Clone an Undirected Graph.cpp
Closest Neighbour in BST.cpp		Closest Neighbour in BST.cpp
Closest Three Sum.cpp		Closest Three Sum.cpp
Coin Change.cpp		Coin Change.cpp
Column name from a given column number.cpp		Column name from a given column number.cpp
Combination Sum II.cpp		Combination Sum II.cpp
Compare two fractions.cpp		Compare two fractions.cpp
Consecutive 1's not allowed.cpp		Consecutive 1's not allowed.cpp
Construct Binary Tree from Inorder and Postorder.cpp		Construct Binary Tree from Inorder and Postorder.cpp
Construct a Full Binary Tree.cpp		Construct a Full Binary Tree.cpp
Construct list using given q XOR queries.cpp		Construct list using given q XOR queries.cpp
Convert array into Zig-Zag fashion.cpp		Convert array into Zig-Zag fashion.cpp
Copy Set Bits in Range.cpp		Copy Set Bits in Range.cpp
Count Linked List Nodes.cpp		Count Linked List Nodes.cpp
Count More than n_k Occurences.cpp		Count More than n_k Occurences.cpp
Count Pairs in an Array.cpp		Count Pairs in an Array.cpp
Count Pairs whose sum is equal to X.cpp		Count Pairs whose sum is equal to X.cpp
Count Smaller elements.cpp		Count Smaller elements.cpp
Count all Possible Path.cpp		Count all Possible Path.cpp
Count digit groupings of a number.cpp		Count digit groupings of a number.cpp
Count even length.cpp		Count even length.cpp
Count number of hops.cpp		Count number of hops.cpp
Count number of substrings.cpp		Count number of substrings.cpp
Count numbers containing 4.cpp		Count numbers containing 4.cpp
Count pairs Sum in matrices.cpp		Count pairs Sum in matrices.cpp
Count possible ways to construct buildings.cpp		Count possible ways to construct buildings.cpp
Count the elements.cpp		Count the elements.cpp
Count the nodes at distance K from leaf.cpp		Count the nodes at distance K from leaf.cpp
Count the subarrays having product less than k.cpp		Count the subarrays having product less than k.cpp
Count ways to N'th Stair(Order does not matter).cpp		Count ways to N'th Stair(Order does not matter).cpp
Course Schedule.cpp		Course Schedule.cpp
DFS of Graph.cpp		DFS of Graph.cpp
Decimal Equivalent of Binary Linked List.cpp		Decimal Equivalent of Binary Linked List.cpp
Delete Alternate Nodes.cpp		Delete Alternate Nodes.cpp
Delete Middle of Linked List.cpp		Delete Middle of Linked List.cpp
Delete a Node in Single Linked List.cpp		Delete a Node in Single Linked List.cpp
Delete middle element of a stack.cpp		Delete middle element of a stack.cpp
Delete node in Doubly Linked List.cpp		Delete node in Doubly Linked List.cpp
Delete nodes having greater value on right.cpp		Delete nodes having greater value on right.cpp
Delete without head pointer.cpp		Delete without head pointer.cpp
Deletion and Reverse in Circular Linked List.cpp		Deletion and Reverse in Circular Linked List.cpp
Determine if Two Trees are Identical.cpp		Determine if Two Trees are Identical.cpp
Distinct occurrences.cpp		Distinct occurrences.cpp
Distribute candies in a binary tree.cpp		Distribute candies in a binary tree.cpp
Divisibility tree.cpp		Divisibility tree.cpp
Divisor Game.cpp		Divisor Game.cpp
Does array represent Heap.cpp		Does array represent Heap.cpp
Duplicate subtree in Binary Tree.cpp		Duplicate subtree in Binary Tree.cpp
Edit Distance.cpp		Edit Distance.cpp

Repository files navigation

Problem od the day - GFG

About

this repository contain solutions to the daily programming problems presented by GeeksforGeeks. I will be using C++ or java or C programming languages to code.