|
Be the first user to complete this post
|
Add to List |
Find All the Well Ordered Permutations of a Given String.
Objective: Write an algorithm to Print All the Well Ordered Permutations of a Given String.
What is Well Ordered String: When all the alphabets in a string occur in the increasing order irrespective of Lower Case or Upper case.
http://www.careercup.com/question?id=6206517812396032
Example :
"Sumit" - Not Well Ordered . 'u' occurred after 'S'. "Now" - Well Ordered. N<o<W. Input: Interview Output:[e, e, I, i, n, r, t, v, w] [e, e, i, I, n, r, t, v, w] [e, e, i, I, n, r, t, v, w] [e, e, I, i, n, r, t, v, w]
Approach:
- Get the input string.
- Find out all the permutations of a String.
- Before printing check if the permutation is well formed.
Code:
Output:
Given String - Interview[e, e, I, i, n, r, t, v, w] [e, e, i, I, n, r, t, v, w] [e, e, i, I, n, r, t, v, w] [e, e, I, i, n, r, t, v, w]
Also Read: