Form minimum number from given sequence

<script>
// Javascript program to print minimum number that can be formed
// from a given sequence of Is and Ds

// Prints the minimum number that can be formed from
    // input sequence of I's and D's
function PrintMinNumberForPattern(arr)
{
    // Initialize current_max (to make sure that
        // we don't use repeated character
        let curr_max = 0;
 
        // Initialize last_entry (Keeps track for
        // last printed digit)
        let last_entry = 0;
 
        let j;
 
        // Iterate over input array
        for (let i = 0; i < arr.length; i++)
        {
            // Initialize 'noOfNextD' to get count of
            // next D's available
            let noOfNextD = 0;
 
            switch (arr[i])
            {
                case 'I':
                    // If letter is 'I'
 
                    // Calculate number of next consecutive D's
                    // available
                    j = i + 1;
                    while (j < arr.length && arr[j] == 'D')
                    {
                        noOfNextD++;
                        j++;
                    }
 
                    if (i == 0)
                    {
                        curr_max = noOfNextD + 2;
 
                        // If 'I' is first letter, print incremented
                        // sequence from 1
                        document.write(" " + ++last_entry);
                        document.write(" " + curr_max);
 
                        // Set max digit reached
                        last_entry = curr_max;
                    }
                    else
                    {
                        // If not first letter
 
                        // Get next digit to print
                        curr_max = curr_max + noOfNextD + 1;
 
                        // Print digit for I
                        last_entry = curr_max;
                        document.write(" " + last_entry);
                    }
 
                    // For all next consecutive 'D' print
                    // decremented sequence
                    for (let k = 0; k < noOfNextD; k++)
                    {
                        document.write(" " + --last_entry);
                        i++;
                    }
                    break;
 
                // If letter is 'D'
                case 'D':
                    if (i == 0)
                    {
                        // If 'D' is first letter in sequence
                        // Find number of Next D's available
                        j = i + 1;
                        while (j < arr.length && arr[j] == 'D')
                        {
                            noOfNextD++;
                            j++;
                        }
 
                        // Calculate first digit to print based on
                        // number of consecutive D's
                        curr_max = noOfNextD + 2;
 
                        // Print twice for the first time
                        document.write(" " + curr_max + " " + (curr_max - 1));
 
                        // Store last entry
                        last_entry = curr_max - 1;
                    }
                    else
                    {
                        // If current 'D' is not first letter
 
                        // Decrement last_entry
                        document.write(" " + (last_entry - 1));
                        last_entry--;
                    }
                    break;
            }
        }
        document.write("<br>");
}

// Driver code
PrintMinNumberForPattern("IDID");
PrintMinNumberForPattern("I");
PrintMinNumberForPattern("DD");
PrintMinNumberForPattern("II");
PrintMinNumberForPattern("DIDI");
PrintMinNumberForPattern("IIDDD");
PrintMinNumberForPattern("DDIDDIID");

// This code is contributed by ab2127
</script>

<script>

    // Javascript program to print 
    // minimum number that can be formed
    // from a given sequence of Is and Ds
    
    function printLeast(arr)
    {
        // min_avail represents the 
        // minimum number which is
        // still available for inserting
        // in the output vector.
        // pos_of_I keeps track of the
        // most recent index
        // where 'I' was encountered 
        // w.r.t the output vector
        let min_avail = 1, pos_of_I = 0;

        //vector to store the output
        let al = [];

        // cover the base cases
        if (arr[0] == 'I')
        {
            al.push(1);
            al.push(2);
            min_avail = 3;
            pos_of_I = 1;
        }

        else
        {
            al.push(2);
            al.push(1);
            min_avail = 3;
            pos_of_I = 0;
        }

        // Traverse rest of the input
        for (let i = 1; i < arr.length; i++)
        {
            if (arr[i] == 'I')
            {
                al.push(min_avail);
                min_avail++;
                pos_of_I = i + 1;
            }
            else
            {
                al.push(al[i]);
                for (let j = pos_of_I; j <= i; j++)
                    al[j] = al[j] + 1;

                min_avail++;
            }
        }

        // print the number
        for (let i = 0; i < al.length; i++)
            document.write(al[i] + " ");
        document.write("</br>");
    }
    
    printLeast("IDID");
    printLeast("I");
    printLeast("DD");
    printLeast("II");
    printLeast("DIDI");
    printLeast("IIDDD");
    printLeast("DDIDDIID");
    
</script>

<script>

    // Javascript program to print
    // minimum number that can be formed
    // from a given sequence of Is and Ds
    
    // Function to decode the given 
    // sequence to construct
    // minimum number without repeated digits
    function PrintMinNumberForPattern(seq)
    {
        // result store output string
        let result = "";
  
        // create an empty stack of integers
        let stk = [];
  
        // run n+1 times where n is length 
        // of input sequence
        for (let i = 0; i <= seq.length; i++) 
        {
            // push number i+1 into the stack
            stk.push(i + 1);
  
            // if all characters of the input 
            // sequence are
            // processed or current character is 'I'
            // (increasing)
            if (i == seq.length || seq[i] == 'I') 
            {
                // run till stack is empty
                while (stk.length!=0) {
                // remove top element from 
               // the stack and
              // add it to solution
                 result += 
                 (stk[stk.length - 1]).toString();
                 result += " ";
                 stk.pop();
                }
            }
        }
  
        document.write(result + "</br>");
    }
    
    PrintMinNumberForPattern("IDID");
    PrintMinNumberForPattern("I");
    PrintMinNumberForPattern("DD");
    PrintMinNumberForPattern("II");
    PrintMinNumberForPattern("DIDI");
    PrintMinNumberForPattern("IIDDD");
    PrintMinNumberForPattern("DDIDDIID");
    
</script>

<script>

    // Javascript program of above approach
    
    // Returns minimum number made from given
    // sequence without repeating digits
    function getMinNumberForPattern(seq)
    {
        let n = seq.length;

        if (n >= 9)
            return "-1";

        let result = new Array(n + 1);

        let count = 1;

        // The loop runs for each input character
        // as well as one additional time for
        // assigning rank to each remaining characters
        for (let i = 0; i <= n; i++)
        {
            if (i == n || seq[i] == 'I')
            {
                for (let j = i - 1; j >= -1; j--)
                {
                    result[j + 1] = 
                    String.fromCharCode('0'.charCodeAt() + 
                    count++);
                    if (j >= 0 && seq[j] == 'I')
                        break;
                }
            }
        }
        return result.join("");
    }
    
    let inputs = [ "IDID", "I", "DD", "II", "DIDI",
    "IIDDD", "DDIDDIID" ];
 
    for(let input = 0; input < inputs.length; input++)
    {
        document.write(
        getMinNumberForPattern(inputs[input]) + "</br>"
);
    }

</script>