main
leetcode-assembly
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0645.Set Mismatch\Solution.py
7 1 -
A
solution\0600-0699\0645.Set Mismatch\Solution.java
7 1 -
A
solution\0800-0899\0813.Largest Sum of Averages\Solution.java
7 1 -
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.java
7 1 -
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.cpp
7 1 -
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.cpp
7 1 -
A
solution\0600-0699\0638.Shopping Offers\Solution.java
7 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.ts
7 1 -
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.py
7 1 -
A
solution\0600-0699\0635.Design Log Storage System\Solution.java
7 1 2
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.java
7 1 -
A
solution\0600-0699\0628.Maximum Product of Three Numbers\Solution.java
7 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.c
7 1 -
A
solution\0500-0599\0526.Beautiful Arrangement\Solution.java
7 1 -
A
solution\0700-0799\0738.Monotone Increasing Digits\Solution.py
7 1 -
A
solution\0500-0599\0526.Beautiful Arrangement\Solution.ts
7 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.java
7 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.cpp
7 1 -
A
solution\0600-0699\0625.Minimum Factorization\Solution.java
7 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.py
7 1 -