Leetcode 553. Optimal Division

Given an array of positive integers representing a chain of divisions, insert parentheses to maximize the evaluated value and return the resulting expression string. The challenge is choosing the grouping of divisions (n ≤ 10) that minimizes the effective denominator so the final value is largest.