main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0377.Combination Sum IV\Solution.java
4 1 -
A
solution\0300-0399\0377.Combination Sum IV\Solution.py
4 1 -
A
solution\0300-0399\0331.Verify Preorder Serialization of a Binary Tree\Solution.java
4 1 -
A
solution\0300-0399\0378.Kth Smallest Element in a Sorted Matrix\Solution.cpp
9 1 -
A
solution\0300-0399\0378.Kth Smallest Element in a Sorted Matrix\Solution.go
 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.cpp
5 1 -
A
solution\0300-0399\0378.Kth Smallest Element in a Sorted Matrix\Solution.java
7 1 -
A
solution\0200-0299\0295.Find Median from Data Stream\Solution.py
5 1 -
A
solution\0300-0399\0300.Longest Increasing Subsequence\Solution.go
 1 -
A
solution\0300-0399\0308.Range Sum Query 2D - Mutable\Solution.py
12 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.go
 1 -
A
solution\0300-0399\0378.Kth Smallest Element in a Sorted Matrix\Solution.py
3 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.java
5 1 -
A
solution\0300-0399\0379.Design Phone Directory\Solution.py
6 1 -
A
solution\0300-0399\0309.Best Time to Buy and Sell Stock with Cooldown\Solution.cpp
2 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.py
1 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.go
 1 -
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.cpp
5 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.py
6 1 -
A
solution\0300-0399\0300.Longest Increasing Subsequence\Solution.java
6 1 -