main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2186.Minimum Number of Steps to Make Two Strings Anagram II\Solution.ts
3 1 -
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.ts
3 1 -
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.ts
3 1 -
A
solution\0600-0699\0630.Course Schedule III\Solution.cpp
3 1 -
A
solution\0600-0699\0630.Course Schedule III\Solution.java
3 1 -
A
solution\2100-2199\2181.Merge Nodes in Between Zeros\Solution.ts
3 1 -
A
solution\2100-2199\2181.Merge Nodes in Between Zeros\Solution.py
3 1 -
A
solution\0900-0999\0933.Number of Recent Calls\Solution.java
3 1 1
A
solution\2100-2199\2181.Merge Nodes in Between Zeros\Solution.java
3 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.ts
3 1 -
A
solution\2100-2199\2178.Maximum Split of Positive Even Integers\Solution.java
3 1 -
A
solution\2100-2199\2178.Maximum Split of Positive Even Integers\Solution.cpp
3 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.c
3 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.cpp
3 1 -
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.java
3 1 -
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.ts
3 1 -
A
solution\2000-2099\2022.Convert 1D Array Into 2D Array\Solution.ts
3 1 1
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3 1 -
A
solution\0600-0699\0640.Solve the Equation\Solution.py
3 1 -
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.cpp
3 1 -