Available question text
Given an integer array, return the maximum product obtainable by multiplying any three numbers. Consider both the three largest values and the combination of the largest value with the two smallest (most negative) values since negatives can flip sign.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Number of Visible Points
Coding · Array · Geometry · Math
- K Closest Points to Origin
Coding · Array · Divide and Conquer · Geometry
- Sell Diminishing-Valued Colored Balls
Coding · Array · Binary Search · Greedy
- Maximum Bitwise AND After Increment Operations
Coding · Array · Bit Manipulation · Greedy
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Salesforce
Leetcode 628. Maximum Product of Three Numbers
Reported Jun 22, 2026 · 3 source reports
SENIOR
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Salesforce
Maximum Product of Three Numbers
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 55.3. This is not an interview probability.
View source