Linked list k-append

#1

run time error for one of my test case rest are okay.

#2

Do one simple thing. Make a function which pushes the last node of the linked list to its front. Call it k times. And finally print the list.

#3

can you please elaborate!?

#4

Lets say our linked list is - 1 2 3 4 5
Make a function which does the pushes the last node to the front ie., after one function call, the linked list will look like -
5 1 2 3 4
Just call it k times in the int main() and display the final liked list.

#5

i’ll have to traverse every time to the end of the list,
won’t it take much time?

#6

Don’t worry. It will pass all the test cases.

#7

okay ,i’ll try
thank you

#8

@shikher_265 Please mark your doubt as resolved if you are satisfied.

#9

can’t get the option to do it

#10

It must be coming up in the “Ask Doubts” section of your course.