xxxxxxxxxx
def anagram(a, b):
return True if sorted(a) == sorted(b) else False
# Based on the answer below :D
xxxxxxxxxx
def isAnagram(A,B):
if sorted(A) == sorted(B):
print("Yes")
else:
print("No")
isAnagram("earth","heart") #Output: Yes
#Hope this helps:)
xxxxxxxxxx
var firstWord = "Mary";
var secondWord = "Army";
isAnagram(firstWord, secondWord); // true
function isAnagram(first, second) {
// For case insensitivity, change both words to lowercase.
var a = first.toLowerCase();
var b = second.toLowerCase();
// Sort the strings, and join the resulting array to a string. Compare the results
a = a.split("").sort().join("");
b = b.split("").sort().join("");
return a === b;
}
xxxxxxxxxx
import java.util.Arrays;
public class AnagramString {
static void isAnagram(String str1, String str2) {
String s1 = str1.replaceAll("\\s", "");
String s2 = str2.replaceAll("\\s", "");
boolean status = true;
if (s1.length() != s2.length()) {
status = false;
} else {
char[] ArrayS1 = s1.toLowerCase().toCharArray();
char[] ArrayS2 = s2.toLowerCase().toCharArray();
Arrays.sort(ArrayS1);
Arrays.sort(ArrayS2);
status = Arrays.equals(ArrayS1, ArrayS2);
}
if (status) {
System.out.println(s1 + " and " + s2 + " are anagrams");
} else {
System.out.println(s1 + " and " + s2 + " are not anagrams");
}
}
public static void main(String[] args) {
isAnagram("Keep", "Peek");
isAnagram("Mother In Law", "Hitler Woman");
}
}
xxxxxxxxxx
const anagram = (str1, str2) => {
return str1.toLowerCase().split('').sort().join('') === str2.toLowerCase().split('').sort().join('');
};
let test = anagram('Regallager', 'Lagerregal');
console.log(test);
xxxxxxxxxx
from collections import defaultdict
def findAnagrams(input_str):
anagram = defaultdict(list)
for word in input_str:
anagram[str(sorted(word))].append(word)
return list(anagram.values())