[Solved] Construct Smallest Number From DI String LeetCode Contest Problem
![[Solved] Construct Smallest Number From DI String LeetCode Contest Problem [Solved] Construct Smallest Number From DI String LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Construct-Smallest-Number-From-DI-String-LeetCode-Contest-Problem.png)
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] >…