Ldass2000 / Geeks_for_geeks_coding Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

programs from geeksforgeeks practice. The language used is c++. For every problem, the problem statement with input and expected output has been provided, except for some where the driver code was already provided in the editor

github.com/ldass2000/geeks_for_geeks_coding

2 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 108 Commits
Check for BST - GFG		Check for BST - GFG
Check for Balanced Tree - GFG		Check for Balanced Tree - GFG
Check if two arrays are equal or not - GFG		Check if two arrays are equal or not - GFG
Coin Change - GFG		Coin Change - GFG
Compare two linked lists - GFG		Compare two linked lists - GFG
Construct Tree from Inorder & Preorder - GFG		Construct Tree from Inorder & Preorder - GFG
Count the number of possible triangles - GFG		Count the number of possible triangles - GFG
Diameter of a Binary Tree - GFG		Diameter of a Binary Tree - GFG
Exactly one swap - GFG		Exactly one swap - GFG
Find the Closest Element in BST - GFG		Find the Closest Element in BST - GFG
Find the Frequency - GFG		Find the Frequency - GFG
First Repeating Element - GFG		First Repeating Element - GFG
Flatten binary tree to linked list - GFG		Flatten binary tree to linked list - GFG
Given a linked list of 0s, 1s and 2s, sort it. - GFG		Given a linked list of 0s, 1s and 2s, sort it. - GFG
Insert a node in a BST - GFG		Insert a node in a BST - GFG
K distance from root - GFG		K distance from root - GFG
Kadane's Algorithm - GFG		Kadane's Algorithm - GFG
Largest number in K swaps - GFG		Largest number in K swaps - GFG
Largest subarray of 0's and 1's - GFG		Largest subarray of 0's and 1's - GFG
Largest subarray with 0 sum - GFG		Largest subarray with 0 sum - GFG
Leaf at same level - GFG		Leaf at same level - GFG
Left View of Binary Tree - GFG		Left View of Binary Tree - GFG
Level order traversal - GFG		Level order traversal - GFG
Level order traversal Line by Line - GFG		Level order traversal Line by Line - GFG
Lowest Common Ancestor in a BST - GFG		Lowest Common Ancestor in a BST - GFG
Maximum Product Subarray - GFG		Maximum Product Subarray - GFG
Maximum Width of Tree - GFG		Maximum Width of Tree - GFG
Maximum difference between node and its ancestor - GFG		Maximum difference between node and its ancestor - GFG
Minimum Depth of a Binary Tree - GFG		Minimum Depth of a Binary Tree - GFG
Minimum distance between two numbers - GFG		Minimum distance between two numbers - GFG
Minimum element in BST - GFG		Minimum element in BST - GFG
Peak element - GFG		Peak element - GFG
Remove duplicate element from sorted Linked List - GFG		Remove duplicate element from sorted Linked List - GFG
Remove duplicates from an unsorted linked list - GFG		Remove duplicates from an unsorted linked list - GFG
Replace all 0's with 5 - GFG		Replace all 0's with 5 - GFG
Reverse a Linked List in groups of given size. - GFG		Reverse a Linked List in groups of given size. - GFG
Reverse a linked list - GFG		Reverse a linked list - GFG
Reverse a string using Stack - GFG		Reverse a string using Stack - GFG
Right View of Binary Tree - GFG		Right View of Binary Tree - GFG
Root to leaf path sum - GFG		Root to leaf path sum - GFG
Rotate Array - GFG		Rotate Array - GFG
Selection Sort - GFG		Selection Sort - GFG
Shortest Path between Cities - GFG		Shortest Path between Cities - GFG
Sort a stack - GFG		Sort a stack - GFG
Sum of elements between k1'th and k2'th smallest elements - GFG		Sum of elements between k1'th and k2'th smallest elements - GFG
Sum of two numbers without using arithmetic operators - GFG		Sum of two numbers without using arithmetic operators - GFG
Third largest element - GFG		Third largest element - GFG
Transform to Sum Tree - GFG		Transform to Sum Tree - GFG
Twice Counter - GFG		Twice Counter - GFG
Vertical sum - GFG		Vertical sum - GFG
You and your books - GFG		You and your books - GFG
k-th smallest element in BST - GFG		k-th smallest element in BST - GFG
README.md		README.md