Lazy Segment Tree

Table of Contents

• 2589. Minimum Time to Complete All Tasks (Hard)
• 2569. Handling Sum Queries After Update (Hard)
• 1622. Fancy Sequence (Hard)
• 850. Rectangle Area II (Hard)
• 3454. Separate Squares II (Hard)
• 2916. Subarrays Distinct Element Sum of Squares II (Hard)

2589. Minimum Time to Complete All Tasks

• LeetCode | 力扣

• Tags: Array, Binary Search, Stack, Greedy, Sorting

2569. Handling Sum Queries After Update

• LeetCode | 力扣

• Tags: Array, Segment Tree

1622. Fancy Sequence

• LeetCode | 力扣

• Tags: Math, Design, Segment Tree

850. Rectangle Area II

• LeetCode | 力扣

• Tags: Array, Segment Tree, Line Sweep, Ordered Set

3454. Separate Squares II

• LeetCode | 力扣

• Tags: Array, Binary Search, Segment Tree, Line Sweep

2916. Subarrays Distinct Element Sum of Squares II

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Binary Indexed Tree, Segment Tree