Number following a pattern

PROBLEM STATEMENT

You are given a string 'S' that consists of I’s and D’s pattern only. 'I' is for increasing, and 'D' is for decreasing. Your task is to return the string that consists of a minimum number following that pattern.

Note:

1) Digits of the number should be in the range [1,9] and can’t repeat.

2) The length of the string should be less than or equal to 8.

Input Format:

The first line of the input contains an integer 'T' denoting the number of test cases. 

The first line of each test case contains a string 'S', as described in the problem statement.

Output Format:

For each test case, return a string consisting of a minimum number following the given pattern.

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function.

Constraints:

1 <= T <= 10^3
1 <= |S| <= 8

where |S| is the length of the given string.
Time Limit: 1sec

Approach 1

Create an empty stack and a string 'ANS' for storing the result.
In stack, we are going to push i+1every time for all 0 <= ‘i’ < |S| when we are traversing the string ‘S’.
The main observation is that:
- The length of the output string is always one more than the input string. So, we are going to start the loop from ‘i’ = 0 to ‘i’ <= S.length().
- When we encounter a D, we need numbers in decreasing order, so we just push ‘i+1’ because in the future, when we are going to empty the stack, we are having all the numbers in decreasing order beforehand.
- When we encounter an I at the ith index of the string ‘S’, we need numbers in increasing order. Since every time we are pushing ‘i+1’ in the stack, we first push ‘i+1’, and also we have to empty the stack whenever we are facing an I. So, 2 cases are possible:
  - If S[i-1] is equal to “D”, we want numbers in the decreasing order, and the stack contains numbers in the decreasing order itself. So, just pop the element, add it into the 'ANS' string until the stack becomes empty.
  - If S[i-1] is equal to “I”, the stack only contains ‘i+1’ since the stack is already empty in the (i-1)th index because it is I. So, just add the top element in the 'ANS' string and pop that element which implies stack again become empty.
- When we are at the last of the string, just pop the element and add it into the 'ANS' string until the stack becomes empty.
Combing all the observations in the code, run a loop from i=0 to ‘i’<=|S|, in each iteration:
- Push ‘i+1’ in the stack.
- If S[i] == ‘I’ or ‘i’ == S.length(), then pop the element, add it into the string 'ANS' till the stack becomes empty.
Return the string 'ANS'.

Try Problem

Approach 2

Logic is very similar to approach 1 but the only difference is that we are not going to use a stack in this case.
Note that we have used the stack for maintaining the D’s and always emptying it at the time of I. So, we can say that stack contains all the ‘i+1’ between two I’s.
In this approach, we are using a two-pointer method.
Create an empty string ‘ANS’ of size |S| to store the output string and initialize a variable ‘CNT’ = 1 to maintain the desired order.
As the length of the output string is one more than the input string, so run a loop from ‘i’ = 0 to ‘i’ <= S.length(), in each interaction:
- If ‘i’ == |S| or S[i] == ‘I’, then rup a reverse loop from ‘j’ = ‘i-1’ to ‘j' >= -1 :
  - Set (j+1)th index of the string ‘ANS’ to ‘CNT’ which means ANS[j+1] = char(CNT + ’0’).
  - Increment the 'CNT'.
  - If ‘j’ >= 0 and S[j] == ‘I’, then break.
- The above steps fulfill the requirement of the stack.
Return the string ‘ANS’.