How should I practice Deepest Nested Substrings?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP phone screen and onsite interview problems in FastPrep.

Is Deepest Nested Substrings associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP phone screen and onsite interview coding practice problem when the problem catalog has that company and stage context.

Deepest Nested Substrings

Bloomberg LP● MediumNEW GRADPHONE SCREENONSITE INTERVIEW

Learn

Problem statement

Given a balanced string containing lowercase letters and the bracket pairs (), [], and {}, return the contents of every bracket pair at the maximum nesting depth.

Return results from left to right. The returned content excludes the surrounding brackets. An empty deepest pair contributes the empty string.

Function

deepestNestedSubstrings(expression: String) → String[]

Examples

Example 1

expression = "a[bc]def{cd}"return = ["bc","cd"]

Both pairs are at depth one, the maximum depth.

Example 2

expression = "ran(n(d))o(m())"return = ["d",""]

The pairs around d and the empty string are the depth-two pairs.

Example 3

expression = "x{a[b(c)d]e}y"return = ["c"]

The innermost parentheses are at depth three.

Constraints

0 <= expression.length <= 10^5.
The expression contains lowercase English letters and balanced, correctly matched brackets.