main
leetcode-scheme
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0384.Shuffle an Array\Solution.js
2 1 -
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.java
5 1 -
A
solution\0400-0499\0475.Heaters\Solution.py
3 1 -
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.ts
3 1 -
A
solution\0300-0399\0304.Range Sum Query 2D - Immutable\Solution.js
2 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.cpp
5 1 -
A
solution\0400-0499\0476.Number Complement\Solution.cpp
5 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.java
5 1 -
A
solution\0300-0399\0385.Mini Parser\Solution.cpp
12 1 -
A
solution\0600-0699\0671.Second Minimum Node In a Binary Tree\Solution.cpp
5 1 -
A
solution\0600-0699\0670.Maximum Swap\Solution.ts
6 1 -
A
solution\0600-0699\0663.Equal Tree Partition\Solution.java
4 1 -
A
solution\0600-0699\0661.Image Smoother\Solution.go
 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.java
6 1 -
A
solution\0600-0699\0658.Find K Closest Elements\Solution.py
3 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.cpp
5 1 -
A
solution\0300-0399\0315.Count of Smaller Numbers After Self\Solution.go
 1 -
A
solution\0300-0399\0337.House Robber III\Solution.py
1 1 -
A
solution\0400-0499\0452.Minimum Number of Arrows to Burst Balloons\Solution.py
3 1 -
A
solution\0600-0699\0623.Add One Row to Tree\Solution.cpp
5 1 -