← Questions
Decode a string with nested repeat counts
0
I was asked this
No reports yet. Sign in to say where you were asked it.
An encoded string uses k[...] to mean the bracketed part repeated k times, and brackets may nest, for example 3[a2[c]] decodes to accaccacc. Return the decoded string. Use a stack or recursion and handle multi-digit counts.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding