Solution for 1001-1100


# Name Difficulty Tags
1004 Max Consecutive Ones III Medium Two Pointers | Sliding Window
1007 Minimum Domino Rotations For Equal Row Medium
1008 Construct Binary Search Tree from Preorder Traversal Medium Tree
1019 Next Greater Node In Linked List Medium Linked List | Stack
1022 Sum of Root To Leaf Binary Numbers Easy Tree
1026 Maximum Difference Between Node and Ancestor Medium Tree | Depth-first Search
1028 Recover a Tree From Preorder Traversal Hard Tree | Depth-first Search
1042 Flower Planting With No Adjacent Medium
1043 Partition Array for Maximum Sum Medium DP | Graph
1059 All Paths from Source Lead to Destination Medium