Skip to content

Practice Partition Array for Maximum Sum

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1043
LeetCode Problem

Partition Array for Maximum Sum

ArrayDynamic Programming

Problem Statement

Given an integer array arr, partition the array into (contiguous) subarrays of length at most k. After partitioning, each subarray has their values changed to become the maximum value of that subarray. Return the largest sum of the given array after partitioning. Test cases are generated so that the answer fits in a 32-bit integer.

Source: Partition Array for Maximum Sum on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
arr = [1,15,7,9,2,5,10], k = 3
Output
84

# Example 2

Input
arr = [1,4,1,5,7,3,6,1,9,9,3], k = 4
Output
83

# Example 3

Input
arr = [1], k = 1
Output
1

Constraints

1 <= arr.length <= 500
0 <= arr[i] <= 10^9
1 <= k <= arr.length

Related LeetCode Problems

Practice more problems similar to Partition Array for Maximum Sum.

1 Two Sum Easy4 Median of Two Sorted Arrays Hard5 Longest Palindromic Substring Medium10 Regular Expression Matching Hard11 Container With Most Water Medium
← Previous Flower Planting With No AdjacentNext → Longest Duplicate Substring

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free