???? ?????? ?????? ?? ????? ???? ?????? ?? ??? ???? ?????? ???? ???????????? ? ??? ? ??? ?????? ?????? ????? ???? ?????? ???? ?? ???? ??????? ???? ? ??? ????? ????????? ????? ? ????????? ???? ???. ???? ???????? ?????????? ??? ?? ???????????? ??? ?????????? ??? ??? ?? ??? ??????? ? ???????? ?? ??? ?? ? ??? ?? ???? ?? ?? ?? ????? ?? ????????? ?? ?

I approached the trouble by implementing a trie and doing a depth-very first look for. Here is the code: supplied an variety of strings terms (without having duplicates), return each of the concatenated phrases during the supplied listing of A concatenated phrase is outlined to be a string that is certainly comprised solely of a minimum of ssssss

?????? ? ?????????? ?? ????????? ???? ???? ???? ?? ?? ????! ?? ???? ??? ???? ?? ????? ????? ? ???? ??? ??????? ?? ????????? ?? ??????? ??? ? ???? ???????? ??? ?????? ?? ???? ????? ? ????????? ?? ?? ???? ?????? ???? ?????? ??????? ????? ?????? ???? ???. ????? ??? ?? ???? ???? ??? ?? ?? ???? ????? ? ???? ??????????? ?? ???? ????. ????? ?? ???? ???