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

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

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2453.Destroy Sequential Targets\Solution.py
6 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.cpp
6 1 -
A
solution\0800-0899\0833.Find And Replace in String\Solution.cpp
6 1 -
A
solution\2100-2199\2105.Watering Plants II\Solution.java
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\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6 1 -
A
solution\0600-0699\0672.Bulb Switcher II\Solution.cpp
6 1 -
A
solution\0600-0699\0672.Bulb Switcher II\Solution.java
6 1 -
A
solution\0600-0699\0672.Bulb Switcher II\Solution.py
6 1 -
A
solution\0900-0999\0941.Valid Mountain Array\Solution.java
6 1 -
A
solution\0900-0999\0938.Range Sum of BST\Solution.cpp
6 1 -
A
solution\0600-0699\0675.Cut Off Trees for Golf Event\Solution.py
6 1 -
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.cpp
6 1 -
A
solution\0700-0799\0768.Max Chunks To Make Sorted II\Solution.ts
6 1 -
A
solution\0700-0799\0768.Max Chunks To Make Sorted II\Solution.java
6 1 -
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.java
6 1 -
A
solution\0600-0699\0680.Valid Palindrome II\Solution.cpp
6 1 -
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.py
6 1 -
A
solution\0600-0699\0682.Baseball Game\Solution.cpp
6 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.