given 2 strings generate all possible permutation (order should be maintained!)
0 Answers
given 2 strings generate all possible permutation (order should be maintained!)
| Flag | PURGE
given 2 strings A and B. generate all possible solutions when B is merged in A.
Ex: A = "hey"
B: "sam"
then solutions are :
heysam,hseaym,hesaym,sahemy etc.
notice that order should be the same for both of strings while merging.
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.