main
leetcode-haxe
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2565.Subsequence With the Minimum Score\Solution.go
 1 -
A
solution\0900-0999\0923.3Sum With Multiplicity\Solution.java
6 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.java
7 1 -
A
solution\2500-2599\2566.Maximum Difference by Remapping a Digit\Solution.cpp
7 1 -
A
solution\0900-0999\0924.Minimize Malware Spread\Solution.cpp
13 1 -
A
solution\2500-2599\2566.Maximum Difference by Remapping a Digit\Solution.java
3 1 -
A
solution\0300-0399\0316.Remove Duplicate Letters\Solution.go
 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.php
 1 -
A
solution\0900-0999\0915.Partition Array into Disjoint Intervals\Solution.java
4 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.py
1 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.ts
5 1 -
A
solution\0900-0999\0915.Partition Array into Disjoint Intervals\Solution.py
4 1 -
A
solution\2500-2599\2548.Maximum Price to Fill a Bag\Solution.cpp
3 1 -
A
solution\2500-2599\2548.Maximum Price to Fill a Bag\Solution.go
 1 -
A
solution\0400-0499\0463.Island Perimeter\Solution.java
8 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.ts
2 1 -
A
solution\0900-0999\0916.Word Subsets\Solution.cpp
9 1 -
A
solution\2500-2599\2548.Maximum Price to Fill a Bag\Solution.java
3 1 -
A
solution\2500-2599\2548.Maximum Price to Fill a Bag\Solution.ts
2 1 -
A
solution\0900-0999\0916.Word Subsets\Solution.go
 1 -