Problem Submissions Solution
Maximum Product Of Two Numbers
Difficulty: Basic
Acceptance: %
Points: 10.00
You are given an array arr[] of non-negative integers, return the maximum product of two numbers possible.
Examples:
Expected Time Complexity: O(n)
Expected Auxiliary Space: O(1)
Constraints:
- 2 <= arr.size <= 10^7
- 0 <= arr[i] <= 10^9
Companies:
Amazon
Topics:
Array Sorting Algorithms
