Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode
1,317
issues
0
pull requests
4,781
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\1800-1899\1890.The Latest Login in 2020\Solution.sql
1
-
A
solution\1800-1899\1889.Minimum Space Wasted From Packaging\Solution.ts
11
1
5
A
solution\1800-1899\1889.Minimum Space Wasted From Packaging\Solution.py
5
1
-
A
solution\1800-1899\1889.Minimum Space Wasted From Packaging\Solution.java
9
1
-
A
solution\1800-1899\1888.Minimum Number of Flips to Make the Binary String Alternating\Solution.ts
6
1
1
A
solution\1800-1899\1888.Minimum Number of Flips to Make the Binary String Alternating\Solution.py
3
1
-
A
solution\1800-1899\1888.Minimum Number of Flips to Make the Binary String Alternating\Solution.java
6
1
-
A
solution\1800-1899\1887.Reduction Operations to Make the Array Elements Equal\Solution.ts
4
1
2
A
solution\1800-1899\1887.Reduction Operations to Make the Array Elements Equal\Solution.py
3
1
-
A
solution\1800-1899\1887.Reduction Operations to Make the Array Elements Equal\Solution.java
3
1
-
A
solution\1800-1899\1887.Reduction Operations to Make the Array Elements Equal\Solution.go
1
-
A
solution\1800-1899\1887.Reduction Operations to Make the Array Elements Equal\Solution.cpp
3
1
-
A
solution\1800-1899\1886.Determine Whether Matrix Can Be Obtained By Rotation\Solution.py
3
1
-
A
solution\1800-1899\1886.Determine Whether Matrix Can Be Obtained By Rotation\Solution.java
10
1
-
A
solution\1800-1899\1883.Minimum Skips to Arrive at Meeting On Time\Solution.py
8
1
-
A
solution\1800-1899\1883.Minimum Skips to Arrive at Meeting On Time\Solution.java
9
1
-
A
solution\1800-1899\1882.Process Tasks Using Servers\Solution.py
6
1
-
A
solution\1800-1899\1882.Process Tasks Using Servers\Solution.java
9
1
-
A
solution\1800-1899\1881.Maximum Value after Insertion\Solution.py
8
1
-
A
solution\1800-1899\1881.Maximum Value after Insertion\Solution.js
4
1
1
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!