Timeline for Python: determine whether one string can be obtained by changing one character in the middle of another string
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 24, 2021 at 6:55 | comment | added | Toby Speight | I admit I haven't done any benchmarking; I certainly encourage those with an interest to do so, and to post as answers any improvements they find. Of course, it's difficult to benchmark without a good set of representative inputs, and we haven't been given that. :( | |
| Jun 23, 2021 at 21:39 | comment | added | Joe | I wonder if adding, if str1 == str2: return True would help with speed? I assume at least in cases where the strings are frequently equal, it should help more than it hurts (and it makes it a little more easy to read) | |
| Jun 23, 2021 at 13:19 | history | edited | Toby Speight | CC BY-SA 4.0 | Add complete program |
| Jun 23, 2021 at 13:17 | vote | accept | Ξένη Γήινος | ||
| Jun 23, 2021 at 12:36 | history | edited | Toby Speight | CC BY-SA 4.0 | added 2452 characters in body |
| Jun 23, 2021 at 9:59 | history | answered | Toby Speight | CC BY-SA 4.0 |