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\2500-2599\2541.Minimum Operations to Make Array Equal II\Solution.cpp
6
1
-
A
solution\0900-0999\0904.Fruit Into Baskets\Solution.go
1
-
A
solution\2500-2599\2541.Minimum Operations to Make Array Equal II\Solution.java
6
1
-
A
solution\0600-0699\0623.Add One Row to Tree\Solution.java
5
1
-
A
solution\2500-2599\2541.Minimum Operations to Make Array Equal II\Solution.ts
5
1
-
A
solution\0900-0999\0904.Fruit Into Baskets\Solution.py
4
1
-
A
solution\2500-2599\2542.Maximum Subsequence Score\Solution.go
1
-
A
solution\0400-0499\0445.Add Two Numbers II\Solution.py
8
1
-
A
solution\2600-2699\2638.Count the Number of K-Free Subsets\Solution.py
5
1
-
A
solution\2600-2699\2638.Count the Number of K-Free Subsets\Solution.java
5
1
-
A
solution\2500-2599\2593.Find Score of an Array After Marking All Elements\Solution.cpp
7
1
-
A
solution\2500-2599\2581.Count Number of Possible Root Nodes\Solution.go
1
-
A
solution\2500-2599\2571.Minimum Operations to Reduce an Integer to 0\Solution.java
7
1
-
A
solution\2500-2599\2566.Maximum Difference by Remapping a Digit\Solution.cpp
7
1
-
A
solution\2500-2599\2548.Maximum Price to Fill a Bag\Solution.go
1
-
A
solution\0300-0399\0340.Longest Substring with At Most K Distinct Characters\Solution.java
4
1
-
A
solution\0300-0399\0383.Ransom Note\Solution.cpp
4
1
-
A
solution\0400-0499\0463.Island Perimeter\Solution.ts
10
1
-
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.cpp
5
1
-
A
solution\0900-0999\0962.Maximum Width Ramp\Solution.java
8
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!