CT29098

Urmila's Gilded Ledger

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Before the gates of the railway depot of Cinderline close for winter, Urmila must finish the panels ledger - one figure at a time. Task: Print the length of the longest substring of s containing at most k distinct characters. Input format: One line: k then string s (space-separated). Output format: Print the maximum length. Constraints: 1 <= k <= 26; 1 <= |s| <= 4000; lowercase letters.

Example 1:

Input: 4 hbihhabicceicbgcfebdgbdjbaedhgbddghidadfagiagibiefbhbhfhbijjeajeiceajcgcifadjfdcjcjijgffeeaecjehjiajgidebgfiahfffaciehjddgjdejgaijdhfbagebafgjcccajjebbjbeifjjhiijaacahcfbagbeejjcajgaghjfbhdaibbdbehcbiibedfgibaghecjb
Output: 9

Example 2:

Input: 8 agbhgcgcjiegicfjbhcdbcgchdfhiefeabhjiigddhfaccjjjbdfibjcacecgdjfgcchcdifjbhhhjffjadfejdacjedgfjcdjbdfjidbhhfcibejfgjgjbfiehdfbidgcifceihahfidfgfjjcigcjeaehacjjhiadgbcdjiccefhaffjjhciabgefiahibfggiiehhebjeabbeagcecefjjdbbcjahdifidbgfdeheedhieaegecgcgdfjhidjjbeegiiehfidbfaehajeiegjfdaaidficegcdcjafjbcidfhgaefbbifagifdeghidhejbbddjjbbcdjbfbjcfdbbehbacggdbafihaegbajbjihbecbffhjhefddecjjiebfcecabafbdhfbgbfhbcejafgfdaadajcfibdecgccgihhhcfbbadicihfggfefgdfaahaedchdibcdcehfbajadhcehjbejcafacidggjgejggfgcdgfcicjcidefhggbajiaigedhbjheecgiajbaicfaidijbficeiagchjhdaeijijjhbcgfeceagdbdifecffjjebbafidhebcafecgcbbjadfaahicghfgjhahbbifjgacdeagjhgjejbbabjhijcehdgdbehicjhjhbiihbjafbihbecdhhgbadhjeffjbjdijegjddebjjdfbbbbaeeffcfhhjdjjfifihgiahbeafgfdjdhfbejiffeddahgbejfhgbaicidegagfbbjfeahagihgiaedjdjjbjici…
Output: 50

Example 3:

Input: 6 fehjcagjibdhahgijbbebhfjiigiiijegbfcahhghhgaicfbcaijfhbjfafacbijchjfcahjgjbjghabfjhbecgheegfcebigeaahdigdejcfjhhihfdibhjhbhfhffaafbbcibcgfhehbhcahhihdggjhfbbbfhhbghihaigdhghaddcajhbcihichbbdgajejhgeaahjcjadbdgicajacaegfhgdfifdebfidiihbeadafgijhhdacjjbacheecaidhcidbigcjdhgjdfajcgdbdggefggjghhifhcijcjajihdiigccfjdadjdhddbgajbefhaaajdeebgadbdgebggdfebacahbbjhcjeaicfedgciaefjejhfggcaaeaiciahegiefbjjccbddjdjjgicjadfhaicdadfdihgjcbgfgbagbgefdacaidadihieajdjfijiidaaaidbhceijiaecchfefaggfbbcbjefghibcjccahgfifbjgfdgjgefggicaeaciicchhechcehfjfhiaiefefigdjdcdcbaigadceggbifjaccjcbfjcebfejdffagcaghacdjigdahjgbaaeijjfdcidjbghigheiiibcaeefgffchecjcjejahcdbfiddbieajgigbbabeacgaiaecjigjbeagbdjfedhgcgbbbhjbcgbfhheehbadgbejifceajjggecbiabciddffihgciedidibfeijcaajjhjedeaiddghdeeagcidffbeafdeiibhidedaahdbhhc…
Output: 24

Constraints:

1 <= k <= 26; 1 <= |s| <= 4000; lowercase letters.

Loading...
Test Cases:No test cases
No test cases available.