Given string S contains lowercase alphabets. The power of an alphabet is defined as the position of the alphabet( i.e. A - 1. B-2, C-3, D-4, E-5, F-6 and so on...) raised to the number of times the alphab Calculate the sum for the power of every unique alphabet present in the string. There will be multiple test cases running so the Input and Output should match exactly as provided. The base Output variable result is set to a default value of -404 which can be modified. Additionally, you can add or remove these output variables. Input Format The first line contains an integer N denoting the size of the string. The second line contains the input string S. Sample Input 5 aaacc Constraints 1 <= N <= 5 <=<= '2" for every i from 0 <=i< N. Output Format Return a single integer denoting the total sum of all the powers of every unique alphabet present in the string.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Please code this in python according to the function given below.
Given string S contains lowercase alphabets.
The power of an alphabet is defined as the position of the alphabet( i.e. A - 1, B-2, C-3, D-4, E-5, F-6 and so on...) raised to the number of times the alphabet occurs
Calculate the sum for the power of every unique alphabet present in the string.
There will be multiple test cases running so the Input and Output should match exactly as provided.
The base Output variable result is set to a default value of -404 which can be modified. Additionally, you can add or remove these output variables.
Input Format
The first line contains an integer N denoting the size of the string.
The second line contains the input string S.
Sample Input
5
aaacc
Constraints
1 <= N <= 5
"a" <= S[] <= "2" for every i from 0 <=i< N.
Output Format
Return a single integer denoting the total sum of all the powers of every unique alphabet present in the string.
Sample Output
10
Explanation
The unique alphabets present in the string are "a" and "c" with frequencies 3 and 2 respectively.
The power of "a" is its position in the alphabet (1) raised to its occurrence (3), hence the power of "a" = 13 = 1.
Similarly, the power of "c" is its position in the alphabet (3) raised to its occurrence (2), hence the power of "c" = 32 = 9.
Therefore, total power power of "a" + power of "c" = 9+1 = 10.
Hence the output is 10.
Go to PC settings
Transcribed Image Text:Given string S contains lowercase alphabets. The power of an alphabet is defined as the position of the alphabet( i.e. A - 1, B-2, C-3, D-4, E-5, F-6 and so on...) raised to the number of times the alphabet occurs Calculate the sum for the power of every unique alphabet present in the string. There will be multiple test cases running so the Input and Output should match exactly as provided. The base Output variable result is set to a default value of -404 which can be modified. Additionally, you can add or remove these output variables. Input Format The first line contains an integer N denoting the size of the string. The second line contains the input string S. Sample Input 5 aaacc Constraints 1 <= N <= 5 "a" <= S[] <= "2" for every i from 0 <=i< N. Output Format Return a single integer denoting the total sum of all the powers of every unique alphabet present in the string. Sample Output 10 Explanation The unique alphabets present in the string are "a" and "c" with frequencies 3 and 2 respectively. The power of "a" is its position in the alphabet (1) raised to its occurrence (3), hence the power of "a" = 13 = 1. Similarly, the power of "c" is its position in the alphabet (3) raised to its occurrence (2), hence the power of "c" = 32 = 9. Therefore, total power power of "a" + power of "c" = 9+1 = 10. Hence the output is 10. Go to PC settings
Language
1 def main():
2
34567690
8
Python (3.8.1)
n = int(input())
str1 = input()
print (solution (str1, n))
def solution (str1, n):
# write your code here
return 0;
10 main()
Transcribed Image Text:Language 1 def main(): 2 34567690 8 Python (3.8.1) n = int(input()) str1 = input() print (solution (str1, n)) def solution (str1, n): # write your code here return 0; 10 main()
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY