Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-perl
405
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.cpp
6
1
-
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.java
6
1
-
A
solution\0700-0799\0768.Max Chunks To Make Sorted II\Solution.java
6
1
-
A
solution\0300-0399\0390.Elimination Game\Solution.cpp
6
1
-
A
solution\2000-2099\2075.Decode the Slanted Ciphertext\Solution.java
6
1
-
A
solution\0700-0799\0768.Max Chunks To Make Sorted II\Solution.ts
6
1
-
A
solution\2000-2099\2070.Most Beautiful Item for Each Query\Solution.java
6
1
-
A
solution\0400-0499\0494.Target Sum\Solution.java
6
1
-
A
solution\0900-0999\0931.Minimum Falling Path Sum\Solution.cpp
6
1
-
A
solution\0900-0999\0930.Binary Subarrays With Sum\Solution.py
6
1
-
A
solution\0400-0499\0496.Next Greater Element I\Solution.cpp
6
1
-
A
solution\0700-0799\0710.Random Pick with Blacklist\Solution.cpp
6
1
1
A
solution\0700-0799\0710.Random Pick with Blacklist\Solution.java
6
1
-
A
solution\2300-2399\2349.Design a Number Container System\Solution.cpp
6
1
-
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.cpp
6
1
-
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6
1
-
A
solution\0900-0999\0931.Minimum Falling Path Sum\Solution.java
6
1
-
A
solution\2300-2399\2328.Number of Increasing Paths in a Grid\Solution.ts
6
1
-
A
solution\0300-0399\0318.Maximum Product of Word Lengths\Solution.cpp
6
1
-
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.java
6
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!