main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.java
5 1 -
A
solution\0500-0599\0587.Erect the Fence\Solution.py
10 1 -
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.py
5 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.go
 1 -
A
solution\0600-0699\0676.Implement Magic Dictionary\Solution.py
11 1 -
A
solution\0300-0399\0398.Random Pick Index\Solution.go
 1 -
A
solution\1000-1099\1009.Complement of Base 10 Integer\Solution.cpp
6 1 -
A
solution\0600-0699\0677.Map Sum Pairs\Solution.go
 1 -
A
solution\0400-0499\0496.Next Greater Element I\Solution.cpp
0 1 -
A
solution\0800-0899\0850.Rectangle Area II\Solution.cpp
0 1 -
A
solution\0500-0599\0588.Design In-Memory File System\Solution.go
 1 -
A
solution\0800-0899\0850.Rectangle Area II\Solution.go
 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.cpp
0 1 -
A
solution\0500-0599\0588.Design In-Memory File System\Solution.py
16 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.go
 1 -
A
solution\0300-0399\0343.Integer Break\Solution.java
4 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.java
7 1 -
A
solution\0400-0499\0450.Delete Node in a BST\Solution.cpp
0 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.py
3 1 -