Hi,
I'm looking for a formula which returns the longest consecutive series of occurrences of 2 chars in a text string.
In the case I'm trying to count the longest consecutive number of nine-spares (9/) in a bowling game.
For example:
|7/|X|9/|9/|9-|9/|9/|9/|9/|X8/| longest series of 9/ would be 4.
|9/|9-|9/|9/|7/|9-|(8)/|X|7/|9-| longest series of 9/ would be 2.
|9/|(8)1|X|X|72|63|7/|8/|8/|9/9| longest series of 9/ would be 1.
Thanks a lot for any help!
Bookmarks