It is saying that approach used is bruteforce but i have used the idea given in the hint video
Do one simple thing -
Make a function which pushes the last node of the linked list to its front. And call it k times. Finally display the linked list obtained.
tell mistake in my code…why to use another method
This is the simplest method possible. It is because your code might fail at some point because k can be as large as possible. It can be larger than n as well.