How should I practice Generate Lexicographically Smallest String?

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

Is Generate Lexicographically Smallest String associated with Deutsche Bank?

FastPrep tags this as a Deutsche Bank coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · String

Generate Lexicographically Smallest String

Learn this problem

● MediumDeutsche BankOA

Problem statement

String S1 of length L1 consisting of uppercase alphabets only. String S2 of length L2 consisting of characters 'T' and 'F' only. Generate a lexicographically smallest string S of length (L1 + L2 - 1) such that a substring of length L1 in string S starting at index (0 <= i < L2) is equal to S1 if and only if ith element of S2 is 'T'. If generating a string is not possible return -1.

Function

generateLexicographicallySmallestString(S1: String, S2: String) → String

Examples

Example 1

S1 = "ABCA"S2 = "TFFF"return = "ABCAAAA"

S="ABCAAAA" is lexicographically smallest string that satisfies the given condition:-

Character at index 0 of S2 = 'T' and Substring starting at index 0: "ABCA" is equal to S1.
Character at index 1 of S2 = 'F'
Character at index 2 of S2 = 'F'
Character at index 3 of S2 = 'F'

Example 2

S1 = "ABA"S2 = "TFT"return = "ABABA"

S="ABABA" is the lexicographically smallest string that satisfies the given condition.

Example 3

S1 = "ABC"S2 = "TFT"return = "-1"

It is not possible to generate a string that satisfies the given condition, hence the output is -1.

Constraints

1 <= L1 <= 10^4
1 <= L2 <= 100