main
leetcode-f-sharp
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.java
4 1 -
A
solution\0500-0599\0503.Next Greater Element II\Solution.cpp
4 1 -
A
solution\0300-0399\0356.Line Reflection\Solution.py
4 1 -
A
solution\0500-0599\0503.Next Greater Element II\Solution.java
4 1 -
A
solution\0700-0799\0711.Number of Distinct Islands II\Solution.py
4 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.java
4 1 -
A
solution\0300-0399\0357.Count Numbers with Unique Digits\Solution.cpp
4 1 -
A
solution\0500-0599\0504.Base 7\Solution.cpp
4 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.py
4 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.cpp
4 1 -
A
solution\0700-0799\0713.Subarray Product Less Than K\Solution.java
4 1 -
A
solution\0500-0599\0504.Base 7\Solution.java
4 1 -
A
solution\0500-0599\0504.Base 7\Solution.ts
4 1 -
A
solution\0300-0399\0357.Count Numbers with Unique Digits\Solution.java
4 1 -
A
solution\2400-2499\2428.Maximum Sum of an Hourglass\Solution.ts
4 1 -
A
solution\0500-0599\0506.Relative Ranks\Solution.cpp
4 1 -
A
solution\0400-0499\0404.Sum of Left Leaves\Solution.ts
4 1 -
A
solution\0700-0799\0718.Maximum Length of Repeated Subarray\Solution.cpp
4 1 -
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.cpp
4 1 -
A
solution\0500-0599\0506.Relative Ranks\Solution.java
4 1 -