CodingHard
Process range minimum assignment operations on array elements
Filed under Directi
The question
Given heights of n rows of grass, simulate k operations where a farmer sets heights from row s to e to a minimum of h (i.e., H[i] = min(H[i], h)), and print all final heights within O(n log n) time complexity without using heavy structures like Segment Trees or BIT.
No write-up yet. Related questions below have one.
Related Directi questions
Collected from public candidate posts and coding forums. Updated Nov 2026.