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 | 力扣

• Tags: Array, Binary Search, Design, Binary Indexed Tree, Segment Tree

2407. Longest Increasing Subsequence II

• LeetCode | 力扣

• 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 | 力扣

• Tags: Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap Priority Queue, Monotonic Stack

2286. Booking Concert Tickets in Groups

• LeetCode | 力扣

• Tags: Binary Search, Design, Binary Indexed Tree, Segment Tree

3161. Block Placement Queries

• LeetCode | 力扣

• Tags: Array, Binary Search, Binary Indexed Tree, Segment Tree

2213. Longest Substring of One Repeating Character

• LeetCode | 力扣

• Tags: Array, String, Segment Tree, Ordered Set

3165. Maximum Sum of Subsequence With Non-adjacent Elements

• LeetCode | 力扣

• Tags: Array, Divide And Conquer, Dynamic Programming, Segment Tree