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

  • 362 issues
  • 2 pull requests
  • 4,750 files
  • 1 active branch

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.cpp
5 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.ts
5 1 -
A
solution\2300-2399\2349.Design a Number Container System\Solution.py
5 1 -
A
solution\2100-2199\2108.Find First Palindromic String in the Array\Solution.c
5 1 -
A
solution\2300-2399\2352.Equal Row and Column Pairs\Solution.cpp
5 1 -
A
solution\2000-2099\2094.Finding 3-Digit Even Numbers\Solution.py
5 1 -
A
solution\0900-0999\0938.Range Sum of BST\Solution.java
5 1 -
A
solution\0300-0399\0384.Shuffle an Array\Solution.java
5 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.cpp
5 1 -
A
solution\2300-2399\2347.Best Poker Hand\Solution.ts
5 1 -
A
solution\0900-0999\0935.Knight Dialer\Solution.java
5 1 -
A
solution\0800-0899\0856.Score of Parentheses\Solution.cpp
5 1 -
A
solution\0300-0399\0323.Number of Connected Components in an Undirected Graph\Solution.js
5 1 -
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.java
5 1 1
A
solution\2300-2399\2345.Finding the Number of Visible Mountains\Solution.py
5 1 1
A
solution\0300-0399\0350.Intersection of Two Arrays II\Solution.ts
5 1 -
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.ts
5 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.cpp
5 1 -
A
solution\0900-0999\0931.Minimum Falling Path Sum\Solution.py
5 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.java
5 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.