main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0961.N-Repeated Element in Size 2N Array\Solution.java
3 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.go
 1 -
A
solution\0900-0999\0962.Maximum Width Ramp\Solution.cpp
8 1 -
A
solution\0400-0499\0458.Poor Pigs\Solution.java
2 1 -
A
solution\0900-0999\0962.Maximum Width Ramp\Solution.java
8 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.py
2 1 -
A
solution\0900-0999\0965.Univalued Binary Tree\Solution.cpp
3 1 -
A
solution\0300-0399\0376.Wiggle Subsequence\Solution.java
4 1 -
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.cpp
7 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.ts
3 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.cpp
5 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.go
 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.java
7 1 -
A
solution\0300-0399\0364.Nested List Weight Sum II\Solution.js
5 1 -
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.go
 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.go
 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.py
5 1 -
A
solution\0800-0899\0872.Leaf-Similar Trees\Solution.cpp
4 1 -