Reverse alternate K nodes in a Linked List

Example 1
Linked List Element :  1  2  3  4  5  6  7  8  9  10
Reverse alternate 3 nodes
Linked List Element :  3  2  1  4  5  6  9  8  7  10

Problem is based on reversing node link not node value. For example.

In case group of alternate nodes are less than k in this case not reverse this group. For example.

Example 2
    Before reverse alternate 4 nodes
    1   2   3   4   5   6   7   8   9  10
    ①  ②   ③  ④  (k = 4)


    Reverse 4 nodes
    4   3   2   1   5   6   7   8   9  10
                    ⤑  ⤑   ⤑   ⤑ Skip k nodes

    4   3   2   1   5   6   7   8   9  10
                                    ①  ②  (k = 4)

                                (2 nodes less than k)  
                                  So it's not reverse   
  

Here given code implementation process.

1) Reverse exact K alternate nodes of a linked list in java 2) Reverse exact K alternate nodes of a linked list in c++ 3) Reverse exact K alternate nodes of a linked list in c 4) Reverse exact K alternate nodes of a linked list in c# 5) Reverse exact K alternate nodes of a linked list in php 6) Reverse exact K alternate nodes of a linked list in python 7) Reverse exact K alternate nodes of a linked list in ruby 8) Reverse exact K alternate nodes of a linked list in scala 9) Reverse exact K alternate nodes of a linked list in swift 10) Reverse exact K alternate nodes of a linked list in kotlin 11) Reverse exact K alternate nodes of a linked list in node js 12) Reverse exact K alternate nodes of a linked list in vb.net 13) Reverse exact K alternate nodes of a linked list in golang 14) Reverse exact K alternate nodes of a linked list in typescript