Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-lol-code
362
issues
2
pull requests
4,750
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0623.Add One Row to Tree\Solution.java
5
1
-
A
solution\2100-2199\2187.Minimum Time to Complete Trips\Solution.cpp
5
1
-
A
solution\0800-0899\0877.Stone Game\Solution.py
5
1
-
A
solution\2100-2199\2187.Minimum Time to Complete Trips\Solution.java
5
1
-
A
solution\2300-2399\2373.Largest Local Values in a Matrix\Solution.cpp
5
1
-
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.py
5
1
-
A
solution\0800-0899\0878.Nth Magical Number\Solution.java
5
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.py
5
1
-
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.py
5
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.java
5
1
-
A
solution\0800-0899\0884.Uncommon Words from Two Sentences\Solution.java
5
1
-
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.java
5
1
-
A
solution\0900-0999\0938.Range Sum of BST\Solution.java
5
1
-
A
solution\2300-2399\2363.Merge Similar Items\Solution.cpp
5
1
-
A
solution\0900-0999\0935.Knight Dialer\Solution.java
5
1
-
A
solution\0800-0899\0886.Possible Bipartition\Solution.py
5
1
-
A
solution\0800-0899\0888.Fair Candy Swap\Solution.java
5
1
-
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.cpp
5
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.cpp
5
1
-
A
solution\2300-2399\2363.Merge Similar Items\Solution.java
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!