main
leetcode-dart
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\1000-1099\1002.Find Common Characters\Solution.java
6 1 -
A
solution\1000-1099\1002.Find Common Characters\Solution.ts
5 1 -
A
solution\0300-0399\0396.Rotate Function\Solution.java
3 1 -
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.cpp
6 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.js
3 1 -
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.cpp
0 1 -
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.go
 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.ts
3 1 -
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.java
7 1 -
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.go
 1 -
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.go
 1 -
A
solution\0600-0699\0688.Knight Probability in Chessboard\Solution.cpp
11 1 -
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.java
5 1 -
A
solution\0600-0699\0688.Knight Probability in Chessboard\Solution.go
 1 -
A
solution\1000-1099\1005.Maximize Sum Of Array After K Negations\Solution.cpp
10 1 -
A
solution\0300-0399\0322.Coin Change\Solution.go
 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.java
5 1 -
A
solution\0300-0399\0397.Integer Replacement\Solution.cpp
6 1 -
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.java
6 1 -
A
solution\0600-0699\0688.Knight Probability in Chessboard\Solution.java
10 1 -