Modular Exponentiation in java

Remainder mod 11 Given a string (of maximum length 1000) representing a large number. Output is modulo of 11. Input specification:Input 1: A large number in the form of a string. Output Specification:Return the remainder modulo 11 of input 1. Example 1:Input 1: 121 Output: 0Explanation:121 mod 11 = 0 Example 2:Input 1: 13 Output: […]

Sum of divisors Print the sum of the divisors of the integer number N. Input specification:Input 1: The integer ‘n’. Output Specification:Return the sum of divisors of ‘n’. Example 1:Input 1: 6 Output: 12Explanation:Divisors of 6 are 1,2,3,6. Sum of number (1+2+3+6)=12 Example 2:Input 1: 36 Output: 91Explanation:Divisors of 36 are 1,2,3,4,6,9,12,18,36. Sum of number

Electrostatic Field Doug is fond of change, every now and then he tries to do new things. This time, he caught up with a rod comprising of negative (N) and positive (P) charges. He is asked to calculate the maximum net electrostatic field possible in the region due to the rod. Note: Assume Electrostatic Field

Frequency Count Given a string, find the frequencies of each of the characters in it.The input string contains only lowercase letters. The output string should contain a letter followed by its frequency, in the alphabetical order (from a to z). Input specification:Input 1: The input string. Output Specification:Return a string representing the frequency counts of

Adam’s Charity Adam decides to be generous and do some charity. starting today, from day 1 until day n, he gives i^2 coins to charity on day ‘i’ (1<=i<=n).return the total coins he would give to charity. Input specification:Input 1: number of days of Charity. Output Specification:Return the total number of coins till charity days.

Reverse String Word Wise Write a function to reverse a string word-wise. Input specification:Input 1: String Output Specification:Return the reversed string that is the last word in input string should come at the first position of the output string second last word at he second position and so on., individual words should remain same. Example

Second Largest Given an array (containing at most 1000 positive integers), find the second largest integer. If there exists no second largest integer, return -1. Input specification:Input 1: Length of the array.Input 2: an array of positive integers. Output Specification:Return the second largest number or -1 accordingly. Example 1:Input 1: 3Input 2: {2,1,2} Output: 1Explanation:1

Prime Numbers A prime number is a whole number greater than 1 that is divisible only by itself and the number 1. For example, 2,3,5 etc are at prime numbers as they are divisible only by themselves and 1. Input specification:Input 1: An integer n. Output Specification:Return the nth prime. Example 1:Input 1: 1 Output:

Maximum Sum Write a program that adds up the largest row sum and the largest column sum from an N-rows *M-columns array numbers. Input specification:Input1: Integer for row dimension of the array. Input2: Integer for column dimension of the array.Input3: Array elements to be entered in row major. Output Specification:Largest row sum + Largest column

String within String Given two strings, ‘X’ and ‘Y’ (length(X)>=1, length(Y)<=10000), find out if ‘Y’ is contained in ‘X’ Input specification:Input1: The string ‘X’.Input2: The string ‘Y’. Output Specification:Return “yes” if ‘Y’ is contained in ‘X’ else return no. Example 1:Input 1: abacInput 2: ab Output: yesExplanation:ab is present with abac Example 2:Input 1: xyacInput