Timeline for Is there a linear-time solution to the minimum window substring problem, provided the characters in the substring must be in order?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 7, 2021 at 16:32 | vote | accept | Brooke Chalmers | ||
| Mar 7, 2021 at 13:00 | comment | added | j_random_hacker | I just realised you restrict T to constant length, so any algorithm that takes $O(|S||T|)$ time would work. The standard Needleman-Wunsch global alignment algorithm, which has this time complexity, could be easily modified to work. | |
| Mar 7, 2021 at 12:22 | answer | added | John L. | timeline score: 4 | |
| Mar 7, 2021 at 8:35 | history | edited | Brooke Chalmers | CC BY-SA 4.0 |
edited body
|
| Mar 7, 2021 at 8:07 | review | First posts | |||
| Mar 21, 2021 at 8:10 | |||||
| Mar 7, 2021 at 8:05 | history | asked | Brooke Chalmers | CC BY-SA 4.0 |