Determine whether strings are anagrams

Question

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 a–z
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

My name suggestion: "are they anagrams" → "manage the arrays" — Esolanging Fruit
– Esolanging Fruit, Commented Oct 31, 2017 at 4:32

Deadcode · Accepted Answer · 2022-08-04 02:19:31Z

Vyxal, 2 bytes

Þ⊍

Try it Online!

Takes two strings pushed separately onto the stack as input. Returns inverted output (falsey if the strings are anagrams of each other, truthy if they are not).

Þ⊍ # Multiset Symmetric Difference - yields a list of the characters in A that # aren't in B and the characters in B that aren't in A. Will be empty iff A # is an anagram of B.

Vyxal, 3 bytes

Þ⊍¬

Try it Online!

Takes two strings pushed separately onto the stack as input. Returns 1 if the strings are anagrams of each other and 0 otherwise.

Þ⊍ # Multiset Symmetric Difference - yields a list of the characters in A that # aren't in B and the characters in B that aren't in A. Will be empty iff A # is an anagram of B. ¬ # Logical Not - When used on a list (as is the case here) returns 1 for an # empty list and 0 for a non-empty list (even a list containing one 0 in it)

Vyxal, 3 bytes

vs≈

Try it Online!

Takes a list of two strings as input. Returns 1 if the strings are anagrams of each other and 0 otherwise.

vs # Vectorized sort (sort the characters in each individual item) ≈ # All Equal

Sean · Accepted Answer · 2022-11-18 20:11:52Z

Raku, 22 bytes

{[~~] @_».comb».Bag}

Try it online!

.comb converts each input string to a list of its characters.
.Bag converts each list of characters into a Bag object (a set with multiplicity).
[~~] inserts the ~~ smartmatch operator between the two Bags, which returns true if and only if they have the same contents.

The Thonnu · Accepted Answer · 2023-05-28 14:30:38Z

Thunno 2, 3 bytes

€Ṡạ

Attempt This Online!

Explanation

€Ṡạ # Implicit input € # Apply to both strings: Ṡ # Sort the string ạ # Are they both equal? # Implicit output

pajonk · Accepted Answer · 2024-07-22 09:31:33Z

2

R, 45 39 36 bytes

Edit: -9 bytes thanks to @Dominic van Essen.

\(x,y)identical(table(x),table(x=y))

Attempt This Online!

Takes input as two character vectors.

edited Jul 22, 2024 at 9:31

answered Jul 22, 2024 at 8:15

pajonk

19.4k5 gold badges29 silver badges78 bronze badges

\$\begingroup\$ Why do you need the dnn=0 argument? \$\endgroup\$

Dominic van Essen
– Dominic van Essen

2024-07-22 08:42:10 +00:00
Commented Jul 22, 2024 at 8:42
\$\begingroup\$ Actually, I don't anymore! It was necessary when I tested it with identical(table(x),table(y)) \$\endgroup\$

pajonk
– pajonk

2024-07-22 08:44:00 +00:00
Commented Jul 22, 2024 at 8:44
1

\$\begingroup\$ 36 bytes \$\endgroup\$

Dominic van Essen
– Dominic van Essen

2024-07-22 08:53:10 +00:00
Commented Jul 22, 2024 at 8:53

Add a comment |

colmmurphyxyz · Accepted Answer · 2024-08-06 21:11:34Z

Setanta 72 Bytes

gniomh(a,b){toradh sortáil@(go_liosta@a())()==sortáil@(go_liosta@b())()}

Naive solution for a very limited language. Accepts two strings and returns true if their sorted char arrays are equal

Try it online

I think the accents shouldn’t be there (it would be 74 bytes with sortáil instead of sortail). — bb94
– bb94, Commented Jun 24 at 23:10

MAK · Accepted Answer · 2011-03-09 06:04:12Z

Yet another Python answer :). (43 characters including whitespace)

This also includes reading in input and displaying output.

i,s=raw_input,sorted print s(i())==s(i())

user353 · Accepted Answer · 2011-03-09 11:41:05Z

PHP (51 chars, compressed)

function d($s){$s=str_split($s);sort($s);return$s;}

(Split string into an array, sort the array and return)

Example:

var_dump(d("word")===d("drow"));

user814 · Accepted Answer · 2011-03-09 12:58:55Z

1

Ruby (35)

a,b=ARGV;a.chars.sort==b.chars.sort

answered Mar 9, 2011 at 12:58

user814

1

\$\begingroup\$ (Five years later...) $* is a handy alias for ARGV for 2 bytes. \$\endgroup\$

Jordan
– Jordan

2016-08-18 05:32:09 +00:00
Commented Aug 18, 2016 at 5:32

Add a comment |

Hannesh · Accepted Answer · 2011-03-09 13:09:22Z

1

Matlab (24)

Given two strings a and b.

isequal(sort(a),sort(b))

answered Mar 9, 2011 at 13:09

Hannesh

1,2551 gold badge10 silver badges14 bronze badges

Add a comment |

Dave Gamble · Accepted Answer · 2011-03-11 01:13:47Z

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. — dmckee --- ex-moderator kitten
– dmckee --- ex-moderator kitten, Commented Mar 10, 2011 at 0:11

Community · Accepted Answer · 2020-06-17 09:04:33Z

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)

Community · Accepted Answer · 2020-06-17 09:04:33Z

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

Community · Accepted Answer · 2017-04-13 12:39:14Z

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))

\$\begingroup\$ good use of semicolons! \$\endgroup\$

Andbdrew
– Andbdrew

2011-09-14 21:29:27 +00:00
Commented Sep 14, 2011 at 21:29 — Andbdrew
– Andbdrew, Commented Sep 14, 2011 at 21:29

frank · Accepted Answer · 2011-09-13 22:01:24Z

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") — JohnE
– JohnE, Commented Aug 3, 2015 at 21:49

tmartin · Accepted Answer · 2012-03-11 02:21:34Z

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

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

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

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Feb 9, 2014 at 18:40

christofsteel

212 bronze badges

\$\begingroup\$ FYI: TIO link with working code. $? emits 0 if the inputs are anagrams (truthy), 1 if not. \$\endgroup\$

roblogic
– roblogic

2022-11-22 04:53:37 +00:00
Commented Nov 22, 2022 at 4:53

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

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

md_rasler · Accepted Answer · 2014-03-31 03:02:36Z

1

Groovy 42

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

answered Mar 31, 2014 at 3:02

md_rasler

2111 silver badge4 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

Pyth - 8 7 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. — ericmarkmartin
– ericmarkmartin, 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 — Maltysen
– Maltysen, Commented Jan 27, 2015 at 20:35

Cole Cameron · Accepted Answer · 2015-07-31 14:09:41Z

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");}

ehmu · Accepted Answer · 2015-10-05 16:05:10Z

C, (108)

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

Community · Accepted Answer · 2020-06-17 09:04:33Z

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.

J. Sendra · Accepted Answer · 2016-05-21 17:22:06Z

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
– mkst, Commented Oct 31, 2017 at 9:19

user2428118 · Accepted Answer · 2016-07-08 07:23:39Z

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 "".

Martin Ender · Accepted Answer · 2016-08-17 15:18:55Z

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.

Community · Accepted Answer · 2020-06-17 09:04:33Z

R, 69 bytes

a=function(b,d)identical(table(strsplit(b,"")),table(strsplit(d,"")))

I think this is the shortest R implementation which deals with a("b","bb") being FALSE.

score 1 · Accepted Answer · 2016-10-07 09:56:02Z

C 87 bytes

char*a,*b,*c;d(i,k){return!a[i]||!(c=strchr(b,a[i]))?i==k+1:(*c=1,d(i+1,k<c-b?c-b:k));}

this is one recursive function that has one not common way to have its input and write in one its argument...this use recursion + library function...

/* char*a,*b,*c; d(i,k) {return !a[i]||!(c=strchr(b,a[i]))?i==k+1:(*c=1,d(i+1,k<c-b?c-b:k));} 87 */ main() {char m1[]="12345", m2[]="54321", m3[]="a", m4[]="e"; int r; a=m1;b=m2;r=d(0,0);printf("r=%d m1=%s m2=%s\n", r, m1, m2); a=m3;b=m4;r=d(0,0);printf("r=%d m3=%s m4=%s\n", r, m3, m4); }

How it is possible 20 min ago I not remember a C solution less than 109 bytes, now I read C solutions less bytes than 80 bytes edited in 2011... — user58988
– user58988, Commented Oct 7, 2016 at 10:56

DJMcMayhem · Accepted Answer · 2016-10-20 17:49:06Z

C 110 bytes

char*a,*b;l(i,j,k){y:if(!b[j]||!a[i])return i==k+1;if(a[i]==b[j]){b[j]=1;return l(i+1,0,j>k?j:k);}++j;goto y;}

this is one recursive function that has one not common way to have its input and write in one its argument... but not use library functions....

/* l(i,j,k) {y: if(!b[j]||!a[i])return i==k+1; if(a[i]==b[j]){b[j]=1;return l(i+1,0,j>k?j:k);} ++j;goto y; } //110 r=1 m1=12345 m2=????? r=0 m3=a m4=e */ main() {char m1[]="12345", m2[]="54321", m3[]="a", m4[]="e"; int r; a=m1;b=m2;r=l(0,0,0);printf("r=%d m1=%s m2=%s\n", r, m1, m2); a=m3;b=m4;r=l(0,0,0);printf("r=%d m3=%s m4=%s\n", r, m3, m4); }

\$\begingroup\$ Please do not vandalize your posts. \$\endgroup\$

DJMcMayhem
– DJMcMayhem

2016-10-20 17:49:41 +00:00
Commented Oct 20, 2016 at 17:49 — DJMcMayhem
– DJMcMayhem, Commented Oct 20, 2016 at 17:49

Community · Accepted Answer · 2020-06-17 09:04:33Z

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"); }

Kelly Lowder · Accepted Answer · 2016-12-27 21:00:08Z

Mathematica 28 Bytes

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

Equal@@ Sort/@Characters[#]&

Usage

%@{"BOAT", "TOAB"}

Output

True

Stack Exchange Network

Determine whether strings are anagrams

Challenge

Example

Rules

Test Cases

171 Answers 171

Vyxal, 2 bytes

Vyxal, 3 bytes

Vyxal, 3 bytes

Raku, 22 bytes

Thunno 2, 3 bytes

Explanation

R, 45 39 36 bytes

Setanta 72 Bytes

Ruby (35)

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

Clojure - 30 chars

Python 3 (66)

Q, 25

Bash (66 58)

Python - 137 chars

Groovy 42

Pyth - 8 7 6

C - 107 chars

C, (108)

PowerShell, 78 51 bytes

Q, 15 Bytes

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

Retina, 10 bytes

Explanation

R, 69 bytes

C++14, 104 bytes

Mathematica 28 Bytes

Linked

Hot Network Questions

Determine whether strings are anagrams

Challenge

Example

Rules

Test Cases

171 Answers 171

Vyxal, 2 bytes

Vyxal, 3 bytes

Vyxal, 3 bytes

Raku, 22 bytes

Thunno 2, 3 bytes

Explanation

R, 45 39 36 bytes

Setanta 72 Bytes

Ruby (35)

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

Clojure - 30 chars

Python 3 (66)

Q, 25

Bash (66 58)

Python - 137 chars

Groovy 42

Pyth - 8 7 6

C - 107 chars

C, (108)

PowerShell, 78 51 bytes

Q, 15 Bytes

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

Retina, 10 bytes

Explanation

R, 69 bytes

C++14, 104 bytes

Mathematica 28 Bytes

Linked

Related

Hot Network Questions