Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-free-basic
411
issues
2
pull requests
3,781
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.go
1
-
A
solution\2300-2399\2316.Count Unreachable Pairs of Nodes in an Undirected Graph\Solution.go
1
-
A
solution\0600-0699\0641.Design Circular Deque\Solution.go
1
-
A
solution\2000-2099\2055.Plates Between Candles\Solution.go
1
-
A
solution\0400-0499\0451.Sort Characters By Frequency\Solution.go
1
-
A
solution\2300-2399\2318.Number of Distinct Roll Sequences\Solution.go
1
-
A
solution\0300-0399\0324.Wiggle Sort II\Solution.go
1
-
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.go
1
-
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.go
1
-
A
solution\2400-2499\2468.Split Message Based on Limit\Solution.go
1
-
A
solution\2600-2699\2617.Minimum Number of Visited Cells in a Grid\Solution.go
1
-
A
solution\2600-2699\2616.Minimize the Maximum Difference of Pairs\Solution.go
1
-
A
solution\2500-2599\2565.Subsequence With the Minimum Score\Solution.go
1
-
A
solution\2500-2599\2542.Maximum Subsequence Score\Solution.go
1
-
A
solution\2500-2599\2540.Minimum Common Value\Solution.go
1
-
A
solution\2500-2599\2538.Difference Between Maximum and Minimum Price Sum\Solution.go
1
-
A
solution\2400-2499\2463.Minimum Total Distance Traveled\Solution.go
1
-
A
solution\0800-0899\0872.Leaf-Similar Trees\Solution.go
1
-
A
solution\0700-0799\0775.Global and Local Inversions\Solution.go
1
-
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.go
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!