main
leetcode-scheme
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2511.Maximum Enemy Forts That Can Be Captured\Solution.cpp
7 1 -
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.go
 1 -
A
solution\2500-2599\2511.Maximum Enemy Forts That Can Be Captured\Solution.java
7 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.java
5 1 -
A
solution\2500-2599\2511.Maximum Enemy Forts That Can Be Captured\Solution.ts
6 1 -
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.cpp
5 1 -
A
solution\2500-2599\2512.Reward Top K Students\Solution.go
 1 -
A
solution\0300-0399\0335.Self Crossing\Solution.go
 1 -
A
solution\2500-2599\2512.Reward Top K Students\Solution.py
6 1 -
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.java
6 1 -
A
solution\2500-2599\2513.Minimize the Maximum of Two Arrays\Solution.cpp
6 1 -
A
solution\0600-0699\0609.Find Duplicate File in System\Solution.cpp
7 1 -
A
solution\0900-0999\0956.Tallest Billboard\Solution.java
8 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.py
1 1 -
A
solution\0900-0999\0956.Tallest Billboard\Solution.py
7 1 -
A
solution\0900-0999\0958.Check Completeness of a Binary Tree\Solution.cpp
4 1 -
A
solution\0400-0499\0463.Island Perimeter\Solution.go
 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.ts
3 1 -
A
solution\0900-0999\0958.Check Completeness of a Binary Tree\Solution.go
 1 -
A
solution\0900-0999\0958.Check Completeness of a Binary Tree\Solution.java
4 1 -