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 | 力扣 Tags: Array, Hash Table, Binary Search, Simulation 1488. Avoid Flood in The City¶ LeetCode | 力扣 Tags: Array, Hash Table, Binary Search, Greedy, Heap Priority Queue 2382. Maximum Segment Sum After Removals¶ LeetCode | 力扣 Tags: Array, Union Find, Prefix Sum, Ordered Set 2334. Subarray With Elements Greater Than Varying Threshold¶ LeetCode | 力扣 Tags: Array, Stack, Union Find, Monotonic Stack