GitHub - Glorycs29/Leetcode-GFG-daily-2023: Questions from LC and GFG

Name		Name	Last commit message	Last commit date
Latest commit History 174 Commits
!(IMP) Trie Implementation(Leetcode).cpp		!(IMP) Trie Implementation(Leetcode).cpp
(C)Maximum difference by remapping a digit(Leetcode).cpp		(C)Maximum difference by remapping a digit(Leetcode).cpp
(C)Minimum impossible OR(Leetcode).cpp		(C)Minimum impossible OR(Leetcode).cpp
(C)Minimum score by changing two elements(Leetcode).cpp		(C)Minimum score by changing two elements(Leetcode).cpp
(Concept)Merge_k_Sorted_linkedlist(Leetcode).cpp		(Concept)Merge_k_Sorted_linkedlist(Leetcode).cpp
(Leetcode)Minimum Time to Collect All Apples in a Tree.cpp		(Leetcode)Minimum Time to Collect All Apples in a Tree.cpp
1736, Merge string aternatively(Leetcode).cpp		1736, Merge string aternatively(Leetcode).cpp
Add to Array form of Integer.cpp		Add to Array form of Integer.cpp
Add_1_to_linked_List(gfg).cpp		Add_1_to_linked_List(gfg).cpp
Add_Binary(Leetcode).cpp		Add_Binary(Leetcode).cpp
Alternative negative and positive element(GFG).cpp		Alternative negative and positive element(GFG).cpp
Apple sequences(GFG).cpp		Apple sequences(GFG).cpp
Arithmatic_Number(GFG).cpp		Arithmatic_Number(GFG).cpp
As far from land as possible(Leetcode).cpp		As far from land as possible(Leetcode).cpp
Avoid explosion(GFG).cpp		Avoid explosion(GFG).cpp
BST_downward_traversal(GFG).cpp		BST_downward_traversal(GFG).cpp
BST_maximum_difference(GFG).cpp		BST_maximum_difference(GFG).cpp
Balloon everywhere(GFG).cpp		Balloon everywhere(GFG).cpp
Best nodes(GFG).cpp		Best nodes(GFG).cpp
Best team with no conflict(Leetcode).cpp		Best team with no conflict(Leetcode).cpp
Best time to buy and sell stocks(Leetcode).cpp		Best time to buy and sell stocks(Leetcode).cpp
Binary matrix having maximum number 1s(GFG).cpp		Binary matrix having maximum number 1s(GFG).cpp
Binary tree zig zag level order traversal(Leetcode).cpp		Binary tree zig zag level order traversal(Leetcode).cpp
BinaryTree Boundary_Traversal		BinaryTree Boundary_Traversal
BinaryTree_zig zag Level order (Leetcode).cpp		BinaryTree_zig zag Level order (Leetcode).cpp
Can place flowers(Leetcode).cpp		Can place flowers(Leetcode).cpp
Capacity_to_ship_pacakages_within_D_days(Leetcode).cpp		Capacity_to_ship_pacakages_within_D_days(Leetcode).cpp
Check completeness of binary tree(Leetcode).cpp		Check completeness of binary tree(Leetcode).cpp
Check for subsequence(GFGF).cpp		Check for subsequence(GFGF).cpp
Check if there exist a subsequence with sum k(GFG).cpp		Check if there exist a subsequence with sum k(GFG).cpp
Clone_Graph(leetcode).cpp		Clone_Graph(leetcode).cpp
CombinationSum(Leetcode).cpp		CombinationSum(Leetcode).cpp
CombinationSum2.cpp		CombinationSum2.cpp
Concatenated_words(leetcode).cpp		Concatenated_words(leetcode).cpp
Construct a binary tree from inorder and postorder (Leetcode).cpp		Construct a binary tree from inorder and postorder (Leetcode).cpp
Conver sorted linked list to bst(Leetcode).cpp		Conver sorted linked list to bst(Leetcode).cpp
Count cyclic paths(GFG).cpp		Count cyclic paths(GFG).cpp
Count odd in an interval range(Leetcode).cpp		Count odd in an interval range(Leetcode).cpp
Count square submatrix with all ones(Leetcode).cpp		Count square submatrix with all ones(Leetcode).cpp
Count the number of free cells(GFG).cpp		Count the number of free cells(GFG).cpp
Count_the_Substring(gfg)		Count_the_Substring(gfg)
Cutting rectangles(GFG).cpp		Cutting rectangles(GFG).cpp
Data_Stream_As_Disjoint_interval(Leetcode).cpp		Data_Stream_As_Disjoint_interval(Leetcode).cpp
Delete_middle_of stack(GFG).cpp		Delete_middle_of stack(GFG).cpp
Deletion and reverse in a linked_list(GFG).cpp		Deletion and reverse in a linked_list(GFG).cpp
Design Browser History(GFG).cpp		Design Browser History(GFG).cpp
Detect loop in a linked list(GFG).cpp		Detect loop in a linked list(GFG).cpp
Distinct Coloring(GFG).cpp		Distinct Coloring(GFG).cpp
Dominant_pairs(GFG).cpp		Dominant_pairs(GFG).cpp
Element with left side smaller and right side greater(GFG).cpp		Element with left side smaller and right side greater(GFG).cpp
Fibbonacci upto Nth term(GFG).cpp		Fibbonacci upto Nth term(GFG).cpp
Fill_the_matrix.cpp		Fill_the_matrix.cpp
Find duplicates subtrees(Leetcode).cpp		Find duplicates subtrees(Leetcode).cpp
Find median in a stream (IMP)(GFG).cpp		Find median in a stream (IMP)(GFG).cpp
Find the index of first occurrence in a string(Leetcode).cpp		Find the index of first occurrence in a string(Leetcode).cpp
FindTownJudge\|\|Celebrity_problem(leetcode)		FindTownJudge\|\|Celebrity_problem(leetcode)
Find_closest_node_from_given_two_nodes(Leetcode).cpp		Find_closest_node_from_given_two_nodes(Leetcode).cpp
Fixing two swapped nodes of bst(GFG).cpp		Fixing two swapped nodes of bst(GFG).cpp
FlattenLinkedList(GFG)->SinglyLL		FlattenLinkedList(GFG)->SinglyLL
Flip string to monotone increasing (Leetcode)		Flip string to monotone increasing (Leetcode)
Geek hates too many 1s(GFG).cpp		Geek hates too many 1s(GFG).cpp
Geeks_Island.cpp		Geeks_Island.cpp
Good_Stones.cpp		Good_Stones.cpp
Greatest common divisor of strings(GFG).cpp		Greatest common divisor of strings(GFG).cpp
House_robber(leetcode).cpp		House_robber(leetcode).cpp
IPO(Leetcode).cpp		IPO(Leetcode).cpp
Infix to postfix(GFG).cpp		Infix to postfix(GFG).cpp
Insert interval(letcode)		Insert interval(letcode)
Inver a binaryTree(Leetcode).cpp		Inver a binaryTree(Leetcode).cpp
Is Subsequence(Leetcode-3-approach).cpp		Is Subsequence(Leetcode-3-approach).cpp
Jump game IV(Leetcode).cpp		Jump game IV(Leetcode).cpp
Kids_with_greatest_number_of_candies(Leetcode).cpp		Kids_with_greatest_number_of_candies(Leetcode).cpp
Koko eating Bananas(Leetcode).cpp		Koko eating Bananas(Leetcode).cpp
Kth largest sum in binary tree(Leetocde).cpp		Kth largest sum in binary tree(Leetocde).cpp
Kth symbol in grammar(Leetcode).cpp		Kth symbol in grammar(Leetcode).cpp
LFU_Cache(Leetcode).cpp		LFU_Cache(Leetcode).cpp
Largest sum cycle(GFG)HARD.cpp		Largest sum cycle(GFG)HARD.cpp
Last_Cell_in_matrix(GFG).cpp		Last_Cell_in_matrix(GFG).cpp
Length_of_longest_palindromic_substring(DP + loops).cpp		Length_of_longest_palindromic_substring(DP + loops).cpp
Length_of_longest_palindromic_substring(GFG article).cpp		Length_of_longest_palindromic_substring(GFG article).cpp
Length_of_longest_palindromic_substring(iterative).cpp		Length_of_longest_palindromic_substring(iterative).cpp
Lexicographically_Smalles_Equivalent_Stringt_		Lexicographically_Smalles_Equivalent_Stringt_
Linked list cycleII(Leetcode).cpp		Linked list cycleII(Leetcode).cpp
Linked list random node(Leetcode).cpp		Linked list random node(Leetcode).cpp
LinkedList in binary tree(Leetcode).cpp		LinkedList in binary tree(Leetcode).cpp
Longest subarray with positive product(GFG).cpp		Longest subarray with positive product(GFG).cpp
Longest_palindromic_substring(GFG)(very imp).cpp		Longest_palindromic_substring(GFG)(very imp).cpp
MakeArrayElementUnique(GFG)		MakeArrayElementUnique(GFG)
Max min height(GFG).cpp		Max min height(GFG).cpp
Maximum bipartite matching(GFG).cpp		Maximum bipartite matching(GFG).cpp
Maximum possible value(GFG).cpp		Maximum possible value(GFG).cpp
Maximum sum without adjacent(GFG).cpp		Maximum sum without adjacent(GFG).cpp
Maximum triplet product(GFG).cpp		Maximum triplet product(GFG).cpp
Maximum_Binary_tree(Leetcode).cpp		Maximum_Binary_tree(Leetcode).cpp
Maximum_Number_of_Toys(GOOGLE)(GFG).cpp		Maximum_Number_of_Toys(GOOGLE)(GFG).cpp
Maximum_Subarray_sum_circular(leetcode)		Maximum_Subarray_sum_circular(leetcode)
Maximum_height_of_binary_tree.cpp		Maximum_height_of_binary_tree.cpp
Maximum_product_subarray(GFG).cpp		Maximum_product_subarray(GFG).cpp
Maximum_weight_node(gfg)		Maximum_weight_node(gfg)
Median_of_two_sorted_array_of_diff._size(optimal)		Median_of_two_sorted_array_of_diff._size(optimal)

Folders and files

Latest commit

History

About

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages