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\0500-0599\0501.Find Mode in Binary Search Tree\Solution.java
8
1
-
A
solution\0300-0399\0311.Sparse Matrix Multiplication\Solution.py
8
1
-
B
solution\2000-2099\2065.Maximum Path Quality of a Graph\Solution.ts
8
1
11
A
solution\0300-0399\0393.UTF-8 Validation\Solution.java
8
1
-
A
solution\0300-0399\0393.UTF-8 Validation\Solution.py
8
1
-
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.py
8
1
-
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.cpp
8
1
-
A
solution\2000-2099\2061.Number of Spaces Cleaning Robot Cleaned\Solution.cpp
8
1
-
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.java
8
1
-
A
solution\0700-0799\0767.Reorganize String\Solution.cpp
8
1
-
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.java
8
1
-
A
solution\0600-0699\0645.Set Mismatch\Solution.ts
8
1
-
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.ts
8
1
5
A
solution\0800-0899\0886.Possible Bipartition\Solution.java
8
1
-
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.py
8
1
-
A
solution\2100-2199\2115.Find All Possible Recipes from Given Supplies\Solution.java
8
1
-
A
solution\0800-0899\0886.Possible Bipartition\Solution.ts
8
1
-
A
solution\2400-2499\2426.Number of Pairs Satisfying Inequality\Solution.py
8
1
-
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.cpp
8
1
-
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.cpp
8
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!