Recursion- dictionary order

#1

getting wrong answer for testcases 2 and 3

#2

@Faizan-Ali-1395131367301898 Consider the input:
Input: abc
Expected Output:
acb
bac
bca
cab
cba
Your code’s output:
acb
bac
bca
cba
cab

Your code is finding out the correct permutations but printing in a different order.

#3
#4

still showing one test case wrong

#5

@Faizan-Ali-1395131367301898 https://ide.codingblocks.com/s/158289
Try to submit it now and check.
here you do not have to use backtracking as i have said…you just have to go with simple recursion.
Backtracking will give wrong output(actually the correct permutations but in the order which is not required in this problem) in this case as the test cases are set according to the simple recursive way.

Hope this helps :slightly_smiling_face:

#6

still get testcase-1 as wrong answer

#7

It is passing all the test cases in my side. I suppose the question is same as this https://hack.codingblocks.com/app/contests/718/p/361

#8

yeah same question …can u send me the code which u r running

#9
#10

thanks can u please explain optimal game strategy problem

#11

I think there is already a video on it in the Dynamic Programming section of your course where the recursive approach is also explained… You can refer that.