Maximum Strength of K Disjoint Subarrays at DE Shaw

Problem Description

You are given an array of integers `nums` with length `n`, and a positive **odd** integer `k`. Select exactly **`k`** disjoint subarrays **`sub 1, sub2, ..., subk`** from `nums` such that the last element of `subi` appears before the first element of `sub{i+1}` for all `1 <= i <= k-1`. The goal is...

Topics

Also asked at 1 company