Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-free-basic
402
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.ts
6
1
-
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.cs
6
1
-
A
solution\0600-0699\0650.2 Keys Keyboard\Solution.cpp
6
1
-
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.py
6
1
-
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.java
6
1
-
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.java
6
1
-
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.java
6
1
-
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.cpp
6
1
-
A
solution\0800-0899\0894.All Possible Full Binary Trees\Solution.cpp
6
1
-
A
solution\0800-0899\0896.Monotonic Array\Solution.cpp
6
1
-
A
solution\2100-2199\2105.Watering Plants II\Solution.py
6
1
-
A
solution\0700-0799\0757.Set Intersection Size At Least Two\Solution.cpp
6
1
-
A
solution\0800-0899\0896.Monotonic Array\Solution.java
6
1
-
A
solution\0800-0899\0847.Shortest Path Visiting All Nodes\Solution.cpp
6
1
-
A
solution\0700-0799\0734.Sentence Similarity\Solution.py
6
1
-
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.java
6
1
-
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.py
6
1
-
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.py
6
1
-
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.py
6
1
-
A
solution\0800-0899\0892.Surface Area of 3D Shapes\Solution.cpp
6
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!