Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-ion
378
issues
2
pull requests
3,911
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.java
4
1
-
A
solution\0600-0699\0611.Valid Triangle Number\Solution.java
4
1
-
A
solution\0600-0699\0611.Valid Triangle Number\Solution.ts
4
1
-
A
solution\0300-0399\0387.First Unique Character in a String\Solution.java
4
1
-
A
solution\0800-0899\0841.Keys and Rooms\Solution.java
4
1
-
A
solution\0600-0699\0621.Task Scheduler\Solution.java
4
1
-
A
solution\2100-2199\2195.Append K Integers With Minimal Sum\Solution.py
4
1
-
A
solution\0400-0499\0455.Assign Cookies\Solution.js
4
1
-
A
solution\0400-0499\0455.Assign Cookies\Solution.ts
4
1
-
A
solution\0600-0699\0622.Design Circular Queue\Solution.ts
4
1
-
A
solution\2300-2399\2342.Max Sum of a Pair With Equal Sum of Digits\Solution.java
4
1
-
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.ts
4
1
-
A
solution\2100-2199\2133.Check if Every Row and Column Contains All Numbers\Solution.ts
4
1
-
A
solution\2400-2499\2412.Minimum Money Required Before Transactions\Solution.java
4
1
-
A
solution\2400-2499\2444.Count Subarrays With Fixed Bounds\Solution.ts
4
1
-
A
solution\0800-0899\0856.Score of Parentheses\Solution.java
4
1
-
A
solution\2500-2599\2515.Shortest Distance to Target String in a Circular Array\Solution.java
4
1
-
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.java
4
1
-
A
solution\2300-2399\2342.Max Sum of a Pair With Equal Sum of Digits\Solution.py
4
1
-
A
solution\2200-2299\2243.Calculate Digit Sum of a String\Solution.java
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!