Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-free-basic
411
issues
2
pull requests
3,781
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2250.Count Number of Rectangles Containing Each Point\Solution.py
5
1
-
A
solution\0800-0899\0856.Score of Parentheses\Solution.cpp
5
1
-
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.java
5
1
1
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.ts
5
1
2
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5
1
-
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5
1
-
A
solution\2100-2199\2176.Count Equal and Divisible Pairs in an Array\Solution.java
5
1
-
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.ts
5
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.java
5
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.cpp
5
1
-
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.cpp
5
1
-
A
solution\0200-0299\0295.Find Median from Data Stream\Solution.java
5
1
1
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.java
5
1
-
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.ts
5
1
-
A
solution\0800-0899\0866.Prime Palindrome\Solution.py
5
1
-
A
solution\0800-0899\0869.Reordered Power of 2\Solution.cpp
5
1
-
A
solution\0800-0899\0869.Reordered Power of 2\Solution.java
5
1
-
A
solution\0800-0899\0870.Advantage Shuffle\Solution.cpp
5
1
-
A
solution\0300-0399\0362.Design Hit Counter\Solution.java
5
1
1
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.cpp
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!