लाडकी बहिन योजने बाबत मोठी बातमी. आता लाडक्या बहिणीन्ना 1500 रुपये मिळनार नाहीत, तर....

Write a program to Print highest value string 

 First Take an integer t as an input.

Then you will be given t number test cases.

In each test case,

"First take n as an integer input,

Then you will be given n strings as inputs.

Then print the string having the highest value.

If more than one string has the highest value, then print the string that highest value string which occurs first."

**Method of Calculating the value of a string: The total number of vowels in the string is the total value of that string. **

Write the output for each test case in a separate line.

Input Format

In the first line an integer input t will be given as an integer input.

Then for each test case, you will get n as an integer input.

Then from the next line, n strings will follow.

Constraints

1<=t<=2^10

1<=n<=2^10

Minimum length of a string will be 1, and there will not be any space in a string.

Also, each string consists of only small case characters.

Output Format

Write the output for each test case in a separate line.

ALSO READ: Print nth Tribonacci number

import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static int strLength(String str){ int count = 0; for(int i=0;i<str.length();i++){ char ch = str.charAt(i); if(ch=='a' ||ch=='e' ||ch=='i' ||ch=='o' ||ch=='u' || ch=='A' ||ch=='E' ||ch=='I' ||ch=='O' ||ch=='U'){ count++; } } return count; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int t = sc.nextInt(); for(int i=0;i<t;i++){ int n = sc.nextInt(); String arr[] = new String[n]; for(int j=0;j<n;j++){ arr[j] = sc.next(); } int idx = 0; for(int k=0;k<n;k++){ if(strLength(arr[k]) > strLength(arr[idx])){ idx = k; } } System.out.println(arr[idx]); } } }