628. Maximum Product of Three Numbers - LeetCode Solution

Array Math

Python

Python Code:

class Solution:
    def maximumProduct(self, nums: List[int]) -> int:
        nums.sort()
        
        return max(nums[0] * nums[1] * nums[-1], nums[-1]* nums[-2]* nums[-3])

Comments

Submit

0 Comments

More Questions

1633C - Kill the Monster	1611A - Make Even
1030B - Vasya and Cornfield	1631A - Min Max Swap
1296B - Food Buying	133A - HQ9+
1650D - Twist the Permutation	1209A - Paint the Numbers
1234A - Equalize Prices Again	1613A - Long Comparison
1624B - Make AP	660B - Seating On Bus
405A - Gravity Flip	499B - Lecture
709A - Juicer	1358C - Celex Update
1466B - Last minute enhancements	450B - Jzzhu and Sequences
1582C - Grandma Capa Knits a Scarf	492A - Vanya and Cubes
217A - Ice Skating	270A - Fancy Fence
181A - Series of Crimes	1638A - Reverse
1654C - Alice and the Cake	369A - Valera and Plates
1626A - Equidistant Letters	977D - Divide by three multiply by two
1654B - Prefix Removals	1654A - Maximum Cake Tastiness