DAY 28 OF 90 · Walk the string

Longest run

Easy90 Days of Looping

Inputs

text is 0 to 20 lowercase letters (a to z).

Create best and current, both 0.
Use a loop over the positions of text. If the character matches the one just before it, add 1 to current; otherwise set current to 1.
After each step, update best if current is larger.
Complete longestRun so it returns best. Return it, do not print it.

With text = "aabbbcaa", longestRun returns 3.

TEST DATA 1: text is "aabbbcaa"

TEST DATA 2: text is ""

Text is just a list of characters, so everything you know about lists applies. String problems in interviews are array problems with letters.

DAY 28 OF 90 · Walk the string

Easy90 Days of Looping

text is 0 to 20 lowercase letters (a to z).

Create best and current, both 0.
Use a loop over the positions of text. If the character matches the one just before it, add 1 to current; otherwise set current to 1.
After each step, update best if current is larger.
Complete longestRun so it returns best. Return it, do not print it.

With text = "aabbbcaa", longestRun returns 3.

TEST DATA 1: text is "aabbbcaa"

TEST DATA 2: text is ""

Text is just a list of characters, so everything you know about lists applies. String problems in interviews are array problems with letters.