• Features
  • Pricing
  • Contact
    Login with:
  • Features
  • Pricing
  • Contact
Login with:
main
leetcode-lua
Repository badge with A rating
View on GitHub

  • 351 issues
  • 2 pull requests
  • 4,220 files
  • 1 active branch

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.go
1 -
A
solution\0400-0499\0443.String Compression\Solution.go
1 -
A
solution\0300-0399\0385.Mini Parser\Solution.go
1 -
A
solution\0600-0699\0604.Design Compressed String Iterator\Solution.go
1 -
A
solution\0300-0399\0329.Longest Increasing Path in a Matrix\Solution.go
1 -
A
solution\0400-0499\0460.LFU Cache\Solution.go
1 -
A
solution\0300-0399\0325.Maximum Size Subarray Sum Equals k\Solution.go
1 -
A
solution\0500-0599\0522.Longest Uncommon Subsequence II\Solution.go
1 -
A
solution\0400-0499\0410.Split Array Largest Sum\Solution.go
1 -
A
solution\0400-0499\0467.Unique Substrings in Wraparound String\Solution.go
1 -
A
solution\0300-0399\0358.Rearrange String k Distance Apart\Solution.go
1 -
A
solution\0500-0599\0523.Continuous Subarray Sum\Solution.go
1 -
A
solution\0600-0699\0609.Find Duplicate File in System\Solution.go
1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.go
1 -
A
solution\0500-0599\0587.Erect the Fence\Solution.go
1 -
A
solution\0500-0599\0575.Distribute Candies\Solution.go
1 -
A
solution\0500-0599\0559.Maximum Depth of N-ary Tree\Solution.go
1 -
A
solution\0500-0599\0510.Inorder Successor in BST II\Solution.go
1 -
A
solution\0400-0499\0445.Add Two Numbers II\Solution.go
1 -
A
solution\0300-0399\0327.Count of Range Sum\Solution.go
1 -
  • Previous Page
  • Next Page
  • Security
  • Terms
  • Privacy
  • Contact
© 2026 CodeFactor

We use cookies in order to offer you the most relevant information. See our Privacy Policy.