How should I practice Rightmost Longest Character Run?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Hudson River Trading online assessment problems in FastPrep.

Is Rightmost Longest Character Run associated with Hudson River Trading?

FastPrep tags this as a Hudson River Trading online assessment coding practice problem when the problem catalog has that company and stage context.

Problem · String

Rightmost Longest Character Run

Learn this problem

● Easy

Hudson River TradingINTERNNEW GRADOA

Problem statement

You are given a string source consisting of lowercase English letters.

Find the longest contiguous substring that consists of the same character. If several such substrings have the same maximum length, choose the rightmost one.

Return a string containing the chosen character followed by the number of times it occurs in that substring.

A solution with time complexity no worse than O(source.length^3) fits within the execution time limit.

Function

solution(source: String) → String

Examples

Example 1

source = "bbacccdbbab"return = "c3"

The character a appears in two runs of length 1. The character b appears in three runs: two of length 2 and one of length 1. The single c run has length 3, so it is the longest run and the result is "c3".

Example 2

source = "bbaacaa"return = "a2"

The runs "bb", the first "aa", and the final "aa" all have the maximum length 2. The final "aa" is the rightmost maximum run, so the result is "a2".

Constraints

source consists only of lowercase English letters.