Leetcode 3494. Find the Minimum Amount of Time to Brew Potions

Given n wizards (machines) and m potions (jobs) that must pass through all wizards in the given order, where processing time on wizard i for potion j is time_ij = skill[i] * mana[j], find the minimum makespan under the constraint that each potion must be handed to the next wizard immediately on completion (no waiting between stages). This is a flow-shop/pipeline scheduling problem with rank‑1 processing times (a_i * b_j) requiring optimal spacing of job start times to avoid machine conflicts.