Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Stack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Explore Stack Internal#sed, 45 chars
It's even possible in my favourite - sed! Just one regular expression to solve the anagram! Just keep removing the corresponding letters:
: s/(.)(.*,.*)\1/\2/ t /\w/{i\false d} i\true (to be invoked with -nE)
#Perl, 48
1while s/(.)(.*,.*)\1/\2/;$_=/\w/?"false":"true" To be invoked with -p.
#Perl function, 39
sub f{$,while s/(.)(.*,.*)\1/\2/;!/\w/} #sed, 45 chars
It's even possible in my favourite - sed! Just one regular expression to solve the anagram! Just keep removing the corresponding letters:
: s/(.)(.*,.*)\1/\2/ t /\w/{i\false d} i\true (to be invoked with -nE)
#Perl, 48
1while s/(.)(.*,.*)\1/\2/;$_=/\w/?"false":"true" To be invoked with -p.
#Perl function, 39
sub f{$,while s/(.)(.*,.*)\1/\2/;!/\w/} It's even possible in my favourite - sed! Just one regular expression to solve the anagram! Just keep removing the corresponding letters:
: s/(.)(.*,.*)\1/\2/ t /\w/{i\false d} i\true (to be invoked with -nE)
1while s/(.)(.*,.*)\1/\2/;$_=/\w/?"false":"true" To be invoked with -p.
sub f{$,while s/(.)(.*,.*)\1/\2/;!/\w/} #sed, 45 chars
It's even possible in my favourite - sed! Just one regular expression to solve the anagram! Just keep removing the corresponding letters:
: s/(.)(.*,.*)\1/\2/ t /\w/{i\false d} i\true (to be invoked with -nE)
#Perl, 4948
$,while1while s/(.)(.*,.*)\1/\2/;$_=/\w/?"false":"true" To be invoked with -p.
#Perl function, 39
sub f{$,while s/(.)(.*,.*)\1/\2/;!/\w/} #sed, 45 chars
It's even possible in my favourite - sed! Just one regular expression to solve the anagram! Just keep removing the corresponding letters:
: s/(.)(.*,.*)\1/\2/ t /\w/{i\false d} i\true (to be invoked with -nE)
#Perl, 49
$,while s/(.)(.*,.*)\1/\2/;$_=/\w/?"false":"true" To be invoked with -p.
#Perl function, 39
sub f{$,while s/(.)(.*,.*)\1/\2/;!/\w/} #sed, 45 chars
It's even possible in my favourite - sed! Just one regular expression to solve the anagram! Just keep removing the corresponding letters:
: s/(.)(.*,.*)\1/\2/ t /\w/{i\false d} i\true (to be invoked with -nE)
#Perl, 48
1while s/(.)(.*,.*)\1/\2/;$_=/\w/?"false":"true" To be invoked with -p.
#Perl function, 39
sub f{$,while s/(.)(.*,.*)\1/\2/;!/\w/} #sed, 45 chars
It's even possible in my favourite - sed! Just one regular expression to solve the anagram! Just keep removing the corresponding letters:
: s/(.)(.*,.*)\1/\2/ t /\w/{i\false d} i\true (to be invoked with -nE)
#Perl, 49
$,while s/(.)(.*,.*)\1/\2/;$_=/\w/?"false":"true" Uses just one regular expression to solve the anagram! It does so by keeping removing the corresponding letters. To be invoked with -p.
#Perl function, 39
sub f{$,while s/(.)(.*,.*)\1/\2/;!/\w/} #Perl, 49
$,while s/(.)(.*,.*)\1/\2/;$_=/\w/?"false":"true" Uses just one regular expression to solve the anagram! It does so by keeping removing the corresponding letters. To be invoked with -p.
#Perl function, 39
sub f{$,while s/(.)(.*,.*)\1/\2/;!/\w/} #sed, 45 chars
It's even possible in my favourite - sed! Just one regular expression to solve the anagram! Just keep removing the corresponding letters:
: s/(.)(.*,.*)\1/\2/ t /\w/{i\false d} i\true (to be invoked with -nE)
#Perl, 49
$,while s/(.)(.*,.*)\1/\2/;$_=/\w/?"false":"true" To be invoked with -p.
#Perl function, 39
sub f{$,while s/(.)(.*,.*)\1/\2/;!/\w/}