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\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.ts
3
1
-
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.ts
3
1
1
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.cs
3
1
-
A
solution\0300-0399\0378.Kth Smallest Element in a Sorted Matrix\Solution.py
3
1
-
A
solution\0900-0999\0950.Reveal Cards In Increasing Order\Solution.cpp
3
1
-
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.java
3
1
-
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.cpp
3
1
-
A
solution\0400-0499\0452.Minimum Number of Arrows to Burst Balloons\Solution.cpp
3
1
-
A
solution\0400-0499\0452.Minimum Number of Arrows to Burst Balloons\Solution.java
3
1
-
A
solution\2100-2199\2178.Maximum Split of Positive Even Integers\Solution.cpp
3
1
-
A
solution\0900-0999\0942.DI String Match\Solution.ts
3
1
-
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.ts
3
1
-
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.cs
3
1
2
A
solution\0600-0699\0640.Solve the Equation\Solution.py
3
1
-
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.ts
3
1
-
A
solution\0700-0799\0783.Minimum Distance Between BST Nodes\Solution.cpp
3
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3
1
-
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.cpp
3
1
-
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.c
3
1
-
A
solution\2100-2199\2178.Maximum Split of Positive Even Integers\Solution.java
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!