Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-modula
407
issues
2
pull requests
3,756
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.ts
5
1
-
A
solution\0300-0399\0377.Combination Sum IV\Solution.cpp
5
1
-
A
solution\0400-0499\0440.K-th Smallest in Lexicographical Order\Solution.java
5
1
-
A
solution\2000-2099\2053.Kth Distinct String in an Array\Solution.java
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.cpp
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.java
5
1
-
A
solution\0400-0499\0442.Find All Duplicates in an Array\Solution.cpp
5
1
-
A
solution\2200-2299\2256.Minimum Average Difference\Solution.cpp
5
1
-
A
solution\0800-0899\0851.Loud and Rich\Solution.ts
5
1
-
A
solution\0800-0899\0856.Score of Parentheses\Solution.cpp
5
1
-
A
solution\2200-2299\2256.Minimum Average Difference\Solution.java
5
1
-
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.java
5
1
1
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.cpp
5
1
-
A
solution\2200-2299\2249.Count Lattice Points Inside a Circle\Solution.ts
5
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.java
5
1
-
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.ts
5
1
-
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.ts
5
1
-
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5
1
-
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5
1
-
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.cpp
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!