main
leetcode
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2067.Number of Equal Count Substrings\Solution.go
 1 -
A
solution\2000-2099\2067.Number of Equal Count Substrings\Solution.cpp
11 1 -
B
solution\2000-2099\2065.Maximum Path Quality of a Graph\Solution.ts
8 1 11
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.ts
4 1 2
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.py
4 1 -
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.java
4 1 -
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.go
 1 -
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.cpp
5 1 -
A
solution\2000-2099\2063.Vowels of All Substrings\Solution.ts
3 1 2
A
solution\2000-2099\2063.Vowels of All Substrings\Solution.py
3 1 -
A
solution\2000-2099\2063.Vowels of All Substrings\Solution.java
7 1 -
A
solution\2000-2099\2063.Vowels of All Substrings\Solution.go
 1 -
A
solution\2000-2099\2063.Vowels of All Substrings\Solution.cpp
7 1 -
A
solution\2000-2099\2062.Count Vowel Substrings of a String\Solution.ts
7 1 2
A
solution\2000-2099\2060.Check if an Original String Exists Given Two Encoded Strings\Solution.ts
23 1 6
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.ts
11 1 5
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.py
7 2 -
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.java
8 1 -
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.go
 1 -
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.cpp
8 1 -