hackerrank/java/HackerrankJava0020.java at master · mcakar-dev/hackerrank · GitHub

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
importjava.util.HashMap;
importjava.util.Map;
importjava.util.Scanner;

publicclassHackerrankJava0020 {

publicstaticvoidmain(String[] args) {
// Java Anagrams
// https://www.hackerrank.com/challenges/java-anagrams/problem?isFullScreen=true

Scannerscan = newScanner(System.in);
Stringa = scan.next();
Stringb = scan.next();
scan.close();
booleanret = isAnagram(a, b);
System.out.println((ret) ? "Anagrams" : "Not Anagrams");
	}

privatestaticbooleanisAnagram(Stringa, Stringb) {
// -------------------------------------------------------------------------------------------------
// --- You need to add this lines for solution hackerrank provides all other lines for challange ---
// -------------------------------------------------------------------------------------------------

intmaxLength = a.length() > b.length() ? a.length() : b.length();

Map<String, Integer> anagramMap = newHashMap<>();
for (inti = 0; i < maxLength; i++) {
if (a.length() > i) {
StringletterFirst = a.substring(i, i + 1).toLowerCase();
if (anagramMap.containsKey(letterFirst)) {
anagramMap.put(letterFirst, anagramMap.get(letterFirst) + 1);
 } else {
anagramMap.put(letterFirst, 1);
 }
 }

if (b.length() > i) {
StringletterSecond = b.substring(i, i + 1).toLowerCase();
if (anagramMap.containsKey(letterSecond)) {
anagramMap.put(letterSecond, anagramMap.get(letterSecond) - 1);
 } else {
anagramMap.put(letterSecond, -1);
 }
 }
 }

returnanagramMap.values().stream().allMatch(x -> x == 0);

// -------------------------------------------------------------------------------------------------
// -------------------------------------------------------------------------------------------------
// -------------------------------------------------------------------------------------------------
	}

}