Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-rockstar
419
issues
2
pull requests
3,788
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.java
5
1
1
A
solution\2400-2499\2409.Count Days Spent Together\Solution.java
5
1
-
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5
1
-
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.ts
5
1
-
A
solution\0400-0499\0442.Find All Duplicates in an Array\Solution.cpp
5
1
-
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.ts
5
1
-
A
solution\0300-0399\0377.Combination Sum IV\Solution.cpp
5
1
-
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.cpp
5
1
-
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.java
5
1
-
A
solution\2200-2299\2249.Count Lattice Points Inside a Circle\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\2200-2299\2200.Find All K-Distant Indices in an Array\Solution.cpp
5
1
-
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5
1
-
A
solution\2200-2299\2250.Count Number of Rectangles Containing Each Point\Solution.cpp
5
1
-
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.cpp
5
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.java
5
1
-
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.java
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!