Y
Hacker News
new
|
ask
|
show
|
jobs
by
rcheu
2055 days ago
This is the shortest common supersequence problem (
https://en.wikipedia.org/wiki/Shortest_common_supersequence_...
). It's NP-hard if you include repeating numbers; there's no simple changes to make your solution work in that case.
1 comments
tasuki
2055 days ago
Thank you, I felt this was important and just hand waved away in the article.
link