Available question text
Given an encoded string where letters append to a tape and digits 2–9 repeat the entire current tape, return the k-th character of the fully decoded string; because the decoded string can be astronomically large, compute cumulative decoded lengths and traverse the encoding backwards using modulo reductions to map k to the original letter without building the full string.
Related questions
Continue with questions that share topics or the same question type.
- Find the Index of the First Occurrence in a String
Coding · Boyer–Moore String-Search Algorithm · Knuth–Morris–Pratt Algorithm · String
- Index Pairs of a String
Coding
- A Graph question, a string question, a couple of array questions.
Coding
- Add Bold Tag in String
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 880. Decoded String at Index
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source