Maximize It! in Python | HackerRank Solution

Hello coders, today we are going to solve Maximize It! HackerRank Solution in Python.

Task

You are given a function f(X) = X². You are also given K lists. The i^th list consists of N_i elements.

You have to pick one element from each list so that the value from the equation below is maximized:

S = (f(X₁) + f(X₂) + . . . + f(X_k) % M

X_i denotes the element picked from the i^th list . Find the maximized value S_max obtained.

% denotes the modulo operator.

Note that you need to take exactly one element from each list, not necessarily the largest element. You add the squares of the chosen elements and perform the modulo operation. The maximum value that you can obtain, will be the answer to the problem.

Input Format

The first line contains 2 space separated integers K and M.
The next K lines each contains an integer N_i, denoting the number of elements in the i^th list, followed by N_i space separated integers denoting the elements in the list.

Constraints

• 1 <= K <= 7
• 1 <= M <= 1000
• 1 <= N_i <= 7
• 1 <= Magnitude of elements in list <= 10⁹

Output Format

Output a single integer denoting the value S_max.

Sample Input

3 1000
2 5 4
3 7 8 9 
5 5 7 8 9 10 

Sample Output

206

Solution – Maximize It! in Python

# Enter your code here. Read input from STDIN. Print output to STDOUT
import itertools

NUMBER_OF_LISTS, MODULUS = map(int, input().split())
LISTS_OF_LISTS = []

for i in range(0, NUMBER_OF_LISTS):
    new_list = list(map(int, input().split()))
    del new_list[0]
    LISTS_OF_LISTS.append(new_list)

def squared(element):
    return element**2

COMBS = list(itertools.product(*LISTS_OF_LISTS))
RESULTS = []

for i in COMBS:
    result1 = sum(map(squared, [a for a in i]))
    result2 = result1 % MODULUS
    RESULTS.append(result2)

print(max(RESULTS))

Disclaimer: The above Problem (Maximize It!) is generated by Hacker Rank but the Solution is Provided by CodingBroz. This tutorial is only for Educational and Learning Purpose.