main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.cpp
5 1 -
A
solution\2300-2399\2322.Minimum Score After Removals on a Tree\Solution.py
5 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.py
5 1 -
A
solution\2200-2299\2231.Largest Number After Digit Swaps by Parity\Solution.ts
5 1 -
A
solution\0300-0399\0377.Combination Sum IV\Solution.cpp
5 1 -
A
solution\2300-2399\2387.Median of a Row Wise Sorted Matrix\Solution.cpp
5 1 -
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.ts
5 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.cpp
5 1 -
A
solution\0800-0899\0875.Koko Eating Bananas\Solution.cpp
5 1 -
A
solution\2400-2499\2457.Minimum Addition to Make Integer Beautiful\Solution.java
5 1 -
A
solution\0600-0699\0609.Find Duplicate File in System\Solution.java
5 1 -
A
solution\0800-0899\0878.Nth Magical Number\Solution.java
5 1 -
A
solution\0400-0499\0445.Add Two Numbers II\Solution.ts
5 1 -
A
solution\0800-0899\0884.Uncommon Words from Two Sentences\Solution.java
5 1 -
A
solution\2200-2299\2226.Maximum Candies Allocated to K Children\Solution.cpp
5 1 -
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.cpp
5 1 -
A
solution\0800-0899\0886.Possible Bipartition\Solution.py
5 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.java
5 1 -
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.cpp
5 1 -
A
solution\2400-2499\2452.Words Within Two Edits of Dictionary\Solution.ts
5 1 -