Return all strings in the list that can be formed by concatenating at least two other words from the same list. This is a word-break style problem (use DP/trie + memoization) to efficiently test each word given total input size up to 1e5.
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
Given a large list of words, find all combinations where one word is a composite of two or more words from the same list. Input: [rockstar, rock, stars, rocks, tar, star, rockstars, super, highway, high, way, superhighway]. Output: [[rock, star], [rocks, tar], [super, highway], [super, high, way],...]
Nenhum anexo público associado a esta pergunta.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.
Amazon