main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.py
1 1 -
A
solution\0500-0599\0549.Binary Tree Longest Consecutive Sequence II\Solution.py
1 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.py
1 1 -
A
solution\0500-0599\0553.Optimal Division\Solution.ts
1 1 -
A
solution\0500-0599\0558.Logical OR of Two Binary Grids Represented as Quad-Trees\Solution.py
1 1 -
A
solution\0400-0499\0427.Construct Quad Tree\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\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.py
1 1 -
A
solution\2200-2299\2240.Number of Ways to Buy Pens and Pencils\Solution.ts
1 1 -
A
solution\2500-2599\2513.Minimize the Maximum of Two Arrays\Solution.py
1 1 -
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.py
1 1 -
A
solution\0500-0599\0576.Out of Boundary Paths\Solution.py
1 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.py
1 1 -
A
solution\0400-0499\0437.Path Sum III\Solution.py
1 1 -
A
solution\2200-2299\2229.Check if an Array Is Consecutive\Solution.cpp
1 1 -
A
solution\0900-0999\0912.Sort an Array\Solution.py
1 1 1
A
solution\0700-0799\0746.Min Cost Climbing Stairs\Solution.ts
1 1 -
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.py
1 1 -
A
solution\2200-2299\2220.Minimum Bit Flips to Convert Number\Solution.ts
1 1 -