Doubt with the question

#1

Can you please explain the case when k>N for the above question with an example…
I think my code is giving an error for that case, I’ll be able to do the question if I get a sample I/O for the above case…

#2

@chaturvedia336 look at this input:

4
1 2 3 4
5
output - 4 1 2 3
after doing a full rotation of n, again rotate it (k-n) times when k>n.

#3

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.