Practice Coding Question | Real Coding Interviews | Hack2hire

NewThe Learning module is now liveSee what's new

Question Bank Learning

Pricing Blog Forum

Quick Summary

Reconstruct all possible original digit strings from a single count-and-say encoding.
Parse ambiguous count segments that can be either one or two digits long.
Validate constraints like no leading zeros and maximum count of 99 during exploration.

What This Tests

Backtracking recursion and state restoration
Dynamic string segmentation
Boundary and format validation
Exponential search space handling

Common Patterns

Backtracking

Accepted

5.5k/10.5k

Acceptance Rate52.5%

Test Cases

Input

encoded =

Output

Expected