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

  • 349 issues
  • 2 pull requests
  • 4,113 files
  • 1 active branch

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0801.Minimum Swaps To Make Sequences Increasing\Solution.cpp
7 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.c
7 1 -
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.cpp
7 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.cpp
7 1 -
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.java
7 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.java
7 1 -
A
solution\0800-0899\0808.Soup Servings\Solution.cpp
7 1 -
A
solution\2400-2499\2460.Apply Operations to an Array\Solution.java
7 1 -
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.cpp
7 1 -
A
solution\0800-0899\0813.Largest Sum of Averages\Solution.java
7 1 -
A
solution\2500-2599\2571.Minimum Operations to Reduce an Integer to 0\Solution.py
7 1 -
A
solution\2500-2599\2571.Minimum Operations to Reduce an Integer to 0\Solution.java
7 1 -
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.java
7 1 -
A
solution\2300-2399\2347.Best Poker Hand\Solution.cpp
7 1 -
A
solution\0800-0899\0816.Ambiguous Coordinates\Solution.cpp
7 1 -
A
solution\2300-2399\2352.Equal Row and Column Pairs\Solution.java
7 1 -
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.ts
7 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.ts
7 1 -
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.ts
7 1 -
A
solution\0400-0499\0436.Find Right Interval\Solution.cpp
7 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.