Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-free-basic
400
issues
2
pull requests
4,688
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.java
7
1
-
A
solution\0800-0899\0894.All Possible Full Binary Trees\Solution.java
7
1
-
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.c
7
1
-
A
solution\2300-2399\2316.Count Unreachable Pairs of Nodes in an Undirected Graph\Solution.java
7
1
-
A
solution\2300-2399\2312.Selling Pieces of Wood\Solution.java
7
1
-
A
solution\2000-2099\2054.Two Best Non-Overlapping Events\Solution.cpp
7
1
-
A
solution\2300-2399\2306.Naming a Company\Solution.cpp
7
1
-
A
solution\2000-2099\2050.Parallel Courses III\Solution.py
7
1
-
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.cpp
7
1
-
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.py
7
1
-
A
solution\2000-2099\2052.Minimum Cost to Separate Sentence Into Rows\Solution.java
7
1
-
A
solution\0300-0399\0311.Sparse Matrix Multiplication\Solution.cpp
7
1
-
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.cpp
7
1
-
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.java
7
1
-
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.cpp
7
1
-
A
solution\0400-0499\0498.Diagonal Traverse\Solution.py
7
1
-
A
solution\0300-0399\0391.Perfect Rectangle\Solution.cpp
7
1
-
A
solution\0800-0899\0882.Reachable Nodes In Subdivided Graph\Solution.cpp
7
1
-
A
solution\0600-0699\0665.Non-decreasing Array\Solution.java
7
1
-
A
solution\2200-2299\2296.Design a Text Editor\Solution.cpp
7
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!