Waste less time on Facebook — follow Brilliant.

Number of ways of partitioning a string of alphabetical characters with two two letters?

Given a string constituting of only two characters, like 'FFA' ,'OOPP' or ' GGGD' , in how many ways could one partition it into groups of letters?.ie for GGGD we have 7 ways of doing this namely: GGGD or G,GGD or G,G,GD or G,G,G,D or G,GG,D or GGG,D or GG,GD . How would we compute this for larger strings such as 'PPPPPPGGGGG' or 'DDDDDDDDDDDDDDEEEEEEEE'?(Sorry about the typo with the title, I meant 'two letters' not 'two two letters')

Note by Thaddeus Abiy
4 years ago

No vote yet
3 votes


There are no comments in this discussion.


Problem Loading...

Note Loading...

Set Loading...