For this question you can simply bruteforce using back-tracking and get all the subsequences that match the requirements. But is there a better way to do a question like this? Please advise if you know.