Can u provide any hint on how to approach this problem?
Siddharth and Permutations
its about giving priorities , first -1 should be given the higjest number which is not there in the array , because right of it all should be small, try with topological sorting
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.