Leetcode 2892. Minimizing Array After Replacing Pairs With Their Product

Given an array of positive numbers where you repeatedly replace any two elements with their product until a single value remains, determine the minimum possible final value achievable by choosing the order of pairwise replacements. This requires reasoning about the optimal pairing/merge order (greedy or DP over combinations) to control exponential growth of products.