Showing 3 of 3 questions
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.
#1. Generate Parentheses
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.
#2. Minimum Path Sum
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.
#3. Partition Array Into Two Arrays to Minimize Sum Difference
Page 1 of 1 · 3 total