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\0600-0699\0605.Can Place Flowers\Solution.cpp
5
1
-
A
solution\0800-0899\0888.Fair Candy Swap\Solution.java
5
1
-
A
solution\0400-0499\0442.Find All Duplicates in an Array\Solution.cpp
5
1
-
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.cpp
5
1
-
A
solution\0600-0699\0605.Can Place Flowers\Solution.java
5
1
-
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.py
5
1
-
A
solution\2200-2299\2256.Minimum Average Difference\Solution.cpp
5
1
-
A
solution\2200-2299\2250.Count Number of Rectangles Containing Each Point\Solution.py
5
1
-
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.cpp
5
1
-
A
solution\0600-0699\0606.Construct String from Binary Tree\Solution.java
5
1
-
A
solution\0900-0999\0969.Pancake Sorting\Solution.ts
5
1
-
A
solution\0600-0699\0609.Find Duplicate File in System\Solution.java
5
1
-
A
solution\0800-0899\0893.Groups of Special-Equivalent Strings\Solution.cpp
5
1
-
A
solution\0900-0999\0970.Powerful Integers\Solution.js
5
1
-
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.ts
5
1
-
A
solution\2200-2299\2256.Minimum Average Difference\Solution.java
5
1
-
A
solution\0800-0899\0896.Monotonic Array\Solution.js
5
1
-
A
solution\0800-0899\0896.Monotonic Array\Solution.ts
5
1
-
A
solution\2200-2299\2244.Minimum Rounds to Complete All Tasks\Soluttion.ts
5
1
-
A
solution\2200-2299\2244.Minimum Rounds to Complete All Tasks\Solution.java
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!