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

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

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2301.Match Substring After Replacement\Solution.py
6 1 -
A
solution\0800-0899\0811.Subdomain Visit Count\Solution.cpp
6 1 -
A
solution\0800-0899\0811.Subdomain Visit Count\Solution.java
6 1 -
A
solution\0800-0899\0813.Largest Sum of Averages\Solution.cpp
6 1 -
A
solution\0300-0399\0365.Water and Jug Problem\Solution.cs
6 1 -
A
solution\0800-0899\0816.Ambiguous Coordinates\Solution.ts
6 1 -
A
solution\0800-0899\0817.Linked List Components\Solution.cpp
6 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.cs
6 1 -
A
solution\2500-2599\2514.Count Anagrams\Solution.cpp
6 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.ts
6 1 -
A
solution\0800-0899\0819.Most Common Word\Solution.java
6 1 -
A
solution\2300-2399\2325.Decode the Message\Solution.c
6 1 -
A
solution\2300-2399\2328.Number of Increasing Paths in a Grid\Solution.ts
6 1 -
A
solution\0500-0599\0556.Next Greater Element III\Solution.py
6 1 -
A
solution\0800-0899\0823.Binary Trees With Factors\Solution.py
6 1 -
A
solution\2500-2599\2512.Reward Top K Students\Solution.py
6 1 -
A
solution\0300-0399\0314.Binary Tree Vertical Order Traversal\Solution.java
6 1 -
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6 1 -
A
solution\2500-2599\2513.Minimize the Maximum of Two Arrays\Solution.cpp
6 1 -
A
solution\0800-0899\0831.Masking Personal Information\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.