Maximize Total Cost of Alternating Subarrays - DSA Problem | Talentd