Algo-Sanket/Leetcode

main

Leetcode

Grade	Name	Complexity	Churn	Issues
B	Check if it is possible to convert one string into another with given constraints - GFG\check-if-it-is-possible-to-convert-one-string-into-another-with-given-constraints.java	24	1	3
A	Check if it is possible to survive on Island - GFG\check-if-it-is-possible-to-survive-on-island.cpp	5	1	-
A	Check if two arrays are equal or not - GFG\check-if-two-arrays-are-equal-or-not.java	11	1	2
A	Complement - GFG\complement.cpp	13	1	1
A	Count pairs with given sum - GFG\count-pairs-with-given-sum.java	6	1	2
B	Count the Number of Full Binary Trees - GFG\count-the-number-of-full-binary-trees.java	12	1	2
A	DFS of Graph - GFG\dfs-of-graph.java	11	1	2
A	Detect cycle in a directed graph - GFG\detect-cycle-in-a-directed-graph.java	14	1	2
B	Detect cycle in an undirected graph - GFG\detect-cycle-in-an-undirected-graph.java	14	1	2
A	Distance of nearest cell having 1 - GFG\distance-of-nearest-cell-having-1.cpp	23	1	1
B	Distance of nearest cell having 1 - GFG\distance-of-nearest-cell-having-1.java	18	1	2
B	Find Transition Point - GFG\find-transition-point.java	10	2	2
B	Implement two stacks in an array - GFG\implement-two-stacks-in-an-array.java	16	1	2
A	Isomorphic Strings - GFG\isomorphic-strings.java	7	1	2
A	Knapsack with Duplicate Items - GFG\knapsack-with-duplicate-items.java	8	1	2
A	Magic Triplets - GFG\magic-triplets.java	9	1	2
B	Maximum Sub Array - GFG\maximum-sub-array.java	12	1	2
A	Missing number in array - GFG\missing-number-in-array.java	6	1	2
A	Number of occurrence - GFG\number-of-occurrence.java	6	1	2
A	Rearrange Array Alternately - GFG\rearrange-array-alternately.cpp	8	1	2