Timeline for Optimizing an Anagram Solver
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 11:33 | history | edited | Community Bot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Apr 13, 2017 at 12:40 | history | edited | Community Bot |
replaced http://codereview.stackexchange.com/ with https://codereview.stackexchange.com/
|
|
| S Oct 23, 2015 at 17:14 | history | suggested | boardrider | CC BY-SA 3.0 |
English/Python syntax
|
| Oct 23, 2015 at 16:32 | review | Suggested edits | |||
| S Oct 23, 2015 at 17:14 | |||||
| Dec 28, 2014 at 18:23 | comment | added | DJanssens | That's the approach being described by thepace ;) | |
| Dec 28, 2014 at 16:59 | comment | added | Santiago | I would say that there's a better approach than sorting. And it is counting letters. Simply then see if each word has the same amount of letters. I'm not sure about that, though. | |
| Dec 28, 2014 at 2:30 | history | edited | DJanssens | CC BY-SA 3.0 |
added 93 characters in body
|
| Dec 28, 2014 at 2:18 | history | answered | DJanssens | CC BY-SA 3.0 |