Available question text
Given an array of terrain heights, V droplets are poured one by one at index K and each droplet greedily rolls to the leftmost lowest reachable position (otherwise to the right) before settling; return the final heights after all drops. The core challenge is correctly simulating these local greedy flows (left-then-right scan) and updating heights efficiently.
Related questions
Continue with questions that share topics or the same question type.
- Pour Water Between Buckets to Make Water Levels Equal
Coding
- Calculate Trapping Rain Water
Coding
- Container With Most Water
Coding · Array · Greedy · Two Pointers
- Earliest Finish Time for Land and Water Rides I
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Google
Leetcode 755. Pour Water
Reported Dec 11, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source