Geeks For Geek Problem of Day Repository

This Reposistory is created for GeeksForGeek Problem of the Day. Here whatever problem of days I solved are uploaded here.

List of Problem

Date	Problem Name	Solution Link
5 January 2023	Find the longest string	Solution
6 January 2023	Shortest Prime Path	Solution
7 January 2023	Flattening a Linked List	Solution
8 January 2023	Absolute difference divisible by K	Solution
9 January 2023	Last Modified Bowl	Solution
10 January 2023	Transform To Sum Tree	Solution
11 January 2023	Make Array Elements Unique	Solution
12 January 2023	Minimize The Sum	Solution
13 January 2023	Count Lucky Permutation	Solution
14 January 2023	Maximum Number of Toys	Solution
15 January 2023	Count the Substring	Solution
16 January 2023	Next Greater Element in Array	Solution
17 January 2023	Find the maximum GCD of siblings of binary tree.	Solution
18 January 2023	Find the first node of loop in linked list	Solution
19 January 2023	Carpet into Box	Solution

Name		Name	Last commit message	Last commit date
Latest commit History 33 Commits
Absolute_Diff_Divisiable_By_K.cpp		Absolute_Diff_Divisiable_By_K.cpp
Carpet_into_Box.cpp		Carpet_into_Box.cpp
Count_Lucky_Permutation.cpp		Count_Lucky_Permutation.cpp
Count_The_Substrings.cpp		Count_The_Substrings.cpp
Find_first_node.cpp		Find_first_node.cpp
Flatten_A_Linked_List.cpp		Flatten_A_Linked_List.cpp
Last_Modified_Bowl.cpp		Last_Modified_Bowl.cpp
LongestString.cpp		LongestString.cpp
Make_array_Unique.cpp		Make_array_Unique.cpp
Maximum_No_Of_Toys.cpp		Maximum_No_Of_Toys.cpp
Minimize_Sum.cpp		Minimize_Sum.cpp
Next_Greater_Elements.cpp		Next_Greater_Elements.cpp
README.md		README.md
Shortest_Prime_Path.cpp		Shortest_Prime_Path.cpp
Transform_To_Sum_Tree.cpp		Transform_To_Sum_Tree.cpp
maxGCD.cpp		maxGCD.cpp