FastPrep
Problem · String

Largest Lexicographical Substring 🌿

● MediumGoogleOA
See Google hiring insights

Given two strings A and B, your task is to output the largest lexicographically ordered substring of string B that makes string B a superstring of string A. If no such substring exists, output -1.

A superstring is a string that contains all the characters present in another string, irrespective of their order.

Examples
01 · Example 1
A = "abc"
B = "abcab"
return = "cab"
String B is a superstring of string A because it contains all the characters of A in various sequences. Among these sequences, ("cab", "abc", "bca") meet the conditions, and the largest lexicographically ordered substring among them is "cab".
Constraints
Unknwon for now 🐒
More Google problems
drafts saved locally
public String getLargestLexicographicalSubstring(String A, String B) {
    // write your code here
}
A"abc"
B"abcab"
expected"cab"
sign in to submit