one dimension dp, store the tmp result in vector
complex version of find last Kth node in linked list
kind of like count numebr of words in a string
continue remove duplicate node, recursive (not sure, maybe have problems) and non-recursive solution