Skip to content

Sandip-Kanzariya/GFG-LeetCode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

861 Commits
0034-find-first-and-last-position-of-element-in-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
 
 
0119-pascals-triangle-ii
0119-pascals-triangle-ii
 
 
0326-power-of-three
0326-power-of-three
 
 
0342-power-of-four
0342-power-of-four
 
 
0501-find-mode-in-binary-search-tree
0501-find-mode-in-binary-search-tree
 
 
0747-min-cost-climbing-stairs
0747-min-cost-climbing-stairs
 
 
0795-k-th-symbol-in-grammar
0795-k-th-symbol-in-grammar
 
 
0874-backspace-string-compare
0874-backspace-string-compare
 
 
1275-validate-binary-tree-nodes
1275-validate-binary-tree-nodes
 
 
1458-sort-integers-by-the-number-of-1-bits
1458-sort-integers-by-the-number-of-1-bits
 
 
1552-build-an-array-with-stack-operations
1552-build-an-array-with-stack-operations
 
 
2347-count-nodes-equal-to-average-of-subtree
2347-count-nodes-equal-to-average-of-subtree
 
 
2519-find-the-original-array-of-prefix-xor
2519-find-the-original-array-of-prefix-xor
 
 
BFS of graph - GFG
BFS of graph - GFG
 
 
Basic
Basic
 
 
Bleak Numbers - GFG
Bleak Numbers - GFG
 
 
Boolean Matrix - GFG
Boolean Matrix - GFG
 
 
Boundary traversal of matrix - GFG
Boundary traversal of matrix - GFG
 
 
Check an Integer is power of 3 or not - GFG
Check an Integer is power of 3 or not - GFG
 
 
Check for Balanced Tree - GFG
Check for Balanced Tree - GFG
 
 
Check if Tree is Isomorphic - GFG
Check if Tree is Isomorphic - GFG
 
 
Check whether K-th bit is set or not - GFG
Check whether K-th bit is set or not - GFG
 
 
Convert array into Zig-Zag fashion - GFG
Convert array into Zig-Zag fashion - GFG
 
 
Count number of hops - GFG
Count number of hops - GFG
 
 
Count number of substrings - GFG
Count number of substrings - GFG
 
 
Delete a Node in Single Linked List - GFG
Delete a Node in Single Linked List - GFG
 
 
Difficulty: Basic
Difficulty: Basic
 
 
Difficulty: Easy
Difficulty: Easy
 
 
Difficulty: Hard
Difficulty: Hard
 
 
Difficulty: Medium
Difficulty: Medium
 
 
Difficulty: School
Difficulty: School
 
 
Duplicate subtree in Binary Tree - GFG
Duplicate subtree in Binary Tree - GFG
 
 
Easy
Easy
 
 
Equilibrium Point - GFG
Equilibrium Point - GFG
 
 
Eventual Safe States - GFG
Eventual Safe States - GFG
 
 
Find All Four Sum Numbers - GFG
Find All Four Sum Numbers - GFG
 
 
Find Common Nodes in two BSTs - GFG
Find Common Nodes in two BSTs - GFG
 
 
Find duplicates in an array - GFG
Find duplicates in an array - GFG
 
 
Find first set bit - GFG
Find first set bit - GFG
 
 
Find position of set bit - GFG
Find position of set bit - GFG
 
 
Find the string in grid - GFG
Find the string in grid - GFG
 
 
Floor in BST - GFG
Floor in BST - GFG
 
 
Form a number divisible by 3 using array digits - GFG
Form a number divisible by 3 using array digits - GFG
 
 
Hard
Hard
 
 
Height of Binary Tree - GFG
Height of Binary Tree - GFG
 
 
Insert a node in a BST - GFG
Insert a node in a BST - GFG
 
 
Insert in a Sorted List - GFG
Insert in a Sorted List - GFG
 
 
Knapsack with Duplicate Items - GFG
Knapsack with Duplicate Items - GFG
 
 
Kth largest element in BST - GFG
Kth largest element in BST - GFG
 
 
Largest number possible - GFG
Largest number possible - GFG
 
 
Leaf under budget - GFG
Leaf under budget - GFG
 
 
Leftmost and rightmost nodes of binary tree - GFG
Leftmost and rightmost nodes of binary tree - GFG
 
 
Level of Nodes - GFG
Level of Nodes - GFG
 
 
Longest K unique characters substring - GFG
Longest K unique characters substring - GFG
 
 
Lucky Numbers - GFG
Lucky Numbers - GFG
 
 
Make Matrix Beautiful - GFG
Make Matrix Beautiful - GFG
 
 
Making A Large Island - GFG
Making A Large Island - GFG
 
 
Maximum sum increasing subsequence - GFG
Maximum sum increasing subsequence - GFG
 
 
Medium
Medium
 
 
Minimum Deletions - GFG
Minimum Deletions - GFG
 
 
Minimum Multiplications to reach End - GFG
Minimum Multiplications to reach End - GFG
 
 
Minimum Operations - GFG
Minimum Operations - GFG
 
 
Multiply two strings - GFG
Multiply two strings - GFG
 
 
Number Of Enclaves - GFG
Number Of Enclaves - GFG
 
 
Number of occurrence - GFG
Number of occurrence - GFG
 
 
Palindrome String - GFG
Palindrome String - GFG
 
 
Palindromic Partitioning - GFG
Palindromic Partitioning - GFG
 
 
Perfect Numbers - GFG
Perfect Numbers - GFG
 
 
Perfect Sum Problem - GFG
Perfect Sum Problem - GFG
 
 
Power of 2 - GFG
Power of 2 - GFG
 
 
Print BST elements in given range - GFG
Print BST elements in given range - GFG
 
 
Print first n Fibonacci Numbers - GFG
Print first n Fibonacci Numbers - GFG
 
 
Remove duplicate element from sorted Linked List - GFG
Remove duplicate element from sorted Linked List - GFG
 
 
Replace O's with X's - GFG
Replace O's with X's - GFG
 
 
Reverse a String - GFG
Reverse a String - GFG
 
 
Roman Number to Integer - GFG
Roman Number to Integer - GFG
 
 
School
School
 
 
Stickler Thief - GFG
Stickler Thief - GFG
 
 
Sum of XOR of all pairs - GFG
Sum of XOR of all pairs - GFG
 
 
Sum of all divisors from 1 to n - GFG
Sum of all divisors from 1 to n - GFG
 
 
Surround the 1's - GFG
Surround the 1's - GFG
 
 
Transitive closure of a Graph - GFG
Transitive closure of a Graph - GFG
 
 
Wave Array - GFG
Wave Array - GFG
 
 
README.md
README.md
 
 

Repository files navigation

GFG

Solution Of GFG Questions

Tree

Question Problem
Height of Binary Tree GFG
Balanced Binary Tree GFG, LeetCode

Level Ordered Travesal in BT : BFS

Question Problem
Level Ordered travesal
Find level of each Leaf node GFG
Left most and right most node in each level of BT GFG, LeetCode

Graph

BFS

Question Problem
Minimum Multiplication to Reach End

DFS on Grid

Question Problem
GFG
Floyd Warshall Transitive closure of a Graph GFG
Topological GFG

About

Solution Of GFG & LeetCode Questions

Topics

leetcode-solutions gfg-potd

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages