Problem Statement

Maximize Array Splits body { font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Oxygen", "Ubuntu", "Cantarell", "Fira Sans", "Droid Sans", "Helvetica Neue", sans-serif; line-height: 1.6; color: #333; max-width: 800px; margin: 20px auto; padding: 0 20px; } h1, h2 { border-bottom: 1px solid #eaecef; padding-bottom: 0.3em; } code { font-family: "SFMono-Regular", Consolas, "Liberation Mono", Menlo, Courier, monospace; background-color: #f6f8fa; padding: 0.2em 0.4em; margin: 0; font-size: 85%; border-radius: 3px; } pre { background-color: #f6f8fa; padding: 16px; overflow: auto; border-radius: 3px; } pre code { padding: 0; margin: 0; font-size: 100%; background-color: transparent; } ul { padding-left: 20px; } Maximize Array Splits Description Given an array arr of length n . It is sorted in non-decreasing order, that is, arr[i] ≤ arr[i+1] for all 1 ≤ i < n . You can remove any number of elements from arr (including the option of not removing any at all) without c