Algo-Sanket/Leetcode

main

Leetcode

Grade	Name	Complexity	Churn	Issues
B	Build the smallest - GFG\build-the-smallest.cpp	9	1	10
C	0004-median-of-two-sorted-arrays\0004-median-of-two-sorted-arrays.java	12	1	5
C	k-th smallest element in BST - GFG\kth-smallest-element-in-bst.java	19	1	3
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
B	Taxi Booking - GFG\taxi-booking.java	10	1	3
A	DFS of Graph - GFG\dfs-of-graph.java	11	1	2
B	Distance of nearest cell having 1 - GFG\distance-of-nearest-cell-having-1.java	18	1	2
B	Count the Number of Full Binary Trees - GFG\count-the-number-of-full-binary-trees.java	12	1	2
B	Find Transition Point - GFG\find-transition-point.java	10	2	2
A	Count pairs with given sum - GFG\count-pairs-with-given-sum.java	6	1	2
A	Check if two arrays are equal or not - GFG\check-if-two-arrays-are-equal-or-not.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
B	3 Divisors - GFG\3-divisors.java	14	2	2
A	Add Binary Strings - GFG\add-binary-strings.java	12	1	2
A	1926-nearest-exit-from-entrance-in-maze\1926-nearest-exit-from-entrance-in-maze.cpp	12	1	2
A	1091-shortest-path-in-binary-matrix\1091-shortest-path-in-binary-matrix.java	16	1	2
A	Isomorphic Strings - GFG\isomorphic-strings.java	7	1	2
B	Implement two stacks in an array - GFG\implement-two-stacks-in-an-array.java	16	1	2
A	Aggressive Cows - GFG\aggressive-cows.java	9	1	2