Given counts of the letters a, b and c, build the lexicographically smallest string that uses them all and never has the same letter three times in a row.
Unlock detailed company stats for this questionUpgrade
You are given counts A, B and C of the letters a, b and c. Build the lexicographically smallest string that uses exactly A a's, B b's and C c's and never has the same letter three times in a row (for counts 3, 1, 0 the answer is 'aaba').
Community answers
No answers contributed by the community yet.
Related questions
Given a list of lexicographically sorted strings in an unknown language, derive the correct order of letters in that language's alphabet.Given a list of strings, find all strings that encode to the same value using a Caesar Cipher. (A Caesar Cipher rotates characters, e.g. in CC3: a->d, b->e, ..., z->c)Related courses
Course