Decode nested strings
Decode a run-length-style string with nesting of the form k[encoded], where the bracketed substring is repeated k times. k is a positive integer; brackets may nest. The input is always valid and contains only digits, lowercase letters, and square brackets. 1 <= len(s) <= 30000. Example: '3[a2[c]]' -> 'accaccacc'.
Implement
decode_string(s: str) → strExamples
in
["3[a2[c]]"]out"accaccacc"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 24 min
solution.py
InputExpectedGot
["3[a2[c]]"]"accaccacc"not run yetsample