GitHub - joyrocks93/GFG_Daily_Problem: Daily Problem of GFG

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 133 Commits
Add Binary Strings.cpp		Add Binary Strings.cpp
Adding Array Elements.cpp		Adding Array Elements.cpp
Aggressive Cows.cpp		Aggressive Cows.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
Array Removals.cpp		Array Removals.cpp
BST to max heap.cpp		BST to max heap.cpp
Ball coloring.cpp		Ball coloring.cpp
Base Equivalence.cpp		Base Equivalence.cpp
Binary Tree to DLL.cpp		Binary Tree to DLL.cpp
Case-specific Sorting of Strings.cpp		Case-specific Sorting of Strings.cpp
Check if all levels of two trees are anagrams or not.cpp		Check if all levels of two trees are anagrams or not.cpp
Check if it is possible to convert one string into another with given constraints.cpp		Check if it is possible to convert one string into another with given constraints.cpp
Chicks in a Zoo.cpp		Chicks in a Zoo.cpp
Complete Binary Tree.cpp		Complete Binary Tree.cpp
Composite and Prime.cpp		Composite and Prime.cpp
Construct Binary Tree from String with bracket representation.cpp		Construct Binary Tree from String with bracket representation.cpp
Count Palindromic Subsequences.cpp		Count Palindromic Subsequences.cpp
Count all possible paths from top left to bottom right.cpp		Count all possible paths from top left to bottom right.cpp
Count occurrences of a given word in a 2-d array.cpp		Count occurrences of a given word in a 2-d array.cpp
Count of Subarrays.cpp		Count of Subarrays.cpp
Count the Number of Full Binary Trees.cpp		Count the Number of Full Binary Trees.cpp
Counting elements in two arrays.cpp		Counting elements in two arrays.cpp
Decode the string.cpp		Decode the string.cpp
Delete nodes greater than k.cpp		Delete nodes greater than k.cpp
Distance from the Source (Bellman-Ford Algorithm).cpp		Distance from the Source (Bellman-Ford Algorithm).cpp
Egg Dropping Puzzle.cpp		Egg Dropping Puzzle.cpp
Enemy.cpp		Enemy.cpp
Exceptionally odd.cpp		Exceptionally odd.cpp
Fact Digit Sum.cpp		Fact Digit Sum.cpp
Fill up buckets.cpp		Fill up buckets.cpp
Find all distinct subset (or subsequence) sums.cpp		Find all distinct subset (or subsequence) sums.cpp
Find pairs with given sum in doubly linked list.cpp		Find pairs with given sum in doubly linked list.cpp
Find patterns.cpp		Find patterns.cpp
Find the Safe Position.cpp		Find the Safe Position.cpp
Firing employees.cpp		Firing employees.cpp
Fitting The Array.cpp		Fitting The Array.cpp
Flatten binary tree to linked list.cpp		Flatten binary tree to linked list.cpp
Floyd Warshall.cpp		Floyd Warshall.cpp
Foldable Binary Tree.cpp		Foldable Binary Tree.cpp
Friends Pairing Problem.cpp		Friends Pairing Problem.cpp
Game with nos.cpp		Game with nos.cpp
Geek and Number String.cpp		Geek and Number String.cpp
Geek and Strings.cpp		Geek and Strings.cpp
Geek and knots.cpp		Geek and knots.cpp
Generate IP Addresses.cpp		Generate IP Addresses.cpp
Grouping Of Numbers.cpp		Grouping Of Numbers.cpp
Help Ishaan.cpp		Help Ishaan.cpp
IPL 2021 - Match Day 2.cpp		IPL 2021 - Match Day 2.cpp
Immediate Smaller Element.cpp		Immediate Smaller Element.cpp
Josephus problem.cpp		Josephus problem.cpp
Jumping Numbers.cpp		Jumping Numbers.cpp
Knight Walk.cpp		Knight Walk.cpp
LCM Triplet.cpp		LCM Triplet.cpp
Length of longest palindrome in linked list.cpp		Length of longest palindrome in linked list.cpp
Lexicographically smallest string.cpp		Lexicographically smallest string.cpp
License Key Formatting.cpp		License Key Formatting.cpp
Longest Bitonic subsequence.cpp		Longest Bitonic subsequence.cpp
Longest Sub-Array with Sum K.cpp		Longest Sub-Array with Sum K.cpp
M-Coloring Problem.cpp		M-Coloring Problem.cpp
Magic Triplets.cpp		Magic Triplets.cpp
Max Min.cpp		Max Min.cpp
Max length chain.cpp		Max length chain.cpp
Maximize the sum of selected numbers from an array to make it empty.cpp		Maximize the sum of selected numbers from an array to make it empty.cpp
Maximum Sub Array.cpp		Maximum Sub Array.cpp
Maximum Sub-String after at most K changes.cpp		Maximum Sub-String after at most K changes.cpp
Maximum Sum LCM.cpp		Maximum Sum LCM.cpp
Maximum number of 2X2 squares.cpp		Maximum number of 2X2 squares.cpp
Maximum sum leaf to root path.cpp		Maximum sum leaf to root path.cpp
Median in a row-wise sorted Matrix.cpp		Median in a row-wise sorted Matrix.cpp
Merging Details.cpp		Merging Details.cpp
Minimum Cost of ropes.cpp		Minimum Cost of ropes.cpp
Minimum Cost to cut a board into squares.cpp		Minimum Cost to cut a board into squares.cpp
Minimum Exchange.cpp		Minimum Exchange.cpp
Minimum Sum of Absolute Differences of Pairs.cpp		Minimum Sum of Absolute Differences of Pairs.cpp
Minimum Swaps.cpp		Minimum Swaps.cpp
Minimum characters to be added at front to make string palindrome.cpp		Minimum characters to be added at front to make string palindrome.cpp
Minimum number of Coins.cpp		Minimum number of Coins.cpp
Minimum time to fulfil all orders.cpp		Minimum time to fulfil all orders.cpp
Modified Numbers and Queries.cpp		Modified Numbers and Queries.cpp
Move Last Element to Front of a Linked List.cpp		Move Last Element to Front of a Linked List.cpp
Next Right Node.cpp		Next Right Node.cpp
Nine Divisors.cpp		Nine Divisors.cpp
Number Of Islands.cpp		Number Of Islands.cpp
Number Of Open Doors.cpp		Number Of Open Doors.cpp
Number of Distinct Islands.cpp		Number of Distinct Islands.cpp
Number of Turns in Binary Tree.CPP		Number of Turns in Binary Tree.CPP
Number of Ways to Arrive at Destination.cpp		Number of Ways to Arrive at Destination.cpp
Pots of Gold Game.cpp		Pots of Gold Game.cpp
Power Of 2 and Subsequences.cpp		Power Of 2 and Subsequences.cpp
Preorder to BST.cpp		Preorder to BST.cpp
Primes sum.cpp		Primes sum.cpp
Print the pattern.cpp		Print the pattern.cpp
Queries on a Matrix.cpp		Queries on a Matrix.cpp
QuickSort on Doubly Linked List.cpp		QuickSort on Doubly Linked List.cpp
Rearrange Array Alternately.cpp		Rearrange Array Alternately.cpp
Reorder List.cpp		Reorder List.cpp
Repeated Character.cpp		Repeated Character.cpp
Replace every element with the least greater element on its right.cpp		Replace every element with the least greater element on its right.cpp
Satisfy the equation.cpp		Satisfy the equation.cpp