← All problemsSign in

880. Decoded String at Index

LeetCodeStringStackOpen on judge ↗

You are given an encoded string s. To decode the string to a tape, the encoded string is read one character at a time and the following steps are taken: - If the character read is a letter, that letter is written onto the tape. - If the character read is a digit d, the entire current tape is repeatedly written d - 1 more times in total. Given an integer k, return the kth letter (1-indexed) in t

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start