Question: In Haskell Write a function longestRun :: String -> Int that will return the length of the longest run in the given string, where a

In Haskell
Write a function longestRun :: String -> Int that will return the length of the longest run in the given string, where a run is defined as a contiguous sequence of the same character. For example: double e is longest run * Main > longest Run "green name 2 triple c or triple d is longest *Main> longestRun "aabbcccdddbb" 3 no than 1 character appears in a run of more *Main> longestRun "abc" 1 !!!! *Main > longest Run 0 Hint: write a helper function to detect the length of the run starting from the beginning of its input list, and apply that function at each position, taking the largest result each time
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
