you give 0indexed array string word each string consists lowercase english letter no letter occur string wordsTwo string s1 s2 say connect set letter s2 obtain set letter s1 follow operationsadde exactly letter set letter s1delete exactly letter set letter s1replace exactly letter set letter s1 letter include itselfThe array word divide nonintersecte group a string belong group follow trueIt connect string groupit string present groupnote string word group manner string belong group connect string present group it prove arrangement uniquereturn array an size 2 whereans0 maximum number group word divide andans1 size large group Example 1input word ababcdeoutput 23explanation words0 obtain words1 replace b words2 add b so words0 connect words1 words2 words1 obtain words0 replace b words2 add so words1 connect words0 words2 words2 obtain words0 delete b words1 delete so words2 connect words0 words1 words3 connect string wordsthu word divide 2 group abab cde the size large group 3 Example 2input word aababcoutput 13explanation words0 connect words1 words1 connect words0 words2 words2 connect words1since string connect group togetherThus size large group 3 Constraints1 wordslength 2 1041 wordsilength 26wordsi consists lowercase english letter onlyNo letter occur wordsi