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

  • 332 issues
  • 2 pull requests
  • 4,136 files
  • 1 active branch

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0789.Escape The Ghosts\Solution.cpp
3 1 -
A
solution\0500-0599\0554.Brick Wall\Solution.java
3 1 -
A
solution\0400-0499\0435.Non-overlapping Intervals\Solution.java
3 1 -
A
solution\0400-0499\0435.Non-overlapping Intervals\Solution.ts
3 1 -
A
solution\0700-0799\0795.Number of Subarrays with Bounded Maximum\Solution.cpp
3 1 -
A
solution\2500-2599\2548.Maximum Price to Fill a Bag\Solution.cpp
3 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.c
3 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.cpp
3 1 -
A
solution\0700-0799\0799.Champagne Tower\Solution.ts
3 1 -
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.ts
3 1 -
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.py
3 1 -
A
solution\0400-0499\0437.Path Sum III\Solution.java
3 1 -
A
solution\2500-2599\2542.Maximum Subsequence Score\Solution.py
3 1 -
A
solution\0800-0899\0804.Unique Morse Code Words\Solution.cpp
3 1 -
A
solution\0800-0899\0804.Unique Morse Code Words\Solution.java
3 1 -
A
solution\0800-0899\0804.Unique Morse Code Words\Solution.py
3 1 -
A
solution\2500-2599\2548.Maximum Price to Fill a Bag\Solution.java
3 1 -
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.ts
3 1 -
A
solution\0500-0599\0563.Binary Tree Tilt\Solution.cpp
3 1 -
A
solution\0800-0899\0806.Number of Lines To Write String\Solution.java
3 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.