# Determine whether strings are anagrams

## Challenge

Given two strings, work out if they both have exactly the same characters in them.

## Example

Input

word, wrdo

This returns true because they are the same but just scrambled.

Input

word, wwro

This returns false.

Input

boat, toba

This returns true

## Rules

Here are the rules!

• Assume input will be at least 1 char long, and no longer than 8 chars.
• No special characters, only az
• All inputs can be assumed to be lowercase

## Test Cases

boat, boat = true
toab, boat = true
oabt, toab = true
a, aa = false
zzz, zzzzzzzz = false
zyyyzzzz, yyzzzzzy = true
sleepy, pyels = false
p,p = true

• 9 answers in 13 views... wow! Commented Mar 8, 2011 at 16:44
• Title request: Cod Elf, Go!
– user54200
Commented Jul 9, 2016 at 12:48
• "Falcon Rage, go mad!" Commented Oct 6, 2016 at 17:25
• My name suggestion: "are they anagrams" → "manage the arrays" Commented Oct 31, 2017 at 4:32
• Suggested test case: aaab, bbba = false Commented Aug 3, 2022 at 23:56

C++ Counting sort, fixed version

int a(char*x,char*y){int i=0,u[256];while(i<256)u[i++]=0;
while(*x&&*y)u[*x++]++,u[*y++]--;if(*x||*y)return 0;
for(i=255;i&&!u[i--];);return!i;}


Unrolled, so you can see what's going on:

int a(const char *x,const char *y) {
int i=0,u[256];for(;i<256;u[i++]=0);
for(i=0;x[i]&&y[i];i++)u[x[i]]++,u[y[i]]--;
if(x[i]||y[i])return 0;
for(i=0;i<256 && !u[i];i++);
return (i==256);
}


(with due credit to Matthew Read's very elegant counting sort strategy)

• Are you aware of George's userscript for this site? Very nice, but it always scores the first codeblock in an answer, so it is helpful to put the golfed version at the top. Commented Mar 10, 2011 at 0:11
• Cheers. Edited :) Commented Mar 11, 2011 at 1:13

Perl - 78 characters[1]

@x=map{join("",sort(split("")))}split(",",<>);print$x[0]eq$x[1]?"true":"false";


[1] Unlike some other Perl code above, this actually reads the input in "foo,bar" format and prints "true" or "false". Could be shorter otherwise.

## Python 3 (64)

This is not a particularly good golf given how short some of the earlier Python solutions that use sorted() are, but here's a version that uses collections.Counter (an unlovable module from a golfing perspective, but with some neat stuff). It reads two lines from input and outputs True or False. Going with Python 3 versus 2.7 saved 4 chars with input() instead of raw_input(), but lost 1 for the parens for print since it is now a function.

from collections import *;c,i=Counter,input;print(c(i())==c(i()))

• Shave one character by changing import * to import*. Commented Sep 13, 2011 at 18:01
• I tried your challenge of not using sorted, but also avoided using collections.Counter. Best I was able to get was 66 character. Commented Sep 13, 2011 at 18:03

### Python 2, without sorting as that starts to get boring - 104 chars

def f(a,b):
a,b=list(a),list(b)
while a:
try:b.remove(a.pop())
except:return
return len(a)==len(b)


## Clojure - 30 chars

Too many people seem to be relying on sorting so I thought of an interesting alternative way to do this via a histogram:

#(apply = (map frequencies %))


Use this as a function, i.e.:

(#(apply = (map frequencies %)) ["boat" "toab"])
=> true


## Python 3 (66)

Like jloy's answer, I eschewed using sorted because so many other answers did so. I also didn't want to rehash his use of collections.Counter so I used str.count instead. With these constraints I got within 3 characters of jloy.

i=input;a=i();b=i();print(all(a.count(s)==b.count(s)for s in a+b))

• good use of semicolons! Commented Sep 14, 2011 at 21:29

k4 - 11 chars

Given strings a and b:

(a@<a)~b@<b

a:"word"
b:"wrdo"
(a@<a)~b@<b
1b


At the cost of 2 chars this can be made into a function:

{(x@<x)~y@<y}["word";"wrdo"]
1b


Implementation is same as the J implementation; sort the vectors then compare equivalence.

~ is match

< is grade up (indices were the vector to be sorted ascending)

@ is index

• If you take input as a list of two strings you can do slightly better: ~/{x@<x}'("baot";"boat") Commented Aug 3, 2015 at 21:49

# Q, 25

{(~). asc each(,/)each x}


sample output:

q){(~). asc each(,/)each x}("boat";"boat")
1b
q){(~). asc each(,/)each x}("toab";"boat")
1b
q){(~). asc each(,/)each x}("oabt";"toab")
1b
q){(~). asc each(,/)each x}("a";"aa")
0b
q){(~). asc each(,/)each x}("zzz";"zzzzz")
0b
q){(~). asc each(,/)each x}("zyyyzzzzz";"yyzyzzzzz")
1b
q){(~). asc each(,/)each x}("p";"p")
1b


# Bash (66 58)

f(){ fold -w1<<<$1|sort;} g(){ [ "$(f $1)" == "$(f $2)" ];}  Call it with g <word1> <word2>. Edit: Stupid me, I do not need to unic -c after I sort • FYI: TIO link with working code. $? emits 0 if the inputs are anagrams (truthy), 1 if not. Commented Nov 22, 2022 at 4:53

# Python - 137 chars

def h(s):
r={}
for c in s:
try:r[c]+=1
except:r[c]=1
return r
x=raw_input().split(',')
print h(x[0])==h(x[1])


Sample: (I defined a function anagram to do the work of the last 2 lines.)

   anagram('boat','boat')
True
anagram('toab','boat')
True
anagram('oabt','toab')
True
anagram('a','aa')
False
anagram('zzz','zzzzzzzz')
False
anagram('zyyyzzzz','yyzzzzzy')
True
anagram('sleepy','pyels')
False
anagram('p','p')
True


## Groovy 42

def f(a,b){print ((b as Set)==(a as Set))}


# Pyth - 87 6

MqSGSH


Defines function with two args, the two words.

M       define function g with two args, G and H
q       equals
SQ     sorted first arg
SH     sorted last arg


If that cheating golfscript program counts with hardcoded input, we can do that too with : qSS

And for just two more characters you can have it check an infinite number of words:

ql{mSdQ1

q    1       Equals 1
l           Length
{          Set constructor (eliminate all duplicates)
m  Q      Map on evaluated input
Sd       Sort each element

• How would qSS work? I am trying to learn pyth and I am curious. Commented Jan 27, 2015 at 20:07
• @ericmark26 its the same as the golfscript and its cheating because it need hardcoding. qss just means equals, sort, sort. You'll have to put the strings after the S's Commented Jan 27, 2015 at 20:35

# C - 107 chars

Mark off chars in second string as we go. At the end, if we've passed over the entirety of both strings, then we've got a match.

i;main(p,v)char**v,*p;{for(;*v[1]&(p=strchr(v[2],*v[1]++));)*p=1,i++;puts(*(v[2]+i)|*v[1]?"false":"true");}


# C, (108)

char c[192]={};main(){for(;*a;c[127-*a++]++);for(;*b;c[223-*b++]++);puts(memcmp(c,c+96,95)?"false":"true");}


# PowerShell, 78 51 bytes

param([char[]]$a,[char[]]$b)(diff $a$b).Length-eq0


Takes the two string inputs, and re-casts them as char-arrays. The diff function (an alias for Compare-Object) takes the two arrays and returns items that are different between the two. We leverage that by re-casting the return as an array with (), and then checking its length. If the length is zero, that means that all items of both character arrays are exactly the same (because nothing was returned). PowerShell has an implicit write for evaluated statements like this, so will automatically write out True or False as required.

## Q, 15 Bytes

f:{~/{x@<x}'x}


f is the name of the function

Test

f("boat";"boat")            /1b
f("toab";"boat")            /1b
f("oabt";"toab")            /1b
f(,"a";"aa")                /0b
f("zzz";"zzzzzzzz")         /0b
f("zyyyzzzz";"yyzzzzzy")    /1b
f("sleepy";"pyels")         /0b
f(,"p";,"p")                /1b


Explanation

Argument of the function is a sequence with both words. At each word applies {x@<x}, that sorts x (take from x in ascending index ordering). ~/ reads as "match over", and compares both transformed words

• If you're using k rather than Q you can just do ~/x@'<:'x: for 10 bytes. No need to create the outer function f nor the inner function if you set x to be the input.
– mkst
Commented Oct 31, 2017 at 9:19

## JavaScript, shortest JS answer so far: 57 56 characters, acccepts user input

This prompts the user for a value to compare.

function _(){return prompt().split(0).sort()+''}_()==_()


If no user input is required, this can be trimmed down to 53 52 characters.

Assuming the following variables are set:

var a='test', b='sets';


you can test for it with the following:

function _(a){return a.split(0).sort()+''}_(a)==_(b)


Note: this answer relies on some quirk that allowed using .split(0) instead of .split(""). This behavior no longer exists (at least in Firefox), so to get it running today, you have to replace 0 with "".

## Retina, 10 bytes

This answer is non-competing since Retina is much newer than this challenge. Byte count assumes ISO 8859-1 encoding.

%O.
D
¶$ Input is linefeed-separated. Try it online! ### Explanation %O.  This sorts (O) the individual characters (.) in each line (%), i.e. it sorts each input string separately. D  This deduplicates the input on the (implicit) regex .*, which means it removes the characters from the second line if both strings are equal. ¶$


Finally, this tries to match a linefeed followed by the end of the string. Since the input strings are guaranteed to be non-empty, this can only happen if the second string was removed in the previous stage.

# C++14, 104 bytes

As generic function returning via reference parameter. Accepts char[] or std::string or any other container that supports range-based for loop.

Returns 0 for anagram, anything else for non-anagram

#define F(X) for(auto x:X)
void f(auto&A,auto&B,int&r){int C[256]={r=0};F(A)C[x]++;F(B)C[x]--;F(C)r|=x;}


Ungolfed and usage:

#include<iostream>

#define F(X) for(auto x:X)

void f(auto&A,auto&B,int&r){
int C[256]={r=0}; //declare counting array and set return value to 0
F(A)C[x]++;       //increase first string chars
F(B)C[x]--;       //decrease second string chars
F(C)r|=x;         //if any char is not zero
}

int main(){
int r;
#define P(a,b) f(a,b,r); std::cout << a << ", " << b << " -> " << r << "\n"
P("hello","wrong");
P("hello","olleh");
P("zz","zzzzzz");
}


## Mathematica 28 Bytes

Split into list of characters, sort and test for equality.

Equal@@ Sort/@Characters[#]&


Usage

%@{"BOAT", "TOAB"}


Output

True


# Jelly, 3 bytes (probably non-competing)

Ṣ€E


Try it online!

Similar to X88B88's solution, but this takes a list of strings instead of two arguments, like ["String1", "String2"].

Explanation:

Ṣ€      Sort each input
E     Check equality


# Wolfram Language 26 bytes ( Mathematica )

ContainsAll@@Characters@#&


Usage:

%@{"BOAT","TOAB"}


Output:

True

# Perl 5, 27 + 3 (-lF) = 30 bytes

@{$.}=sort@F}{say"@1"eq"@2"  Try it online! • The -l option is not needed. It would still count as +3 though since you must count the space too (since you cannot bundle the -F with -E. You can however do the final match using @1~~@2 saving 4 bytes (or 3 if you add an extra X option letter to supress the warning). Very neat solution by the way. Have a +1 Commented Feb 4, 2018 at 11:43 # Lua, 140 chars t={io.read():match"(%w+), (%w+)"}T=table for k=1,2 do w={t[k]:byte(1,-1)}T.sort(w)t[k]=T.concat{string.char(unpack(w))}end print(t[1]==t[2])  ... like driving a screw with a light weight hammer, at least for code-golfing # Python 2, 79 bytes I thought I would add a different Python approach: import sys for l in sys.stdin: not reduce(cmp,map(sorted,l.strip().split(',')))  Or as a function: def f(*v): return not reduce(cmp,map(sorted,v))  ## Scala, 84 characters object A{def main(a: Array[String]){println(a(0).sortWith(_<_)==a(1).sortWith(_<_))}}  This one's slightly longer, but doesn't use sorting (92 characters): object A{def main(a:Array[String]){print((a(0)diff a(1)).isEmpty&&(a(1)diff a(0)).isEmpty)}}  • You can use sorted instead of sortWith. I posted another reply with sorted as well as REPL and function versions. Commented Mar 9, 2011 at 6:15 • @ebruchez Thanks, I'm just learning Scala at the moment and these make good exercises. :-) Commented Mar 9, 2011 at 10:19 • Still learning myself ;) Commented Mar 9, 2011 at 16:17 # Common Lisp, 50 bytes (lambda(a b)(string=(sort a'char<)(sort b'char<)))  Try it online! # Japt, 1095 4 bytes á øV  Try it á øV :Implicit input of strings U & V á :Permutations of U øV :Contains V?  # SmileBASIC, 49 bytes INPUT A$,B$WHILE""<A$B$[INSTR(B$,POP(A\$))]="
WEND


Throws an error when the strings aren't anagrams.

# Symja, 26 bytes

f(x_,y_):=Sort(x)==Sort(y)


Try It Online!

Try With Changeable Tests

Assumes strings are given as a list of characters.