Avoid Flood in The City: coding question

Available question text

Assign dry operations on zero days so that no lake is rained on while already full: given a sequence where rains[i]>0 fills a lake and rains[i]==0 lets you dry one lake, return any schedule of dries that prevents floods or [] if impossible. Core challenge: greedily match available dry days to the next repeat rain for each lake by tracking last-fill times and using an ordered set of zero-day indices to pick a dry before the conflicting rain.

Continue with questions that share topics or the same question type.

Minimum Sum of Squared Difference
Coding · Array · Binary Search · Greedy
Sell Diminishing-Valued Colored Balls
Coding · Array · Binary Search · Greedy
Task Scheduler
Coding · Array · Counting · Greedy
Design Movie Rental System
Coding · Array · Design · Hash Table

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

No company association
Leetcode 1488. Avoid Flood in The City
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

MongoDB
Avoid Flood in The City
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 89.4. This is not an interview probability.
View source
MongoDB
Avoid Flood in The City
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 88.6. This is not an interview probability.
View source

Available question text

Avoid Flood in The City

Available question text

Related questions

Avoid Flood in The City

Available question text

Related questions