main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2305.Fair Distribution of Cookies\Solution.py
1 1 -
A
solution\2300-2399\2320.Count Number of Ways to Place Houses\Solution.ts
1 1 -
A
solution\0700-0799\0776.Split BST\Solution.py
1 1 -
A
solution\0700-0799\0783.Minimum Distance Between BST Nodes\Solution.py
1 1 -
A
solution\2500-2599\2513.Minimize the Maximum of Two Arrays\Solution.py
1 1 -
A
solution\2000-2099\2024.Maximize the Confusion of an Exam\Solution.py
1 1 1
A
solution\0700-0799\0733.Flood Fill\Solution.py
1 1 -
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.py
1 1 -
A
solution\2200-2299\2288.Apply Discount to Prices\Solution.ts
1 1 -
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.py
1 1 -
A
solution\0400-0499\0453.Minimum Moves to Equal Array Elements\Solution.ts
1 1 -
A
solution\2200-2299\2274.Maximum Consecutive Floors Without Special Floors\Solution.ts
1 1 -
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.py
1 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.py
1 1 -
A
solution\0400-0499\0461.Hamming Distance\Solution.js
1 1 -
A
solution\0400-0499\0461.Hamming Distance\Solution.ts
1 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.py
1 1 -
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.py
1 1 -
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.py
1 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.py
1 1 -