main
leetcode-tsh
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2328.Number of Increasing Paths in a Grid\Solution.ts
6 1 -
A
solution\0700-0799\0778.Swim in Rising Water\Solution.ts
6 1 -
A
solution\2300-2399\2325.Decode the Message\Solution.c
6 1 -
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.ts
6 1 -
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.py
6 1 -
A
solution\0800-0899\0879.Profitable Schemes\Solution.java
6 1 -
A
solution\2000-2099\2054.Two Best Non-Overlapping Events\Solution.java
6 1 -
A
solution\0700-0799\0729.My Calendar I\Solution.java
6 1 1
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.java
6 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.py
6 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.cs
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.js
6 1 1
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.ts
6 1 -
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.py
6 1 -
A
solution\0800-0899\0813.Largest Sum of Averages\Solution.cpp
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.cpp
6 1 -
A
solution\2300-2399\2316.Count Unreachable Pairs of Nodes in an Undirected Graph\Solution.cpp
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.java
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.py
6 1 -
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.java
6 1 -