classSolution: defFindKthToTail(self, head, k): # write code here if k < 1or head isNone: returnNone node_k = head for i inrange(1, k): head = head.next if head isNone: returnNone while head.nextisnotNone: head = head.next node_k = node_k.next return node_k