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

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

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2382.Maximum Segment Sum After Removals\Solution.java
10 1 -
A
solution\2100-2199\2116.Check if a Parentheses String Can Be Valid\Solution.java
10 1 -
A
solution\0600-0699\0683.K Empty Slots\Solution.cpp
10 1 -
A
solution\2300-2399\2376.Count Special Integers\Solution.cpp
10 1 -
A
solution\0900-0999\0924.Minimize Malware Spread\Solution.py
10 1 -
A
solution\0900-0999\0925.Long Pressed Name\Solution.java
10 1 -
A
solution\0700-0799\0721.Accounts Merge\Solutioin.java
10 1 1
A
solution\0600-0699\0677.Map Sum Pairs\Solution.py
10 1 -
A
solution\2100-2199\2116.Check if a Parentheses String Can Be Valid\Solution.py
10 1 -
A
solution\0300-0399\0336.Palindrome Pairs\Solution.java
10 1 -
A
solution\2400-2499\2416.Sum of Prefix Scores of Strings\Solution.cpp
10 1 -
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.java
10 1 -
A
solution\2300-2399\2382.Maximum Segment Sum After Removals\Solution.cpp
10 1 -
A
solution\0900-0999\0925.Long Pressed Name\Solution.py
10 1 -
A
solution\0400-0499\0475.Heaters\Solution.cpp
10 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.java
9 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.py
9 1 -
A
solution\0900-0999\0909.Snakes and Ladders\Solution.java
9 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.ts
9 1 -
A
solution\0900-0999\0909.Snakes and Ladders\Solution.cpp
9 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.