Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-lol-code
364
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2405.Optimal Partition of String\Solution.ts
2
1
-
A
solution\0900-0999\0910.Smallest Range II\Solution.py
2
1
-
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.cpp
2
1
-
A
solution\0900-0999\0992.Subarrays with K Different Integers\Solution.py
2
1
-
A
solution\0900-0999\0993.Cousins in Binary Tree\Solution.py
2
1
-
A
solution\2400-2499\2401.Longest Nice Subarray\Solution.ts
2
1
-
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.py
2
1
-
A
solution\0900-0999\0910.Smallest Range II\Solution.cpp
2
1
-
A
solution\2300-2399\2395.Find Subarrays With Equal Sum\Solution.ts
2
1
-
A
solution\0700-0799\0746.Min Cost Climbing Stairs\Solution.cpp
2
1
-
A
solution\0700-0799\0746.Min Cost Climbing Stairs\Solution.java
2
1
-
A
solution\0700-0799\0771.Jewels and Stones\Solution.py
2
1
-
A
solution\0700-0799\0746.Min Cost Climbing Stairs\Solution.py
2
1
-
A
solution\0900-0999\0908.Smallest Range I\Solution.java
2
1
-
A
solution\0700-0799\0796.Rotate String\Solution.py
2
1
-
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.py
2
1
-
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.ts
2
1
-
A
solution\2100-2199\2160.Minimum Sum of Four Digit Number After Splitting Digits\Solution.java
2
1
-
A
solution\2100-2199\2160.Minimum Sum of Four Digit Number After Splitting Digits\Solution.cpp
2
1
-
A
solution\0700-0799\0756.Pyramid Transition Matrix\Solution.py
2
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!