Find Deepest Level Substrings
Given a string of well-formed nested brackets and characters, return all substrings or characters enclosed within the innermost nested brackets. Note that there may be more than one pair of brackets at the deepest level.
Asked at:
Bloomberg
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late September, 2026
Junior
in a string of well formed nested brackets and characters, return all those substrings/characters that are enclosed in the innermosted nested brackets. there may be more than 1 pair of brackets at each level
Hello Interview Premium
Your account is free and you can post anonymously if you choose.