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\0890.Find and Replace Pattern\Solution.ts
2
1
-
A
solution\0800-0899\0891.Sum of Subsequence Widths\Solution.cpp
2
1
-
A
solution\0800-0899\0891.Sum of Subsequence Widths\Solution.java
2
1
-
A
solution\0800-0899\0891.Sum of Subsequence Widths\Solution.py
2
1
-
A
solution\0600-0699\0634.Find the Derangement of An Array\Solution.cpp
2
1
-
A
solution\2300-2399\2348.Number of Zero-Filled Subarrays\Solution.ts
2
1
-
A
solution\0400-0499\0464.Can I Win\Solution.py
2
1
-
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.cs
2
1
1
A
solution\2300-2399\2335.Minimum Amount of Time to Fill Cups\Solution.py
2
1
-
A
solution\0900-0999\0908.Smallest Range I\Solution.java
2
1
-
A
solution\0900-0999\0910.Smallest Range II\Solution.cpp
2
1
-
A
solution\2300-2399\2351.First Letter to Appear Twice\Solution.ts
2
1
-
A
solution\0900-0999\0910.Smallest Range II\Solution.java
2
1
-
A
solution\0900-0999\0910.Smallest Range II\Solution.py
2
1
-
A
solution\2300-2399\2335.Minimum Amount of Time to Fill Cups\Solution.java
2
1
-
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.py
2
1
-
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.ts
2
1
-
A
solution\2300-2399\2335.Minimum Amount of Time to Fill Cups\Solution.ts
2
1
-
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.ts
2
1
-
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.py
1
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!