Pattern RepresentationMax Score: 100Given a pattern consisting only of 'I' and 'S', where I represents descending and S represents ascending, you need to display a sequence of numbers describing the ascending or descending order. Each character should be represented by 2 digits (between 1-9) - denoting the character's ascending or descending nature. The second character in the pattern takes the last digit from the first character to build the sequence. The third character in the pattern takes the last digit from the second character to build the sequence and so on. The sequence cannot have repeated digits. Find the smallest such sequence which represents the given pattern.Input FormatThe first line of input contains T - the number of test cases. It is followed by T lines, each containing a pattern, consisting only of 'S' and 'I'.Output FormatFor each test case, print the smallest sequence which represents the given pattern, separated by a newline.Constraints1 <= T <= 5001 <= len(str) <= 8ExampleInput4SISISIISSOutput1221132432145ExplanationExample 1:The given pattern has a single character 'S', which denotes ascending nature. There are multiple ways to represent it - 12, 47, 28, 34 etc. However, "12" is the smallest of them.Example 2:The given pattern has a single character 'I', which denotes descending nature. There are multiple ways to represent it - 21, 41, 75, 96 etc. However, "21" is the smallest of them.Example 3:The given pattern has 3 characters 'S' (ascending), 'I' (descending) and 'S' (ascending). There are multiple ways to represent it - 1324, 1634, 1435, 4812, 3748 etc. However, "1324" is the smallest of them.

Max Score: 100Print a hollow diamond pattern using '*'. See examples for more details.Input FormatThe first line of input contains T - the number of test cases. It is followed by T lines, each line contains a single odd integer N - the size of the diamond.Output FormatFor each test case, print the test case number as shown, followed by the diamond pattern, separated by a new line.Constraints1 <= T <= 1003 <= N <= 201ExampleInput437515OutputCase #1: ** * *Case #2: * * * * ** * * * * * *Case #3: * * ** * * * *Case #4: * * * * * * * * * * * * ** * * * * * * * * * * * * * *

Max Score: 20Print rectangle pattern. See the example for more details.Input FormatThe first and only line of input contains a single integer N.Output FormatFor the given integer, print a rectangle pattern as shown in the example.Constraints1 <= N <= 50ExampleInput5Output5432*543*154*215*321*4321

You are given a positive integer . You can perform the following operation on it atmost once :Choose a single digit from the number and change it to any digit you want from to .Your task is to generate the largest number such that and is a multiple of . If no such exists, print .Input FormatFirst line of input contains an integer , denoting the number of testcases lines of input follow- where each line contains a number .Constraints There are no leading zeroes in denotes the number of digits in the number .Please note that might not fit in the Long Long Int rangeOutput FormatFor each test case - print the value of if it exists; else print .Sample Input 0334999889Sample Output 084999-1Explanation 0In the test case, change the digit to to obtain the largest number possibleIn the test case, changing any digit in would lead to a lesser number so it's optimal to leave it as it is - as is already divisble by In the test case, it is impossible to generate a such that it is greater than or equal to and divisible by by changing atmost one digit of . Hence, we print .Sample Input 118292849184018401939169Sample Output 18792849184018401939169Explanation 1By changing the digit of to , we get the largest number possible which is divisible by .

How many patterns can you make with 2 digits, followed by a letter,followed by a digit, if your pattern cannot start with 0?

Problem StatementYou are given a function,static String FindMax(int[] arr){}The function accepts an integer array 'arr' of length 'size' as its argument. Implement the function to find and return the maximum number that can be formed by any permutation or arrangement of all the digits obtained from all the numbers present in the array. You have to return the number formed as a string.Note: You may need to rearrange the digits of the numbers to form the maximum number.Example:Input:34 79 58 64Output:98765443Explanation:All digits obtained from all the numbers of array are 3, 4, 7, 9, 5, 8, 6, 4. Maximum number obtained after rearranging all these digit gives 98765443. Thus, output is 98765443.The custom input format for the above case:434 79 58 64(The first line represents the 'size', the second line represents the elements of the array 'arr')Sample input21 90 23Sample Output932210The custom input format for the above case:321 90 23(The first line represents the 'size', the second line represents the elements of the array 'arr')Instructions :This is a template based question, DO NOT write the "main" function.Your code is judged by an automated system, do not write any additional welcome/greeting messages."Save and Test" only checks for basic test cases, more rigorous cases will be used to judge your code while scoring.Additional score will be given for writing optimized code both in terms of memory and execution time.Now let's start coding :Language:Read-only code below . . .1class SolutionClass {2    public static void main(String[] args) throws java.lang.Exception {3        //Input read from STDIN4        String result = FindMax(arr);5        //Value in result printed to STDOUT6   }7}8​Write your code below . . .9static String FindMax(int[] arr) throws java.lang.Exception10{11    /* Write your code here. */12}13​