#3732
Maximum Product of Three Elements After One Replacement
specialist · 925 · lc medium +32 · 47.1% accepted · 78 likes · top 32%
Description
Given an integer array nums, replace exactly one element with any integer in [-105, 105], then return the maximum product achievable by any three elements at distinct indices of the modified array.
Code
1
2
3