CTCI 2.2

Implement an algorithm to find the kth to last element of a singly linked list.

CTCI 2.2.java

public static Node findLastKth(Node root, int Kth){
    if(root == null) return null;
    
    Node front = root;
    for(int i = 1; i < Kth; i++){
        front = front.next;
        if(front == null) return null;
    }
    
    while(front.next != null){
        root = root.next;
        front = front.next;
    }
    
    return root;
}