main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2393.Count Strictly Increasing Subarrays\Solution.java
4 1 -
A
solution\0400-0499\0477.Total Hamming Distance\Solution.py
4 1 -
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.java
4 1 -
A
solution\0300-0399\0382.Linked List Random Node\Solution.cpp
4 1 1
A
solution\0600-0699\0686.Repeated String Match\Solution.cpp
4 1 -
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.cpp
4 1 -
A
solution\2200-2299\2259.Remove Digit From Number to Maximize Result\Solution.ts
4 1 -
A
solution\0300-0399\0382.Linked List Random Node\Solution.java
4 1 -
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.java
4 1 -
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.java
4 1 -
A
solution\0300-0399\0382.Linked List Random Node\Solution.py
4 1 -
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.ts
4 1 -
A
solution\0300-0399\0383.Ransom Note\Solution.cpp
4 1 -
A
solution\0200-0299\0295.Find Median from Data Stream\Solution.ts
4 1 -
A
solution\2000-2099\2054.Two Best Non-Overlapping Events\Solution.py
4 1 -
A
solution\0600-0699\0690.Employee Importance\Solution.java
4 1 -
A
solution\0200-0299\0293.Flip Game\Solution.py
4 1 -
A
solution\0300-0399\0300.Longest Increasing Subsequence\Solution.py
4 1 -
A
solution\0300-0399\0383.Ransom Note\Solution.java
4 1 -
A
solution\0400-0499\0483.Smallest Good Base\Solution.cpp
4 1 -