2375. Construct Smallest Number From DI String

LeetCodeStringBacktrackingStackGreedyOpen on judge ↗

You are given a 0-indexed string pattern of length n consisting of the characters 'I' meaning increasing and 'D' meaning decreasing. A 0-indexed string num of length n + 1 is created using the following conditions: - num consists of the digits '1' to '9', where each digit is used at most once. - If pattern[i] == 'I', then num[i] < num[i + 1]. - If pattern[i] == 'D', then num[i] > num[i + 1].

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