main
leetcode-ion
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2381.Shifting Letters II\Solution.java
5 1 -
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.py
5 1 -
A
solution\0400-0499\0483.Smallest Good Base\Solution.py
5 1 1
A
solution\2300-2399\2381.Shifting Letters II\Solution.py
5 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.java
5 1 -
A
solution\0800-0899\0886.Possible Bipartition\Solution.py
5 1 -
A
solution\0800-0899\0884.Uncommon Words from Two Sentences\Solution.java
5 1 -
A
solution\0600-0699\0661.Image Smoother\Solution.ts
5 1 -
A
solution\0600-0699\0662.Maximum Width of Binary Tree\Solution.java
5 1 -
A
solution\0600-0699\0662.Maximum Width of Binary Tree\Solution.py
5 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.py
5 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.java
5 1 -
A
solution\0800-0899\0878.Nth Magical Number\Solution.java
5 1 -
A
solution\2300-2399\2373.Largest Local Values in a Matrix\Solution.java
5 1 -
A
solution\2100-2199\2130.Maximum Twin Sum of a Linked List\Solution.py
5 1 -
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.ts
5 1 -
A
solution\0400-0499\0487.Max Consecutive Ones II\Solution.java
5 1 -
A
solution\0400-0499\0487.Max Consecutive Ones II\Solution.py
5 1 1
A
solution\0600-0699\0665.Non-decreasing Array\Solution.ts
5 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.py
5 1 -