Find the minimum sum of a path from the top-left to the bottom-right corner of a grid. You can only move down or right at each step.

Given a number 'n', generate all possible well-formed (balanced) parentheses strings of length 2*n. For instance, if n=3, you need to create all valid combinations like '((()))', '(()())', etc.

Divide an array into two subarrays such that the absolute difference between their sums is minimized. Find the best possible split to make the subarray sums as close as possible.