Please help me here

#1

I’ve not been able to understand this problem

#2

Is there any other source or way for this

#3

Hey
So you’re given a string consisting of operators ‘<’ and ‘>’ only, the string has a length of n-1
Now you’ve to find no of permutations of length n, which means number of arrangements of numbers 1 to n such that for each of the above arrangement( or permutation) p, p[i] < p[i+1] if s[i] == ‘<’ and p[i] > p[i+1] if s[i] = ‘>’

Let’s say the given string s is <><

so see the permutation 1 3 2 4 satisfies the string coz:-
1st character of string is ‘<’ and 1st number is less than second
2nd character is ‘>’ and 2nd no is greater than third
3rd character is ‘<’ and 3rd no is less than 4th no.

You have to count no of such permutations.

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.