Highest factor in addition

8=2+2+2+2= multiplying gives = 16
highest factor in addition.

4= 2+2 = multiply = 4

9 = 3+3+3 = multiply = 27
its greater common factor

Input:
Enter any number : 9

Output:
27A

Const=int(input('Enter any number : '))
L=[]
for i in range(2,Const):
    temp=1
    if Const%i==0:
        Q=int(Const/i)
        for j in range(Q):
            temp*=i
        L.append(temp)
    else:
        R=Const%i
        Q=int(Const/i)
        for j in range(Q):
            temp*=i
        temp*=R
        L.append(temp)
print(max(L))

Input_1:
Enter any number : 8

Output:
18

Input_2:
Enter any number : 4

Output:

4

Input_3:
Enter any number : 6

Output:
9

More Q

• Find the majority element appearing more than n/2 times
• Return an array of the squares of each number.
• Highest factor in addition.
• Find the empty packets(0) of chocolate and push it to the end of the conveyor belt(array).
• Every element in array appears twice.Find that single one.
• Find the duplicate letters in string. Same to do in dictionary way.
• Find minimum number of edits (operations) required to convert ‘str1’ into ‘str2’.
• Return the maximum number you can get by changing at most one digit.
• Sed Commands – Ranges of lines.
• Find the kth smallest element in the given 2D array.
• Find all elements that appear more than [n/3] times.
• Write a function to return true if s2 contains the permutation of s1.
• Sort the array into a wave like array.
• Re-order array, such that nums[0] < nums[1] > nums[2] < nums[3]....
• Given the coordinates, return true if the four points construct a square.
• Minimum Distance Between Words of a String.
• Return the shortest distance between these two words.
• Write a program to find the n-th ugly number.
• Check if array could become Non – Decreasing array.
• Find the minimum area of a rectangle that can be formed from given points.