Timeline for Program to check whether two strings are anagrams of each other
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 7, 2016 at 17:10 | comment | added | Der Kommissar |
You should consider extracting map1.get(word1[i]) and map2.get(word2[i]) in those for loops into variables for a (presumably) small performance improvement (in a situation where a string contains duplicated characters you call map#.get(word#[i]) twice for each of those characters).
|
|
| Nov 7, 2016 at 17:07 | history | edited | Jamal | CC BY-SA 3.0 |
added 17 characters in body
|
| Nov 7, 2016 at 16:46 | review | First posts | |||
| Nov 7, 2016 at 17:07 | |||||
| Nov 7, 2016 at 16:43 | history | answered | Hypnic Jerk | CC BY-SA 3.0 |