Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-crystal
396
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0565.Array Nesting\Solution.go
1
-
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.go
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.go
1
-
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.ts
5
1
-
A
solution\0300-0399\0326.Power of Three\Solution.ts
1
1
-
A
solution\2300-2399\2380.Time Needed to Rearrange a Binary String\Solution.go
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.py
5
1
-
A
solution\2300-2399\2381.Shifting Letters II\Solution.cpp
5
1
-
A
solution\0500-0599\0566.Reshape the Matrix\Solution.c
4
1
-
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.cpp
7
1
-
A
solution\0500-0599\0575.Distribute Candies\Solution.go
1
-
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.go
1
-
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.java
7
1
-
A
solution\0300-0399\0366.Find Leaves of Binary Tree\Solution.java
7
1
-
A
solution\0400-0499\0434.Number of Segments in a String\Solution.go
1
-
A
solution\0500-0599\0575.Distribute Candies\Solution.java
2
1
-
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.py
1
1
-
A
solution\0500-0599\0575.Distribute Candies\Solution.py
1
1
-
A
solution\0800-0899\0864.Shortest Path to Get All Keys\Solution.go
1
-
A
solution\0400-0499\0434.Number of Segments in a String\Solution.py
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!