How should I practice Largest Lexicographical Substring 🌿?

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

Is Largest Lexicographical Substring 🌿 associated with Google?

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

Problem · String

Largest Lexicographical Substring 🌿

Learn this problem

● Medium

GoogleOA

See Google hiring insights

Problem statement

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.

Function

getLargestLexicographicalSubstring(A: String, B: String) → String

Examples

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 🐒

Problem statement

Function

Examples

Example 1

Constraints

More Google problems