solulubeta
Sign in
Story Problems / Stack
03.02 · Problem

Decode the Compressed Message

Medium Stack of (previous text, repeat count) Pro

This problem is part of solulu Pro

A messaging app compresses repeated text as k[text], meaning the text is repeated k times; these can be nested. For example 3[a2[c]] means accaccacc. Given a valid compressed message, return the original.

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 42 of 94 · updated 2026-10-12