Product of two numbers

CodeChefOpen on judge ↗

Given a list of numbers, find the maximum product obtained by taking exactly two numbers from the list. Input The first line will contain the integer N, the length of the array. The next line contains N space separated integers.. Output For each test case, output the maximum product obtained. Constraints - 2 ≤ N ≤ 10^5 - -10^9 ≤ Integers ≤ 10^9 Example Input: 2 2 3 Output: 6 E

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI