Given an encoded string containing letters and repetition counts (e.g., '3[a2[c]]'), decompress the string. Use a stack to handle nested repetitions correctly.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.