• 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\2100-2199\2195.Append K Integers With Minimal Sum\Solution.py
4 1 -
A
solution\0700-0799\0752.Open the Lock\Solution.py
3 1 -
A
solution\2100-2199\2196.Create Binary Tree From Descriptions\Solution.go
1 -
A
solution\0500-0599\0533.Lonely Pixel II\Solution.py
15 1 -
A
solution\2100-2199\2196.Create Binary Tree From Descriptions\Solution.py
7 1 -
A
solution\0700-0799\0753.Cracking the Safe\Solution.go
1 -
A
solution\2100-2199\2198.Number of Single Divisor Triplets\Solution.cpp
10 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.go
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 -
A
solution\0400-0499\0451.Sort Characters By Frequency\Solution.cpp
0 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.