main
leetcode-haxe
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0416.Partition Equal Subset Sum\Solution.js
5 1 -
A
solution\0400-0499\0416.Partition Equal Subset Sum\Solution.py
5 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.java
5 1 -
A
solution\2300-2399\2342.Max Sum of a Pair With Equal Sum of Digits\Solution.cpp
5 1 -
A
solution\2000-2099\2068.Check Whether Two Strings are Almost Equivalent\Solution.java
5 1 -
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.ts
5 1 -
A
solution\2000-2099\2067.Number of Equal Count Substrings\Solution.cpp
5 1 -
A
solution\2000-2099\2067.Number of Equal Count Substrings\Solution.py
5 1 -
A
solution\2000-2099\2068.Check Whether Two Strings are Almost Equivalent\Solution.cpp
5 1 -
A
solution\2100-2199\2148.Count Elements With Strictly Smaller and Greater Elements\Solution.cpp
5 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.java
5 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.py
5 1 -
A
solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.java
5 1 -
A
solution\0800-0899\0856.Score of Parentheses\Solution.cpp
5 1 -
A
solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.py
5 1 -
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.java
5 1 1
A
solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.cpp
5 1 -
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.cpp
5 1 -
A
solution\2300-2399\2331.Evaluate Boolean Binary Tree\Solution.py
5 1 1
A
solution\2300-2399\2331.Evaluate Boolean Binary Tree\Solution.java
5 1 -