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

  • 314 issues
  • 2 pull requests
  • 4,881 files
  • 1 active branch

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2349.Design a Number Container System\Solution.java
6 1 1
A
solution\0700-0799\0745.Prefix and Suffix Search\Solution.cpp
6 1 -
A
solution\0800-0899\0817.Linked List Components\Solution.py
6 1 -
A
solution\0800-0899\0879.Profitable Schemes\Solution.cpp
6 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.java
6 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.py
6 1 -
A
solution\0700-0799\0743.Network Delay Time\Solution.py
6 1 -
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.ts
6 1 -
A
solution\2300-2399\2328.Number of Increasing Paths in a Grid\Solution.ts
6 1 -
A
solution\0400-0499\0488.Zuma Game\Solution.py
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.cpp
6 1 -
A
solution\0400-0499\0489.Robot Room Cleaner\Solution.cpp
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.java
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.py
6 1 -
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.java
6 1 -
A
solution\0400-0499\0489.Robot Room Cleaner\Solution.java
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\0666.Path Sum IV\Solution.cpp
6 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.py
6 1 -
A
solution\0600-0699\0666.Path Sum IV\Solution.java
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.