Problem Description:You are given N number of coordinates and you have to create a polygon from these points such that they will make a polygon with maximum area.Note: coordinates provided in the input may or may not be in sequential form.Constraints1 <= N <= 10Input:First line contains an integer N which depicts number of co-ordinatesNext N lines consist of two space separated integer depicting coordinates of in form of xyOutput:Print the maximum possible area possible by creating a polygon by joining the coordinates. If the area is in decimal form, print the absolute value as output.Time Limit (secs):1

Compute the area of a simple polygon, and the direction (clockwise or counterclockwise) in which its vertices are given.InputInput contains up to 25 test cases. Each test case begins with an integer 𝑛 (3≤𝑛≤1000). Then follow the 𝑛 vertices of a simple polygon, one per line, each of the form 𝑥 𝑦. The points may be given in either clockwise or counterclockwise order. Coordinates are integers with absolute value bounded by 10000. The input is terminated by a case beginning with 0.OutputFor each test case, output a line 𝐷 𝐴, where 𝐷 is one of “CW” or “CCW”, indicating whether the polygon was given in clockwise or counterclockwise order, respectively. 𝐴 is the area of the polygon, given with exactly one digit after the decimal point.Sample Input 1 Sample Output 130 010 00 10541 -6-24 -74-51 -673 17-30 -340CCW 50.0CW 3817.5

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

Problem StatementWrite a program that accepts sets of three numbers, and prints the second-maximum number among the three.InputFirst line contains the number of triples, N.The next N lines which follow each have three space separated integers.OutputFor each of the N triples, output one new line which contains the second-maximum integer among the three.Constraints1 ≤ N ≤ 61 ≤ every integer ≤ 10000The three integers in a single triplet are all distinct. That is, no two of them are equal.Sample 1:InputOutput31 2 310 15 5100 999 500210500

Given an array of integers, find the largest number that can be constructed by concatenating all the elements of the given array.Input FormatFirst line of input contains T - number of test cases. Its followed by 2T lines. First line of each test case contains N - size of the array and the second line contains N integers - elements of the array.Constraints1 <= T <= 10001 <= N <= 10000 <= ar[i] <= 1000Output FormatFor each test case, print the largest number that can be constructed by concatenating all the elements of the given array, separated by newline.Sample Input 03849 73 58 30 72 44 78 23 469 9 57 60 240 4 Sample Output 078737258494430239696057440

Given an array of integers, find the largest number that can be constructed by concatenating all the elements of the given array.Input FormatThe first line of input contains T - the number of test cases. It's followed by 2T lines. The first line of each test case contains N - the size of the array and the second line contains N integers - the elements of the array.Output FormatFor each test case, print the largest number that can be constructed by concatenating all the elements of the given array, separated by a new line.Constraints1 <= T <= 10001 <= N <= 10000 <= ar[i] <= 1000ExampleInput3849 73 58 30 72 44 78 23469 9 57 60240 4Output78737258494430239696057440