Timeline for Determine whether strings are anagrams
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| S Feb 3, 2018 at 19:46 | history | suggested | jrtapsell | CC BY-SA 3.0 |
Standardised header
|
| Feb 3, 2018 at 19:07 | review | Suggested edits | |||
| S Feb 3, 2018 at 19:46 | |||||
| Aug 15, 2015 at 11:41 | comment | added | Adam Katz |
I prefer this as ($c,$d)=map{[sort split//]}@ARGV;exit("@$c"ne"@$d") (51 chars) so it can take command line arguments and use the command line exit codes. It'd be 48 chars retaining <> with a multi-line input.
|
|
| Sep 17, 2011 at 20:21 | comment | added | Timwi | Thanks! | |
| Sep 17, 2011 at 20:21 | history | edited | Timwi | CC BY-SA 3.0 |
deleted 4 characters in body
|
| Sep 17, 2011 at 17:30 | comment | added | Joel Berger |
of course you can save 4 chars in the program by removing the " around true and false, since without using strict/warnings a bareword is a string.
|
|
| Mar 8, 2011 at 16:22 | history | answered | Timwi | CC BY-SA 2.5 |