main
leetcode-c3
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0391.Perfect Rectangle\Solution.java
15 1 -
A
solution\0700-0799\0774.Minimize Max Distance to Gas Station\Solution.cpp
5 1 -
A
solution\0500-0599\0515.Find Largest Value in Each Tree Row\Solution.py
6 1 -
A
solution\0700-0799\0774.Minimize Max Distance to Gas Station\Solution.java
5 1 -
A
solution\0300-0399\0331.Verify Preorder Serialization of a Binary Tree\Solution.java
4 1 -
A
solution\0700-0799\0776.Split BST\Solution.cpp
5 1 -
A
solution\0500-0599\0516.Longest Palindromic Subsequence\Solution.cpp
6 1 -
A
solution\0700-0799\0776.Split BST\Solution.java
4 1 -
A
solution\0300-0399\0392.Is Subsequence\Solution.cpp
4 1 -
A
solution\0700-0799\0776.Split BST\Solution.py
1 1 -
A
solution\0500-0599\0516.Longest Palindromic Subsequence\Solution.java
5 1 -
A
solution\0700-0799\0777.Swap Adjacent in LR String\Solution.go
 1 -
A
solution\0300-0399\0303.Range Sum Query - Immutable\Solution.c
4 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.cpp
10 1 -
A
solution\0500-0599\0588.Design In-Memory File System\Solution.py
16 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.go
 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.go
 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.go
 1 -