Segment Tree¶
Table of Contents¶
- 1157. Online Majority Element In Subarray (Hard)
- 2407. Longest Increasing Subsequence II (Hard)
- 2940. Find Building Where Alice and Bob Can Meet (Hard)
- 2286. Booking Concert Tickets in Groups (Hard)
- 3161. Block Placement Queries (Hard)
- 2213. Longest Substring of One Repeating Character (Hard)
- 3165. Maximum Sum of Subsequence With Non-adjacent Elements (Hard)
1157. Online Majority Element In Subarray¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, design, binary indexed tree, segment tree
2407. Longest Increasing Subsequence II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, divide and conquer, dynamic programming, binary indexed tree, segment tree, queue, monotonic queue
2940. Find Building Where Alice and Bob Can Meet¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, stack, binary indexed tree, segment tree, heap priority queue, monotonic stack
2286. Booking Concert Tickets in Groups¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: binary search, design, binary indexed tree, segment tree
3161. Block Placement Queries¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, binary indexed tree, segment tree
2213. Longest Substring of One Repeating Character¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, string, segment tree, ordered set
3165. Maximum Sum of Subsequence With Non-adjacent Elements¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, divide and conquer, dynamic programming, segment tree