Given a string which contains only (increase) and (decrease). The task is to return any permutation of integers [0, 1, …, N] where N ≤ Length of S such that for all i = 0, …, N-1:
- If S[i] == “D”, then A[i] > A[i+1]
- If S[i] == “I”, then A[i] < A[i+1].
Note that output must contain distinct elements.
Input: S = “DDI”
Output: [3, 2, 0, 1]
Input: S = “IDID”
Output: [0, 4, 1, 3, 2]
Approach: If S == “I”, then choose as the first element. Similarly, if S == “D”, then choose as the first element. Now for every operation, choose the next maximum element which hasn’t been chosen before from the range [0, N] and for the operation, choose the next minimum.
Below is the implementation of the above approach:
[0, 4, 1, 3, 2]
- Generate all rotations of a given string
- Generate all the binary number from 0 to n
- Generate n-bit Gray Codes
- Generate all binary strings without consecutive 1's
- Generate all binary strings from given pattern
- Generate random String of given size in Java
- Generate permutations with only adjacent swaps allowed
- Program to generate all possible valid IP addresses from given string
- Generate number with given operation and check if it is palindrome
- Generate all permutations of a string that follow given constraints
- Generate a string consisting of characters 'a' and 'b' that satisfy the given conditions
- Generate all binary strings of length n with sub-string "01" appearing exactly twice
- Generate lexicographically smallest string of 0, 1 and 2 with adjacent swaps allowed
- Generate two output strings depending upon occurrence of character in input string.
- Generate two output strings depending upon occurrence of character in input string in Python
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : andrew1234