Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-beef
332
issues
2
pull requests
4,136
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.java
4
1
-
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.ts
4
1
-
A
solution\0300-0399\0389.Find the Difference\Solution.java
4
1
-
A
solution\0400-0499\0455.Assign Cookies\Solution.js
4
1
-
A
solution\0800-0899\0875.Koko Eating Bananas\Solution.cs
4
1
-
A
solution\0800-0899\0875.Koko Eating Bananas\Solution.java
4
1
-
A
solution\2400-2499\2428.Maximum Sum of an Hourglass\Solution.ts
4
1
-
A
solution\0400-0499\0455.Assign Cookies\Solution.ts
4
1
-
A
solution\0800-0899\0875.Koko Eating Bananas\Solution.ts
4
1
-
A
solution\0600-0699\0621.Task Scheduler\Solution.java
4
1
-
A
solution\0800-0899\0877.Stone Game\Solution.java
4
1
-
A
solution\0800-0899\0878.Nth Magical Number\Solution.cpp
4
1
-
A
solution\0300-0399\0340.Longest Substring with At Most K Distinct Characters\Solution.cpp
4
1
-
A
solution\2200-2299\2287.Rearrange Characters to Make Target String\Solution.ts
4
1
-
A
solution\2100-2199\2110.Number of Smooth Descent Periods of a Stock\Solution.cpp
4
1
-
A
solution\2100-2199\2110.Number of Smooth Descent Periods of a Stock\Solution.java
4
1
-
A
solution\0600-0699\0622.Design Circular Queue\Solution.ts
4
1
-
A
solution\2400-2499\2427.Number of Common Factors\Solution.ts
4
1
-
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.cpp
4
1
-
A
solution\2100-2199\2114.Maximum Number of Words Found in Sentences\Solution.c
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!