Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1096. Brace Expansion II
Parse a nested brace expression where {a,b} denotes union and adjacency denotes concatenation, and compute the set of all distinct strings produced by applying unions and cartesian-product concatenations across nested groups. The core challenge is correctly parsing the nested grammar and combining/deduplicating sets, then returning the sorted results.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.