Decode nested run-length string
Decode a string with nested run-length encoding of the form k[encoded] meaning the bracketed content repeated k times, where k is a positive integer and content may itself contain nested k[...] groups and lowercase letters. For '3[a2[c]]' return 'accaccacc'. The decoded output fits comfortably in memory; input length up to a few thousand.
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 28 min
solution.py
InputExpectedGot
["3[a2[c]]"]"accaccacc"not run yetsample