Timeline for Finding longest substring containing k distinct characters
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 12, 2016 at 15:28 | comment | added | user102691 | This post has a detailed analysis of this question http://blog.gainlo.co/index.php/2016/04/12/find-the-longest-substring-with-k-unique-characters/ | |
| Jul 12, 2015 at 7:22 | vote | accept | Nishant | ||
| Jul 12, 2015 at 7:03 | comment | added | Nishant | @200_success yes, you can say. Sorry if my question was not clear. | |
| Jul 12, 2015 at 5:10 | comment | added | 200_success | Would it be clearer to say "longest substring containing no more than k distinct characters"? | |
| Jul 12, 2015 at 4:35 | history | tweeted | twitter.com/#!/StackCodeReview/status/620088956399546368 | ||
| Jul 12, 2015 at 1:49 | answer | added | maaartinus | timeline score: 5 | |
| Jul 12, 2015 at 1:29 | answer | added | dpmcmlxxvi | timeline score: 3 | |
| Jul 12, 2015 at 1:20 | history | edited | Jamal | CC BY-SA 3.0 | deleted 7 characters in body |
| Jul 12, 2015 at 0:34 | history | asked | Nishant | CC BY-SA 3.0 |