Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-perl
414
issues
2
pull requests
3,791
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.ts
5
1
-
A
solution\0700-0799\0767.Reorganize String\Solution.py
5
1
-
A
solution\0700-0799\0774.Minimize Max Distance to Gas Station\Solution.cpp
5
1
-
A
solution\0700-0799\0774.Minimize Max Distance to Gas Station\Solution.java
5
1
-
A
solution\0700-0799\0776.Split BST\Solution.cpp
5
1
-
A
solution\2000-2099\2053.Kth Distinct String in an Array\Solution.java
5
1
-
A
solution\2000-2099\2053.Kth Distinct String in an Array\Solution.cpp
5
1
-
A
solution\0400-0499\0416.Partition Equal Subset Sum\Solution.js
5
1
-
A
solution\2100-2199\2148.Count Elements With Strictly Smaller and Greater Elements\Solution.java
5
1
-
A
solution\2100-2199\2125.Number of Laser Beams in a Bank\Solution.java
5
1
-
A
solution\2400-2499\2411.Smallest Subarrays With Maximum Bitwise OR\Solution.cpp
5
1
-
A
solution\0200-0299\0299.Bulls and Cows\Solution.cpp
5
1
-
A
solution\2200-2299\2222.Number of Ways to Select Buildings\Solution.java
5
1
-
A
solution\2000-2099\2062.Count Vowel Substrings of a String\Solution.cpp
5
1
-
A
solution\0300-0399\0320.Generalized Abbreviation\Solution.java
5
1
-
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.ts
5
1
-
A
solution\2200-2299\2202.Maximize the Topmost Element After K Moves\Solution.py
5
1
-
A
solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.java
5
1
-
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.java
5
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.cpp
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!