Given a string and a dictionary, return true when every piece of the string of length 3 or more is a valid word. (The report says subsequences; confirm with the interviewer whether pieces are contiguous.) Follow-up: return true when every such piece can be rearranged into a valid word.

Is every 3+ letter piece of a string a dictionary word?

GoogleCodingLast asked Mar 2026

Given a string and a dictionary, return true when every piece of the string of length 3 or more is a valid word. (The report says subsequences; confirm with the interviewer whether pieces are contiguous.)
Follow-up: return true when every such piece can be rearranged into a valid word.

Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding