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 | LeetCode CH (Hard)
-
Tags: array, binary search, stack, greedy, sorting
2569. Handling Sum Queries After Update¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, segment tree
1622. Fancy Sequence¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: math, design, segment tree
850. Rectangle Area II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, segment tree, line sweep, ordered set
3454. Separate Squares II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, segment tree, line sweep
2916. Subarrays Distinct Element Sum of Squares II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, binary indexed tree, segment tree