main
leetcode-c3
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0407.Trapping Rain Water II\Solution.go
 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.go
 1 -
A
solution\0500-0599\0546.Remove Boxes\Solution.py
1 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.java
5 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.java
4 1 -
A
solution\0800-0899\0827.Making A Large Island\Solution.ts
16 1 -
A
solution\0500-0599\0547.Number of Provinces\Solution.go
 1 -
A
solution\0800-0899\0828.Count Unique Characters of All Substrings of a Given String\Solution.go
 1 -
A
solution\0400-0499\0407.Trapping Rain Water II\Solution.py
15 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.py
4 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.java
5 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.py
5 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.ts
2 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.cpp
4 1 -
A
solution\0400-0499\0423.Reconstruct Original Digits from English\Solution.cpp
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.go
 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.java
4 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.js
3 1 -
A
solution\0400-0499\0423.Reconstruct Original Digits from English\Solution.go
 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.py
4 1 -