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

  • 413 issues
  • 2 pull requests
  • 3,677 files
  • 1 active branch

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2417.Closest Fair Integer\Solution.py
6 1 -
A
solution\0300-0399\0379.Design Phone Directory\Solution.py
6 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.cpp
6 1 2
A
solution\2200-2299\2245.Maximum Trailing Zeros in a Cornered Path\Solution.ts
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.cpp
6 1 -
A
solution\0400-0499\0467.Unique Substrings in Wraparound String\Solution.cpp
6 1 -
A
solution\2400-2499\2403.Minimum Time to Kill All Monsters\Solution.cpp
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.java
6 1 -
A
solution\0800-0899\0873.Length of Longest Fibonacci Subsequence\Solution.js
6 1 -
A
solution\0600-0699\0666.Path Sum IV\Solution.cpp
6 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.java
6 1 1
A
solution\0600-0699\0666.Path Sum IV\Solution.java
6 1 -
A
solution\2400-2499\2403.Minimum Time to Kill All Monsters\Solution.java
6 1 -
A
solution\0900-0999\0930.Binary Subarrays With Sum\Solution.java
6 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.py
6 1 -
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.cpp
6 1 -
A
solution\2400-2499\2403.Minimum Time to Kill All Monsters\Solution.ts
6 1 -
A
solution\0600-0699\0670.Maximum Swap\Solution.java
6 1 -
A
solution\0600-0699\0670.Maximum Swap\Solution.ts
6 1 -
A
solution\0600-0699\0672.Bulb Switcher II\Solution.cpp
6 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.