main
leetcode-nushell
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2513.Minimize the Maximum of Two Arrays\Solution.py
1 1 -
A
solution\2000-2099\2096.Step-By-Step Directions From a Binary Tree Node to Another\Solution.py
1 1 -
A
solution\0700-0799\0776.Split BST\Solution.py
1 1 -
A
solution\2300-2399\2321.Maximum Score Of Spliced Array\Solution.py
1 1 -
A
solution\0800-0899\0897.Increasing Order Search Tree\Solution.py
1 1 -
A
solution\2300-2399\2320.Count Number of Ways to Place Houses\Solution.cs
1 1 1
A
solution\2300-2399\2320.Count Number of Ways to Place Houses\Solution.ts
1 1 -
A
solution\0400-0499\0437.Path Sum III\Solution.py
1 1 -
A
solution\0800-0899\0813.Largest Sum of Averages\Solution.py
1 1 -
A
solution\2300-2399\2305.Fair Distribution of Cookies\Solution.py
1 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.py
1 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.py
1 1 -
A
solution\2200-2299\2288.Apply Discount to Prices\Solution.ts
1 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.py
1 1 -
A
solution\2000-2099\2061.Number of Spaces Cleaning Robot Cleaned\Solution.py
1 1 -
A
solution\2200-2299\2274.Maximum Consecutive Floors Without Special Floors\Solution.ts
1 1 -
A
solution\0700-0799\0736.Parse Lisp Expression\Solution.py
1 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.py
1 1 -
A
solution\2200-2299\2267.Check if There Is a Valid Parentheses String Path\Solution.py
1 1 -
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.py
1 1 -