Find Permutation - Interviewbit Solution

Problem: Find Permutation

Problem Description:

Given a positive integer n and a string s consisting only of letters D or I, you have to find any permutation of first n positive integer that satisfy the given input string.

D means the next number is smaller, while I means the next number is greater.

Notes

Length of given string s will always equal to n - 1
Your solution should run in linear time and space.

Example :

Input 1:
n = 3
s = ID

Return: [1, 3, 2]

Solution:

Comments

Maximum Area of Triangle! InterviewBit Solution

Given a character matrix of size N x M in the form of a string array A of size N where A[i] denotes ith row. Each character in the matrix co

Locking Unlocking of N-ary Tree

Given an n-ary tree of resources arranged hierarchically such that the height of the tree is O(log N) where N is a total number of nodes...

Counting Triangles - InterviewBit Solution

You are given an array of N non-negative integers, A0, A1 ,…, AN-1.Considering each array element Ai as the edge length of some line segment

3 Sum Zero - InterviewBit Solution

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives

3 Sum - InterviewBit Solution

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target.