Question

Java

Input Format For Custom Testing The first line contains an integer, n, that denotes the number of elements in s. Each line i of the n subsequent lines (where 0 si<n) contains a string that describes s[i]. Sample Case 0 Sample Input For Custom Testing 4 code aaagmnrs anagrams doce Sample Output aaagmnrs code Explanation aaagmnrs and anagrams are anagrams, code and doce are anagrams. After sorting aaagmnrs comes first. Sample Case 1 Sample Input For Custom Testing 4 poke pkoe okpe ekop Sample Output poke Explanation All of the strings are anagrams of each other. Only the first occurrence is left.

Answer 1

// STAY HOME STAY SAFE

import java.util.*;
public class HelloWorld
{
// function to check anagrams
public static boolean check(char[] s1, char[] s2)
{
// if the lengths are not equal return false
if (s1.length != s2.length)
return false;
// sort the two strings
Arrays.sort(s1);
Arrays.sort(s2);
// check for equality of strings
for (int i = 0; i < s1.length; i++)
if (s1[i] != s2[i])
return false;
return true;
}
// function to sort the final answer of size k
public static void sort(String[] s, int k)
{
// bubble sort technique to sort the array of strings
for(int i = 0; i<k-1; i++) {
for (int j = i+1; j<k; j++) {
if(s[i].compareTo(s[j])>0) {
String temp = s[i];
s[i] = s[j];
s[j] = temp;
}
}
}
}
// main function
public static void main(String []args)
{
// input n
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
// create three strings, one for input, one for tags and one for final answer
String[] s = new String[n];
boolean[] tags = new boolean[n];
String[] ans = new String[n];
int k=0;
// input the string array and assign all tags to false because no string is visited now
for(int i=0;i<n;i++)
{
s[i]=sc.next();
tags[i]=false;
}
for(int i=0;i<n;i++)
{
// aggign tag[i] to true after visiting
tags[i]=true;
int f=0;
// iterate from i+1 to n
for(int j=i+1;j<n;j++)
{
// check for anagram only if the tag is false (not visited)
if(tags[j]==false)
{
// check the ith and jth string for anagrams
char[] a = s[i].toCharArray();
char[] b = s[j].toCharArray();
boolean res = check(a,b);
// if they are anagrams then set f=1 and tag[j]=true
if(res==true)
{
f=1;
tags[j]=true;
}
}

}
// if f=1 then add the ith string to answer array
if(f==1)
{
ans[k]=s[i];
k++;
}
}
// sort the answer array
sort(ans,k);
// display the array
for(int i=0;i<k;i++)
{
System.out.println(ans[i]);
}
}
}

} 20 1 import java.util.*; 2 public class HelloWorld 3- { 4 // function to check anagrams 5 public static boolean check(char[] s1, char[] s2) 6 { 7 // if the lengths are not equal return false 8 if (s1.length != s2.length) 9 return false; 10 // sort the two strings 11 Arrays.sort(); 12 Arrays.sort(s2); 13 // check for equality of strings 14 for (int i = 0; i < s1.length; i++) 15 if (s1[i] != s2[i]) 16 return false; 17 return true; 18 19 Il function to sort the final answer of size k public static void sort(String[] s, int k) 21 { // bubble sort technique to sort the array of strings 23 for(int i = 0; i<k-1; i++) { 24 for (int j = i+1; j<k; j++) { 25 if(s[i].compareTo(s[j])>0) { 26 String temp = s[i]; 27 s[i] = s[j]; 28 s[j] = temp; 29 30 31 32 33 // main function 34 public static void main(String []args) 35 36 // input n Scanner sc = new Scanner(System.in); 38 int n = sc.nextInt(); 39 // create three strings, one for input, one for tags and one for final answer 40 String[] s = new String[n]; 41 boolean[] tags = new boolean[n]; 22 بها ܢܚܟ } } { 37

41 42 43 44 boolean[] tags = new boolean[n]; String[] ans = new String[n]; int k=0; // input the string array and assign all tags to false because no string is visited now for(int i=0;i<n;i++) { 45 46 47 48 49 50 s[i]=sc.next(); tags[i]=false; for(int i=0;i<n;i++) } { 51 52 53 54 55 56 { 57. 58 59 60 61 62 63 64 65 66 67. 68 69 70 71 72 73 74 // aggign tag[i] to true after visiting tags[i]=true; int f=0; // iterate from i+1 to n for(int j=i+1;j<n; j++) // check for anagram only if the tag is false (not visited) if(tags[j]==false) { // check the ith and jth string for anagrams char[] a = s[i].tocharArray(); char[] b = s[j].tocharArray();|| boolean res = check(a,b); // if they are anagrams then set f=1 and tag[j]=true if(res==true) { f=1; tags[j]=true; } بها } // if f=1 then add the ith string to answer array

// if f=1 then add the ith string to answer array if(f==1) { ans[k]=s[i]; k++; 74 75 76 77 78 79 80 81 82 83 84 85 - } } // sort the answer array sort(ans,k); // display the array for(int i=0;i<k;i++) { 86 87 System.out.println(ans[i]); ܢܟ بہ 88 89 }

Execute > Share Source File STDIN L.lt Result $javac HelloWorld.java 4 code aaagmnrs anagrams doce $java -Xmx128M -Xms 16M HelloWorld aaagmors code

Execute > Share Source File STDIN L.lı Result $javac HelloWorld.java 4 poke pkoe okpe ekop $java -Xmx128M -Xms 16M HelloWorld poke