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\0800-0899\0888.Fair Candy Swap\Solution.cpp
3
1
-
A
solution\0500-0599\0520.Detect Capital\Solution.cpp
3
1
-
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.java
3
1
-
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.cpp
3
1
-
A
solution\2300-2399\2357.Make Array Zero by Subtracting Equal Amounts\Solution.c
3
1
-
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.java
3
1
-
A
solution\0800-0899\0887.Super Egg Drop\Solution.java
3
1
-
A
solution\0800-0899\0888.Fair Candy Swap\Solution.py
3
1
-
A
solution\0900-0999\0923.3Sum With Multiplicity\Solution.py
3
1
-
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.ts
3
1
-
A
solution\2300-2399\2351.First Letter to Appear Twice\Solution.java
3
1
-
A
solution\0900-0999\0905.Sort Array By Parity\Solution.java
3
1
-
A
solution\0900-0999\0961.N-Repeated Element in Size 2N Array\Solution.cpp
3
1
-
A
solution\0300-0399\0370.Range Addition\Solution.js
3
1
-
A
solution\2300-2399\2350.Shortest Impossible Sequence of Rolls\Solution.java
3
1
-
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.cpp
3
1
-
A
solution\0900-0999\0961.N-Repeated Element in Size 2N Array\Solution.java
3
1
-
A
solution\2300-2399\2348.Number of Zero-Filled Subarrays\Solution.py
3
1
-
A
solution\0900-0999\0902.Numbers At Most N Given Digit Set\Solution.py
3
1
1
A
solution\2300-2399\2348.Number of Zero-Filled Subarrays\Solution.java
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!