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	Distance of nearest cell having 1 - GFG\distance-of-nearest-cell-having-1.cpp	23	1	1
C	k-th smallest element in BST - GFG\kth-smallest-element-in-bst.java	19	1	3
A	Shortest Path by Removing K walls - GFG\shortest-path-by-removing-k-walls.java	19	1	2
B	Distance of nearest cell having 1 - GFG\distance-of-nearest-cell-having-1.java	18	1	2
B	Topological sort - GFG\topological-sort.java	18	1	2
B	Implement two stacks in an array - GFG\implement-two-stacks-in-an-array.java	16	1	2
A	1091-shortest-path-in-binary-matrix\1091-shortest-path-in-binary-matrix.java	16	1	2
B	Reorder List - GFG\reorder-list.java	16	1	2
A	0994-rotting-oranges\0994-rotting-oranges.java	16	1	2
A	Detect cycle in a directed graph - GFG\detect-cycle-in-a-directed-graph.java	14	1	2
B	3 Divisors - GFG\3-divisors.java	14	2	2
B	Detect cycle in an undirected graph - GFG\detect-cycle-in-an-undirected-graph.java	14	1	2
A	Complement - GFG\complement.cpp	13	1	1
A	1162-as-far-from-land-as-possible\1162-as-far-from-land-as-possible.java	13	1	2
A	0010-regular-expression-matching\0010-regular-expression-matching.java	12	1	1
A	0752-open-the-lock\0752-open-the-lock.java	12	1	1
A	1926-nearest-exit-from-entrance-in-maze\1926-nearest-exit-from-entrance-in-maze.cpp	12	1	2
B	Maximum Sub Array - GFG\maximum-sub-array.java	12	1	2
C	0004-median-of-two-sorted-arrays\0004-median-of-two-sorted-arrays.java	12	1	5