FastPrepFastPrep
Problem Brief

Find Maximum Two-Digit Fragment

PHONE SCREEN

You are given a string consisting of digits. Find the biggest two-digits value that is a consistent fragment of the given string.

For example, two-digit consistent fragments of "50552" are ["50","05","55","52"], representing the numbers [50,5,55,52]. The biggest value among them is 55.

Function Description

Write a function:

class Solution { public int solution(String S); }

that, given a string S consisting of digits, returns the maximum two-digit value that is a consistent fragment of S.

1Example 1

Input
S = "50552"
Output
55
Explanation

The two-digit consistent fragments of "50552" are ["50","05","55","52"], representing the numbers [50,5,55,52]. The biggest value among them is 55. 

public int solution(String S) {
  // write your code here
}
Input

S

"50552"

Output

55

Sign in to submit your solution.