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')
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.