tag:blogger.com,1999:blog-29632375.post5792961986109470148..comments2023-06-19T19:45:40.281-07:00Comments on vexorian's blog: SRM 619: Nesting min-cost matching inside dynamic programmingUnknownnoreply@blogger.comBlogger4125tag:blogger.com,1999:blog-29632375.post-15918315643093530802014-05-14T05:39:27.967-07:002014-05-14T05:39:27.967-07:00probably?probably?babanoreply@blogger.comtag:blogger.com,1999:blog-29632375.post-78538845904575384602014-05-12T08:22:21.895-07:002014-05-12T08:22:21.895-07:00Probably.Probably.vexoriannoreply@blogger.comtag:blogger.com,1999:blog-29632375.post-78497159795756132412014-05-12T05:42:18.528-07:002014-05-12T05:42:18.528-07:00Your editorial is missing the implementation of th...Your editorial is missing the implementation of the last problem (SimilarSequencesAnother). Will you post it? Thanksbabanoreply@blogger.comtag:blogger.com,1999:blog-29632375.post-68000292240930804422014-05-05T05:47:26.657-07:002014-05-05T05:47:26.657-07:00The second solution in 250 has to be at least O(n)...The second solution in 250 has to be at least O(n) to check if the input is all 1's ;pd07RiVnoreply@blogger.com