main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2187.Minimum Time to Complete Trips\Solution.cpp
5 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.cpp
5 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.java
5 1 -
A
solution\0400-0499\0481.Magical String\Solution.java
5 1 -
A
solution\2400-2499\2488.Count Subarrays With Median K\Solution.py
5 1 -
A
solution\0400-0499\0482.License Key Formatting\Solution.java
5 1 -
A
solution\2400-2499\2490.Circular Sentence\Solution.cpp
5 1 -
A
solution\2400-2499\2486.Append Characters to String to Make Subsequence\Solution.java
5 1 -
A
solution\2400-2499\2486.Append Characters to String to Make Subsequence\Solution.cpp
5 1 -
A
solution\0400-0499\0482.License Key Formatting\Solution.py
5 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.c
5 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.cpp
5 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.cpp
5 1 -
A
solution\0400-0499\0483.Smallest Good Base\Solution.py
5 1 1
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5 1 -
A
solution\2400-2499\2483.Minimum Penalty for a Shop\Solution.java
5 1 -
A
solution\2300-2399\2321.Maximum Score Of Spliced Array\Solution.java
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.ts
5 1 2
A
solution\2600-2699\2645.Minimum Additions to Make Valid String\Solution.java
5 1 -