Compressing Array

Problem Overview

• Reduce an integer array by replacing adjacent elements with their product when the product is ≤ k, aiming for the smallest possible final length.
• Input: array a and integer k; Output: the minimum achievable array size after any number of valid operations.
• Represents constrained data compression/aggregation in arrays under product limits.
• A Wells_fargo interviews coding interview problem and interview question.