main
leetcode-tsh
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2075.Decode the Slanted Ciphertext\Solution.java
6 1 -
A
solution\0800-0899\0823.Binary Trees With Factors\Solution.py
6 1 -
A
solution\0800-0899\0886.Possible Bipartition\Solution.cpp
6 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.java
6 1 -
A
solution\2300-2399\2328.Number of Increasing Paths in a Grid\Solution.ts
6 1 -
A
solution\0700-0799\0768.Max Chunks To Make Sorted II\Solution.java
6 1 -
A
solution\0700-0799\0768.Max Chunks To Make Sorted II\Solution.py
6 1 -
A
solution\2000-2099\2070.Most Beautiful Item for Each Query\Solution.java
6 1 -
A
solution\0700-0799\0768.Max Chunks To Make Sorted II\Solution.ts
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.cpp
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.java
6 1 -
A
solution\2000-2099\2065.Maximum Path Quality of a Graph\Solution.ts
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.py
6 1 -
A
solution\2300-2399\2321.Maximum Score Of Spliced Array\Solution.cpp
6 1 -
A
solution\0600-0699\0666.Path Sum IV\Solution.cpp
6 1 -
A
solution\2300-2399\2325.Decode the Message\Solution.c
6 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.ts
6 1 -
A
solution\0600-0699\0666.Path Sum IV\Solution.java
6 1 -
A
solution\0800-0899\0801.Minimum Swaps To Make Sequences Increasing\Solution.py
6 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.py
6 1 -