Question: Which of the following is an example of a problem that can be solved using dynamic programming?

Options:

1. Finding the maximum sum of a contiguous subarray
2. Finding the maximum element in an array
3. Sorting an array of integers
4. Searching for an element in an unsorted array

Correct Answer: Finding the maximum sum of a contiguous subarray

Solution:

Finding the maximum sum of a contiguous subarray can be solved using dynamic programming, specifically with Kadane\'s algorithm.