main
leetcode-crystal
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0587.Erect the Fence\Solution.java
12 1 -
A
solution\0300-0399\0329.Longest Increasing Path in a Matrix\Solution.java
12 1 -
A
solution\2400-2499\2467.Most Profitable Path in a Tree\Solution.cpp
12 1 -
A
solution\2400-2499\2478.Number of Beautiful Partitions\Solution.py
12 1 -
A
solution\2500-2599\2536.Increment Submatrices by One\Solution.cpp
12 1 -
A
solution\2500-2599\2536.Increment Submatrices by One\Solution.java
12 1 -
A
solution\2600-2699\2628.JSON Deep Equal\Solution.ts
12 1 -
A
solution\2600-2699\2601.Prime Subtraction Operation\Solution.java
12 1 -
A
solution\2500-2599\2584.Split the Array to Make Coprime Products\Solution.cpp
12 1 -
A
solution\0300-0399\0335.Self Crossing\Solution.java
12 1 -
A
solution\0300-0399\0335.Self Crossing\Solution.py
12 1 -
A
solution\0600-0699\0640.Solve the Equation\Solution.java
12 1 -
A
solution\0900-0999\0952.Largest Component Size by Common Factor\Solution.java
12 1 2
A
solution\0600-0699\0648.Replace Words\Solution.cpp
12 1 -
A
solution\0900-0999\0959.Regions Cut By Slashes\Solution.java
12 1 -
A
solution\0400-0499\0472.Concatenated Words\Solution.java
12 1 2
A
solution\0900-0999\0996.Number of Squareful Arrays\Solution.py
12 1 -
A
solution\0300-0399\0385.Mini Parser\Solution.cpp
12 1 -
A
solution\0300-0399\0385.Mini Parser\Solution.java
12 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.cpp
12 1 -