You are given a string s of length n. You want to find all the distinct non-empty strings that can be formed from s such that:
No two adjacent characters from the string s are chosen in the string that we make from s.

Q&A Education