Maximum Product After K Increments at Infosys

Problem Description

You are given an array of non-negative integers `nums` and an integer `k`. In one operation, you may choose **any** element from `nums` and **increment** it by `1`. Return _the**maximum** **product** of _`nums` _after**at most** _`k` _operations._ Since the answer may be very large, return it **mod...

Topics

Also asked at 1 company