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

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

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0366.Find Leaves of Binary Tree\Solution.go
1 -
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.java
4 1 -
A
solution\0700-0799\0741.Cherry Pickup\Solution.py
15 1 -
A
solution\2100-2199\2170.Minimum Operations to Make the Array Alternating\Solution.go
1 -
A
solution\2100-2199\2170.Minimum Operations to Make the Array Alternating\Solution.py
4 1 -
A
solution\0700-0799\0742.Closest Leaf in a Binary Tree\Solution.go
1 -
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.cpp
2 1 -
A
solution\0400-0499\0417.Pacific Atlantic Water Flow\Solution.py
11 1 -
A
solution\0800-0899\0855.Exam Room\Solution.cpp
0 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.go
1 -
A
solution\0800-0899\0855.Exam Room\Solution.go
1 -
A
solution\0300-0399\0326.Power of Three\Solution.py
2 1 -
A
solution\0300-0399\0343.Integer Break\Solution.py
4 1 -
A
solution\0400-0499\0450.Delete Node in a BST\Solution.ts
13 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.java
4 1 -
A
solution\0800-0899\0855.Exam Room\Solution.py
7 1 -
A
solution\0800-0899\0856.Score of Parentheses\Solution.cpp
0 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.py
4 1 -
A
solution\0800-0899\0856.Score of Parentheses\Solution.go
1 -
A
solution\0800-0899\0856.Score of Parentheses\Solution.java
4 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.