main
leetcode-nushell
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.java
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 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.java
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.cpp
4 1 -
A
solution\0800-0899\0868.Binary Gap\Solution.cpp
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.py
4 1 -
A
solution\0800-0899\0868.Binary Gap\Solution.java
4 1 -
A
solution\2100-2199\2170.Minimum Operations to Make the Array Alternating\Solution.py
4 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.java
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.cpp
4 1 -
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.java
4 1 -
A
solution\0300-0399\0370.Range Addition\Solution.cpp
4 1 -
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.java
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.java
4 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.java
4 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.py
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.py
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.c
4 1 -
A
solution\0800-0899\0872.Leaf-Similar Trees\Solution.cpp
4 1 -