main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.py
5 1 -
A
solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.py
5 1 -
A
solution\0400-0499\0401.Binary Watch\Solution.cpp
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.ts
5 1 2
A
solution\2300-2399\2363.Merge Similar Items\Solution.java
5 1 -
A
solution\2200-2299\2225.Find Players With Zero or One Losses\Solution.cpp
5 1 -
A
solution\0500-0599\0507.Perfect Number\Solution.cpp
5 1 -
A
solution\0500-0599\0507.Perfect Number\Solution.java
5 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.cpp
5 1 -
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.java
5 1 -
A
solution\0300-0399\0324.Wiggle Sort II\Solution.js
5 1 -
A
solution\0500-0599\0508.Most Frequent Subtree Sum\Solution.cpp
5 1 -
A
solution\0300-0399\0350.Intersection of Two Arrays II\Solution.java
5 1 -
A
solution\2300-2399\2381.Shifting Letters II\Solution.cpp
5 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.java
5 1 -
A
solution\2100-2199\2156.Find Substring With Given Hash Value\Solution.js
5 1 -
A
solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.java
5 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.py
5 1 -
A
solution\0500-0599\0510.Inorder Successor in BST II\Solution.java
5 1 -
A
solution\0500-0599\0510.Inorder Successor in BST II\Solution.py
5 1 -