top of page

Looking to master object-oriented and system design for tech interviews or career growth?

  • Improve your system design and machine coding skills.

  • Study with our helpful resources.

  • Prepare for technical interviews and advance your career.

**We're in beta mode and would love to hear your feedback.

Find Permutation - Interviewbit Solution

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.


  • 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]



bottom of page