Reverse first K elements of given linked list

Suppose that given linked list contain N nodes, Our goal is to reverse initial K nodes of beginning of this linked list. That is a one of the basic problem in linked list based on reversing the element of linked list. See this example.

Here given code implementation process.

1) Reverse initial k elements from linked list in java 2) Reverse initial k elements from linked list in c++ 3) Reverse initial k elements from linked list in c 4) Reverse initial k elements from linked list in c# 5) Reverse initial k elements from linked list in php 6) Reverse initial k elements from linked list in python 7) Reverse initial k elements from linked list in ruby 8) Reverse initial k elements from linked list in scala 9) Reverse initial k elements from linked list in swift 10) Reverse initial k elements from linked list in kotlin 11) Reverse initial k elements from linked list in node js 12) Reverse initial k elements from linked list in vb.net 13) Reverse initial k elements from linked list in golang 14) Reverse initial k elements from linked list in typescript