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.
Expected Time Complexity: O(n)
Expected Auxiliary Space: O(1)
Constraints: - 2 <= arr.size <= 10^7
- 0 <= arr[i] <= 10^9
Topics: Array Sorting Algorithms
Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.
Please log in to access the Solution tab and view detailed answers and explanations.
Please log in to access the Discussion tab and join conversations with other participants.