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: * * * * * * * * * * * * ** * * * * * * * * * * * * * *

Print 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

Even SplitMax Score: 50Given a number N, check if you can split the number into 2 non-zero even parts.Input FormatFirst line of input contains T - number of test cases. Its followed by T lines, each line contains a single integer N.Output FormatFor each test case, print "Yes" if you can split the number into 2 non-zero even parts, "No" otherwise, separated by new line.Constraints1 <= T <= 1050 <= N <= 1018ExampleInput285OutputYesNoExplanationExample 1:You can split 8 as 4,4 or 6,2.Example 2:You cannot split 5 into 2 even parts.

Max Score: 20Given a string S and a character C, check whether the character C is occurring together in the string S.Input FormatThe first and only line of input contains a string S and character, C separated by space.Output FormatPrint "Yes" if the character C is occurring together, otherwise print "No".Constraints1 <= |S| <= 103ExampleInputsnooze oOutputYes

Max Score: 50You are given two numbers A and B. Write a program to count the number of bits to be flipped to change the number A to the number B. Flipping a bit of a number means changing a bit from 1 to 0 or vice versa.Input FormatThe first line of input contains T - the number of test cases. Each of the next T lines contains 2 integers A and B, separated by space.Output FormatFor each test case, print the number of bit flips required to convert A to B, separated by a new line.Constraints1 <= T <= 1000000 <= N <= 109ExampleInput420 1016 81 153549 24Output4236