main
leetcode-tsh
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.cpp
3 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.c
3 1 -
A
solution\0500-0599\0508.Most Frequent Subtree Sum\Solution.py
3 1 -
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.ts
3 1 -
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.ts
3 1 -
A
solution\0400-0499\0413.Arithmetic Slices\Solution.java
3 1 -
A
solution\0400-0499\0413.Arithmetic Slices\Solution.py
3 1 -
A
solution\0400-0499\0413.Arithmetic Slices\Solution.ts
3 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3 1 -
A
solution\0800-0899\0867.Transpose Matrix\Solution.cpp
3 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3 1 -
A
solution\0700-0799\0709.To Lower Case\Solution.py
3 1 -
A
solution\1000-1099\1016.Binary String With Substrings Representing 1 To N\Solution.java
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.py
3 1 -
A
solution\2100-2199\2154.Keep Multiplying Found Values by Two\Solution.java
3 1 -
A
solution\1000-1099\1015.Smallest Integer Divisible by K\Solution.java
3 1 -
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.cpp
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.java
3 1 -
A
solution\1000-1099\1015.Smallest Integer Divisible by K\Solution.ts
3 1 1
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.java
3 1 -