-
Notifications
You must be signed in to change notification settings - Fork 10
/
SumitAndRohil.java
57 lines (44 loc) · 1.25 KB
/
SumitAndRohil.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
//https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/practice-problems/algorithm/sumit-and-rohil/
import java.util.*;
class SumitAndRohil
{
public static void main(String args[] ) throws Exception
{
Scanner in = new Scanner(System.in);
int T = Integer.parseInt(in.nextLine());
String names[] = new String[T];
int grouped[] = new int[T];
int total = 0;
for (int i = 0; i < T; i++)
names[i] = in.nextLine();
for (int i = 0; i < T; i++)
{
if(grouped[i] == 0)
{
grouped[i] = 1;
total++;
char[] chars = names[i].toCharArray();
Arrays.sort(chars);
String str1 = new String(chars);
for (int j = i+1; j < T; j++)
{
if(grouped[j] == 0)
{
if( ( (names[i].charAt(0)) == (names[j].charAt(0)) ) && ( (names[i].charAt(names[i].length()-1)) ==
(names[j].charAt(names[j].length()-1)) ) )
{
char[] chars2 = names[j].toCharArray();
Arrays.sort(chars2);
String str2 = new String(chars2);
if(str1.equals(str2))
{
grouped[j] = 1;
}
}
}
}
}
}
System.out.println(total);
}
}