• + 0 comments

    My Python Soluction

    def getNode(llist, positionFromTail):
    
            prev = None
            curr = llist
            temp = curr
    
            while curr:
                    temp = curr.next
                    curr.next = prev
                    prev = curr
                    curr = temp
    
            head = prev
            curr = head
            count = 0
    
            while count < positionFromTail:
                    curr = curr.next
                    count += 1
    
            return curr.data