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

  • 414 issues
  • 2 pull requests
  • 3,791 files
  • 1 active branch

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0455.Assign Cookies\Solution.java
5 1 -
A
solution\0900-0999\0930.Binary Subarrays With Sum\Solution.js
5 1 -
A
solution\2000-2099\2070.Most Beautiful Item for Each Query\Solution.py
5 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.py
5 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.java
5 1 -
A
solution\0400-0499\0456.132 Pattern\Solution.cpp
5 1 -
A
solution\0900-0999\0935.Knight Dialer\Solution.java
5 1 -
A
solution\0400-0499\0456.132 Pattern\Solution.java
5 1 -
A
solution\0900-0999\0938.Range Sum of BST\Solution.java
5 1 -
A
solution\2400-2499\2461.Maximum Sum of Distinct Subarrays With Length K\Solution.py
5 1 -
A
solution\0600-0699\0647.Palindromic Substrings\Solution.cpp
5 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.c
5 1 -
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.py
5 1 -
A
solution\0900-0999\0948.Bag of Tokens\Solution.cpp
5 1 -
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.ts
5 1 -
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.java
5 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.c
5 1 -
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.cpp
5 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.cpp
5 1 -
A
solution\2300-2399\2373.Largest Local Values in a Matrix\Solution.java
5 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.