Segment Tree Problems
About 1 min
Segment Tree Problems
Single Point Update Problems
Problem ID | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
0303 | Range Sum Query - Immutable | [[LeetCode 0303]] | Design, Array, Prefix Sum | Easy |
0307 | Range Sum Query - Mutable | [[LeetCode 0307]] | Design, Binary Indexed Tree, Segment Tree, Array | Medium |
0354 | Russian Doll Envelopes | [[LeetCode XXXX]] | Array, Binary Search, Dynamic Programming, Sorting | Hard |
Range Update Problems
Problem ID | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
0370 | Range Addition | [[LeetCode XXXX]] | Array, Prefix Sum | Medium |
1109 | Corporate Flight Bookings | [[LeetCode XXXX]] | Array, Prefix Sum | Medium |
1450 | Number of Students Doing Homework at a Given Time | [[LeetCode XXXX]] | Array | Easy |
0673 | Number of Longest Increasing Subsequence | [[LeetCode XXXX]] | Binary Indexed Tree, Segment Tree, Array, Dynamic Programming | Medium |
1310 | XOR Queries of a Subarray | [[LeetCode XXXX]] | Bit Manipulation, Array, Prefix Sum | Medium |
1851 | Minimum Interval to Include Each Query | Array, Binary Search, Sorting, Sweep Line, Heap (Priority Queue) | Hard |
Range Merge Problems
Problem ID | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
0729 | My Calendar I | [[LeetCode XXXX]] | Design, Segment Tree, Binary Search, Ordered Set | Medium |
0731 | My Calendar II | [[LeetCode XXXX]] | Design, Segment Tree, Binary Search, Ordered Set | Medium |
0732 | My Calendar III | [[LeetCode XXXX]] | Design, Segment Tree, Binary Search, Ordered Set | Hard |
Sweep Line Problems
Problem ID | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
0218 | The Skyline Problem | [[LeetCode XXXX]] | Binary Indexed Tree, Segment Tree, Array, Divide and Conquer, Ordered Set, Sweep Line, Heap (Priority Queue) | Hard |
0391 | Perfect Rectangle | [[LeetCode XXXX]] | Array, Sweep Line | Hard |
0850 | Rectangle Area II | [[LeetCode XXXX]] | Segment Tree, Array, Ordered Set, Sweep Line | Hard |