main
leetcode-rockstar
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.py
2 1 -
A
solution\0400-0499\0426.Convert Binary Search Tree to Sorted Doubly Linked List\Solution.py
2 1 -
A
solution\0300-0399\0366.Find Leaves of Binary Tree\Solution.py
2 1 -
A
solution\0500-0599\0557.Reverse Words in a String III\Solution.py
2 1 -
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.ts
2 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.py
2 1 -
A
solution\0500-0599\0560.Subarray Sum Equals K\Solution.java
2 1 -
A
solution\0500-0599\0560.Subarray Sum Equals K\Solution.py
2 1 -
A
solution\0500-0599\0561.Array Partition\Solution.java
2 1 -
A
solution\0400-0499\0430.Flatten a Multilevel Doubly Linked List\Solution.py
2 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.cpp
2 1 -
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.cpp
2 1 -
A
solution\0800-0899\0876.Middle of the Linked List\Solution.ts
2 1 -
A
solution\2100-2199\2160.Minimum Sum of Four Digit Number After Splitting Digits\Solution.java
2 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.ts
2 1 -
A
solution\2100-2199\2160.Minimum Sum of Four Digit Number After Splitting Digits\Solution.py
2 1 -
A
solution\2100-2199\2160.Minimum Sum of Four Digit Number After Splitting Digits\Solution.cpp
2 1 -
A
solution\2300-2399\2364.Count Number of Bad Pairs\Solution.java
2 1 -
A
solution\2100-2199\2154.Keep Multiplying Found Values by Two\Solution.py
2 1 -
A
solution\0900-0999\0998.Maximum Binary Tree II\Solution.ts
2 1 -