Union Find on Arrays¶
Table of Contents¶
- 1562. Find Latest Group of Size M (Medium)
- 1488. Avoid Flood in The City (Medium)
- 2382. Maximum Segment Sum After Removals (Hard)
- 2334. Subarray With Elements Greater Than Varying Threshold (Hard)
1562. Find Latest Group of Size M¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, hash table, binary search, simulation
1488. Avoid Flood in The City¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, hash table, binary search, greedy, heap priority queue
2382. Maximum Segment Sum After Removals¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, union find, prefix sum, ordered set
2334. Subarray With Elements Greater Than Varying Threshold¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, stack, union find, monotonic stack