main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.py
1 1 -
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.py
1 1 -
A
solution\0400-0499\0437.Path Sum III\Solution.py
1 1 -
A
solution\0500-0599\0561.Array Partition\Solution.js
1 1 -
A
solution\0500-0599\0563.Binary Tree Tilt\Solution.py
1 1 -
A
solution\0800-0899\0813.Largest Sum of Averages\Solution.py
1 1 -
A
solution\2200-2299\2240.Number of Ways to Buy Pens and Pencils\Solution.ts
1 1 -
A
solution\0500-0599\0576.Out of Boundary Paths\Solution.py
1 1 -
A
solution\0800-0899\0841.Keys and Rooms\Solution.py
1 1 -
A
solution\0800-0899\0842.Split Array into Fibonacci Sequence\Solution.py
1 1 -
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.ts
1 1 -
A
solution\0400-0499\0453.Minimum Moves to Equal Array Elements\Solution.ts
1 1 -
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.py
1 1 -
A
solution\2100-2199\2164.Sort Even and Odd Indices Independently\Solution.py
1 1 -
A
solution\2100-2199\2162.Minimum Cost to Set Cooking Time\Solution.py
1 1 -
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.py
1 1 -
A
solution\2100-2199\2154.Keep Multiplying Found Values by Two\Solution.ts
1 1 -
A
solution\0600-0699\0606.Construct String from Binary Tree\Solution.py
1 1 -
A
solution\2100-2199\2152.Minimum Number of Lines to Cover Points\Solution.py
1 1 -
A
solution\0300-0399\0384.Shuffle an Array\Solution.ts
1 1 -