main
leetcode-nushell
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2304.Minimum Path Cost in a Grid\Solution.py
4 1 -
A
solution\2300-2399\2304.Minimum Path Cost in a Grid\Solution.cpp
4 1 -
A
solution\0800-0899\0860.Lemonade Change\Solution.ts
4 1 -
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.ts
4 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.java
4 1 -
A
solution\2000-2099\2068.Check Whether Two Strings are Almost Equivalent\Solution.ts
4 1 1
A
solution\0900-0999\0978.Longest Turbulent Subarray\Solution.java
4 1 -
A
solution\0400-0499\0435.Non-overlapping Intervals\Solution.cpp
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\2419.Longest Subarray With Maximum Bitwise AND\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\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.cpp
4 1 -
A
solution\0300-0399\0370.Range Addition\Solution.cpp
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\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.py
4 1 -