DI String Match Problem

DI String Match Problem — ExecCode Easy DSA Practice

Solve the DI String Match problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Description A permutation perm of n + 1 integers of all the integers in the range [0, n] can be represented as a string s of length n where: s[i] == 'I' if perm[i] perm[i + 1]. Given a string s, reconstruct the permutation perm and return it. If there are multiple valid permutat…

Practice DI String Match free on ExecCode. Browse more ExecCode DSA problems.