GitHub - BangKartavya/GFG: A repo where I put the code of Daily Practice Problems from geeksforgeeks.org

BangKartavya / GFG Public

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

A repo where I put the code of Daily Practice Problems from geeksforgeeks.org

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 728 Commits
0 - 1 Knapsack Problem		0 - 1 Knapsack Problem
2D Submatrix Sum Queries		2D Submatrix Sum Queries
AND In Range		AND In Range
ASCII Range Sum		ASCII Range Sum
AVL Tree Deletion		AVL Tree Deletion
AVL Tree Insertion		AVL Tree Insertion
Account Merge		Account Merge
Activity Selection		Activity Selection
Add 1 to a Linked List Number		Add 1 to a Linked List Number
Add Binary Strings		Add Binary Strings
Add Number Linked Lists		Add Number Linked Lists
Add Two Numbers Represented by Linked Lists		Add Two Numbers Represented by Linked Lists
Additive Sequence		Additive Sequence
Aggressive Cows		Aggressive Cows
Alien Dictionary		Alien Dictionary
All Palindromic Partitions		All Palindromic Partitions
All Unique Permutations of an Array		All Unique Permutations of an Array
Allocate Minimum Pages		Allocate Minimum Pages
Alternate Positive and Negative Numbers		Alternate Positive and Negative Numbers
Alternative Sorting		Alternative Sorting
Anagram		Anagram
Anti Diagonal Traversal of Matrix		Anti Diagonal Traversal of Matrix
Armstrong Numbers		Armstrong Numbers
Arrange Consonants and Vowels		Arrange Consonants and Vowels
Array Pair Sum Divisibility Problem		Array Pair Sum Divisibility Problem
Array to BST		Array to BST
Articulation Point - II		Articulation Point - II
Assign Mice Holes		Assign Mice Holes
BFS of graph		BFS of graph
BST to greater sum tree		BST to greater sum tree
BST with Dead End		BST with Dead End
Balancing Consonants and Vowels Ratio		Balancing Consonants and Vowels Ratio
Bellman-Ford		Bellman-Ford
Better String		Better String
Binary Representation of Next Number		Binary Representation of Next Number
Binary Tree to BST		Binary Tree to BST
Binary Tree to CDLL		Binary Tree to CDLL
Binary Tree to DLL		Binary Tree to DLL
Bitonic Point		Bitonic Point
Bleak Numbers		Bleak Numbers
Boolean Matrix		Boolean Matrix
Boolean Parenthesization		Boolean Parenthesization
Bottom View of Binary Tree		Bottom View of Binary Tree
Boundary traversal of matrix		Boundary traversal of matrix
Brackets in Matrix Chain Multiplication		Brackets in Matrix Chain Multiplication
Bridge edge in a graph		Bridge edge in a graph
Brothers From Different Roots		Brothers From Different Roots
Burning Tree		Burning Tree
Buy Maximum Stocks if i Stocks Can be Bought on i-th Day		Buy Maximum Stocks if i Stocks Can be Bought on i-th Day
Buy and Sell a Share at Most Twice		Buy and Sell a Share at Most Twice
Candy		Candy
Case-specific Sorting of Strings		Case-specific Sorting of Strings
Check If String is Rotated by Two Places		Check If String is Rotated by Two Places
Check If Strings are Roations of Each Other or Not		Check If Strings are Roations of Each Other or Not
Check If Two Line Segments Intersect		Check If Two Line Segments Intersect
Check If a String is Repetition of Its Substring of k-Length		Check If a String is Repetition of Its Substring of k-Length
Check Whether K-th Bit is Set or Not		Check Whether K-th Bit is Set or Not
Check for BST		Check for BST
Check for Balanced Tree		Check for Balanced Tree
Check for Children Sum Property in a Binary Tree		Check for Children Sum Property in a Binary Tree
Check if All Leaves are at Same Level		Check if All Leaves are at Same Level
Check if Frequencies can be Equal		Check if Frequencies can be Equal
Check if Tree is Isomorphic		Check if Tree is Isomorphic
Check if a Given Graph is Tree or Not		Check if a Given Graph is Tree or Not
Check if a Number is Divisible by 8		Check if a Number is Divisible by 8
Check if a String is Subsequence of Other		Check if a String is Subsequence of Other
Check whether BST contains Dead End		Check whether BST contains Dead End
Chocolate Pickup II		Chocolate Pickup II
Circle of Strings		Circle of Strings
City With the Smallest Number of Neighbors at a Threshold Distance		City With the Smallest Number of Neighbors at a Threshold Distance
Clone List with Next and Random		Clone List with Next and Random
Clone a Linked List with Next and Random Pointer		Clone a Linked List with Next and Random Pointer
Clone an Undirected Graph		Clone an Undirected Graph
Closest Neighbour in BST		Closest Neighbour in BST
Closest Three Sum		Closest Three Sum
Coin Change (Count Ways)		Coin Change (Count Ways)
Coin Change (Minimum Coins)		Coin Change (Minimum Coins)
Coin Piles		Coin Piles
Column name from a given column number		Column name from a given column number
Combination Sum II		Combination Sum II
Compare Two Fractions		Compare Two Fractions
Consecutive 1's not Allowed		Consecutive 1's not Allowed
Construct Binary Tree from Inorder and Postorder		Construct Binary Tree from Inorder and Postorder
Construct Binary Tree from Parent Array		Construct Binary Tree from Parent Array
Construct List Using Given q XOR Queries		Construct List Using Given q XOR Queries
Construct Tree from Inorder & Preorder		Construct Tree from Inorder & Preorder
Construct Tree from Preorder & Postorder		Construct Tree from Preorder & Postorder
Construct an array from its pair-sum array		Construct an array from its pair-sum array
Container With Most Water		Container With Most Water
Convert Array into Zig-Zag Fashion		Convert Array into Zig-Zag Fashion
Count Digit Groupings of a Number		Count Digit Groupings of a Number
Count Indices to Balance Even and Odd Sums		Count Indices to Balance Even and Odd Sums
Count Inversions		Count Inversions
Count Linked List Nodes		Count Linked List Nodes
Count More than nk Occurences		Count More than nk Occurences
Count Number of Hops		Count Number of Hops
Count Number of Substrings		Count Number of Substrings
Count Numbers Containing 4		Count Numbers Containing 4
Count Numbers Containing Specific Digits		Count Numbers Containing Specific Digits
Count Pairs Sum in Matrices		Count Pairs Sum in Matrices