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

  • 404 issues
  • 2 pull requests
  • 4,998 files
  • 1 active branch

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0300.Longest Increasing Subsequence\Solution.go
1 -
A
solution\0900-0999\0921.Minimum Add to Make Parentheses Valid\Solution.go
1 -
A
solution\0800-0899\0846.Hand of Straights\Solution.go
1 -
A
solution\0800-0899\0847.Shortest Path Visiting All Nodes\Solution.go
1 -
A
solution\0500-0599\0500.Keyboard Row\Solution.go
1 -
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.go
1 -
A
solution\0400-0499\0451.Sort Characters By Frequency\Solution.go
1 -
A
solution\0600-0699\0648.Replace Words\Solution.go
1 -
A
solution\0500-0599\0557.Reverse Words in a String III\Solution.go
1 -
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.go
1 -
A
solution\0900-0999\0939.Minimum Area Rectangle\Solution.go
1 -
A
solution\0900-0999\0939.Minimum Area Rectangle\Solution.cpp
0 1 -
A
solution\0900-0999\0908.Smallest Range I\Solution.ts
1 -
A
solution\0800-0899\0894.All Possible Full Binary Trees\Solution.go
1 -
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.cpp
0 1 -
A
solution\0800-0899\0884.Uncommon Words from Two Sentences\Solution.cpp
0 1 -
A
solution\0700-0799\0790.Domino and Tromino Tiling\Solution.go
1 -
A
solution\0700-0799\0787.Cheapest Flights Within K Stops\Solution.go
1 -
A
solution\0600-0699\0673.Number of Longest Increasing Subsequence\Solution.go
1 -
A
solution\0500-0599\0576.Out of Boundary Paths\Solution.go
1 -
  • Previous Page
  • Next Page
  • Security
  • Terms
  • Privacy
  • Contact
© 2025 CodeFactor

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