Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-scheme
407
issues
2
pull requests
4,052
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0718.Maximum Length of Repeated Subarray\Solution.js
3
1
-
A
solution\0700-0799\0718.Maximum Length of Repeated Subarray\Solution.ts
3
1
-
A
solution\2400-2499\2466.Count Ways To Build Good Strings\Solution.cpp
3
1
-
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.cpp
3
1
-
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.ts
3
1
-
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.ts
3
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3
1
-
A
solution\0500-0599\0503.Next Greater Element II\Solution.js
3
1
-
A
solution\0500-0599\0503.Next Greater Element II\Solution.ts
3
1
-
A
solution\2000-2099\2089.Find Target Indices After Sorting Array\Solution.cpp
3
1
-
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.py
3
1
-
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.java
3
1
-
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.cpp
3
1
-
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.ts
3
1
-
A
solution\0500-0599\0508.Most Frequent Subtree Sum\Solution.py
3
1
-
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.java
3
1
-
A
solution\2000-2099\2071.Maximum Number of Tasks You Can Assign\Solution.py
3
1
-
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.c
3
1
-
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.cpp
3
1
-
A
solution\2300-2399\2350.Shortest Impossible Sequence of Rolls\Solution.java
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!