main
leetcode-rockstar
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2245.Maximum Trailing Zeros in a Cornered Path\Solution.cpp
7 1 -
A
solution\0500-0599\0539.Minimum Time Difference\Solution.java
4 1 -
A
solution\2200-2299\2245.Maximum Trailing Zeros in a Cornered Path\Solution.java
7 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.java
5 1 -
A
solution\0300-0399\0307.Range Sum Query - Mutable\Solution.go
 1 -
A
solution\2200-2299\2248.Intersection of Multiple Arrays\Solution.cpp
5 1 -
A
solution\0700-0799\0793.Preimage Size of Factorial Zeroes Function\Solution.cpp
7 1 -
A
solution\2200-2299\2248.Intersection of Multiple Arrays\Solution.java
5 1 -
A
solution\0500-0599\0539.Minimum Time Difference\Solution.ts
1 1 -
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.go
 1 -
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.cpp
5 1 -
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.go
 1 -
A
solution\0300-0399\0316.Remove Duplicate Letters\Solution.cpp
7 1 -
A
solution\0300-0399\0335.Self Crossing\Solution.py
12 1 -
A
solution\0300-0399\0371.Sum of Two Integers\Solution.py
3 1 -
A
solution\0400-0499\0439.Ternary Expression Parser\Solution.cpp
9 1 -
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.java
6 1 -
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.java
5 1 -
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.py
1 1 -
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.py
7 1 -