Kth Node from Middle

Problem Statement Given an integer B and a linked list A of length N. From the middle of the Linked List towards the beginning, we have to determine the value of the Bth node. Return -1 if such an ele