Decode nested bracket string
Decode a string encoded with the rule k[encoded_string], where the bracketed substring is repeated exactly k times. k is a positive integer and encoding may be nested. The input contains only lowercase letters, digits, and brackets, is always well-formed, has length 1 to 10^4, and the decoded output fits comfortably in memory (under ~10^5 characters). Return the decoded string.
Implement
decode_string(s: str) → strExamples
in
["3[a]2[bc]"]out"aaabcbc"What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
["3[a]2[bc]"]"aaabcbc"not run yetsample