โ† Postman questions

Divide Array into Increasing and Non-Decreasing Parts

Filed under Postman

The question

Given an array of size N, find the minimum number of element changes and modifications to divide it into two parts where the first N/2 elements are strictly increasing and the next N/2 elements are non-decreasing, outputting the lexicographically smallest modified array.

No write-up yet. Related questions below have one.

Related Postman questions

Collected from public candidate posts and coding forums. Updated Nov 2026.