Lexicographically smallest string without three consecutive alphabets
Difference between en1 and en2, changed 56 character(s)
Given counts of A,B,C, we need to form the lexicographically smallest string using all A, B, C such that no three consecutive characters are identical. It is guaranteed that one can always form a valid string. The backtracking solution is trivial however how can we do it given the constraints?↵
↵
1<=(A+B+C)<=10^5

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English pista_chios 2023-08-12 03:14:40 2 Tiny change: 'aints?\n\n1<=(A+B+C)<' -> 'aints?\n\n0<=(A+B+C)<'
en2 English pista_chios 2023-08-12 03:14:01 56
en1 English pista_chios 2023-08-12 03:12:45 327 Initial revision (published)