main
leetcode-haxe
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.py
2 1 -
A
solution\0300-0399\0384.Shuffle an Array\Solution.js
2 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.ts
2 1 -
A
solution\2500-2599\2548.Maximum Price to Fill a Bag\Solution.ts
2 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.py
2 1 -
A
solution\0300-0399\0343.Integer Break\Solution.c
2 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.ts
2 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.py
2 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.ts
2 1 -
A
solution\0400-0499\0462.Minimum Moves to Equal Array Elements II\Solution.cpp
2 1 -
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.ts
2 1 -
A
solution\0400-0499\0462.Minimum Moves to Equal Array Elements II\Solution.java
2 1 -
A
solution\0400-0499\0462.Minimum Moves to Equal Array Elements II\Solution.py
2 1 -
A
solution\2500-2599\2544.Alternating Digit Sum\Solution.py
2 1 -
A
solution\0900-0999\0961.N-Repeated Element in Size 2N Array\Solution.js
2 1 -
A
solution\2400-2499\2433.Find The Original Array of Prefix Xor\Solution.py
2 1 -
A
solution\0400-0499\0464.Can I Win\Solution.py
2 1 -
A
solution\2500-2599\2544.Alternating Digit Sum\Solution.java
2 1 -
A
solution\2400-2499\2433.Find The Original Array of Prefix Xor\Solution.java
2 1 -
A
solution\0300-0399\0344.Reverse String\Solution.cpp
2 1 -