Maximum product of two numbers (GFG)

 Given an array with all elements greater than or equal to zero. Return the maximum product of two numbers possible.

Input:
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is N, size of array. The second line of each test case contains array elements.

Output:
Print the maximum product of two numbers possible.

Constraints:
1 ≤ T ≤ 100
2 ≤ N ≤ 107
0 ≤ A[i] ≤ 104

Example:
Input:
1
5
1 100 42 4 23

Output:
4200

Explanation:
Testcase 1: Two maximum numbers are 100 and 42 and their product is 4200.

SOLUTION:

for i in range (int(input())):

    n=int(input())

    p=list(map(int,input().split()))

    p=sorted(p)

    print(p[-1]*p[-2])

Comments

Post a Comment

Popular posts from this blog

Chef and Remissness Problem Code: REMISS (CodeChef)

Chef is now a corporate person. He has to attend office regularly. But chef does not want to go to office, rather he wants to stay home and discover different recipes and cook them. In the office where chef works, has two guards who count how many times a person enters into the office building. Though the duty of a guard is 24 hour in a day, but sometimes they fall asleep during their duty and could not track the entry of a person in the office building. But one better thing is that they never fall asleep at the same time. At least one of them remains awake and counts who enters into the office. Now boss of Chef wants to calculate how many times Chef has entered into the building. He asked to the guard and they give him two integers  A  and  B , count of first guard and second guard respectively. Help the boss to count the minimum and maximum number of times Chef could have entered into the office building. Input The first line of the input contains an integer  T ...
Read more

Sort in specific order (GFG)

  Given an array   A   of positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order. Input: The first line of input contains an integer  T  denoting the number of test cases. Then  T  test cases follow. Each test case contains an integer  N  denoting the size of the array. The next line contains  N  space separated values of the array. Output: For each test case in a new line print the space separated values of the modified array. Constraints: 1 <= T <= 10 3 1 <= N <= 10 7 0 <= A i  <= 10 18 Example: Input: 2 7 1 2 3 5 4 7 10 7 0 4 5 3 7 2 1 Output: 7 5 3 1 2 4 10 7 5 3 1 0 2 4 Explanation: Testcase1:  Array elements 7 5 3 1 are odd and sorted in descending order, whereas 2 4 10 are even numbers and sorte...
Read more

Reverse words in a given string (GFG)

  Given a String S, reverse the string without reversing its individual words. Words are separated by dots. Example 1: Input: S = i.like.this.program.very.much Output: much.very.program.this.like.i Explanation: After reversing the whole string(not individual words), the input string becomes much.very.program.this.like.i Example 2: Input: S = pqr.mno Output: mno.pqr Explanation: After reversing the whole string , the input string becomes mno.pqr Your Task: You dont need to read input or print anything. Complete the function  reverseWords()  which takes string S as input parameter and returns a string containing the words in reversed order. Each word in the returning string should also be separated by '.'  Expected Time Complexity:  O(|S|) Expected Auxiliary Space:  O(|S|) Constraints: 1 <= |S| <= 2000   Solution: def reverseWords(s):     a = ".".join(         reversed(s.split('.')))   ...
Read more