Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-haxe
325
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.cpp
5
1
-
A
solution\0400-0499\0401.Binary Watch\Solution.cpp
5
1
-
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.java
5
1
-
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.py
5
1
-
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.cpp
5
1
-
A
solution\2300-2399\2352.Equal Row and Column Pairs\Solution.cpp
5
1
-
A
solution\0700-0799\0718.Maximum Length of Repeated Subarray\Solution.py
5
1
-
A
solution\2300-2399\2349.Design a Number Container System\Solution.py
5
1
-
A
solution\0700-0799\0719.Find K-th Smallest Pair Distance\Solution.ts
5
1
-
A
solution\2300-2399\2347.Best Poker Hand\Solution.ts
5
1
-
A
solution\2100-2199\2125.Number of Laser Beams in a Bank\Solution.java
5
1
-
A
solution\2100-2199\2125.Number of Laser Beams in a Bank\Solution.c
5
1
-
A
solution\0500-0599\0507.Perfect Number\Solution.cpp
5
1
-
A
solution\2100-2199\2125.Number of Laser Beams in a Bank\Solution.cpp
5
1
-
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.java
5
1
1
A
solution\0500-0599\0507.Perfect Number\Solution.java
5
1
-
A
solution\0500-0599\0507.Perfect Number\Solution.py
5
1
-
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.py
5
1
-
A
solution\0800-0899\0856.Score of Parentheses\Solution.cpp
5
1
-
A
solution\0500-0599\0508.Most Frequent Subtree Sum\Solution.cpp
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!