public static <T> T kthRecursive(final LinkedList<T> list, final int k) {
        if (k == 0) {
            return list.getFirst();
        }
        return kthRecursive(new LinkedList<>(list.subList(1, list.size())), k - 1);
    }
Find the Kth element of a list.
java8/src/main/java/com/shekhargulati/ninetynine_problems/_01_lists/P03.java