Where it says:
s += path[level];

It should in fact be:
s += path[i];

As an aside, thanks for posting these solutions! They've really helped my own studies.

Instead of saying 'Q7' name the file for example 'Q7 Remove Duplicates from LinkedList' this would make searching for a subject much easier. Right now I have to open them all up to see what the algorithm is inside. You could even have an index

In cracking-the-coding-interview/src/chap02/Q2.java the output of nthToLast function is n in case of k is not in the limit of size of the linked list (eg: k = 100/-199). In such a case the output should be -1 instead of n as n would be the output even when we pass the value of k equal to size of linked list.

Kindly review this once and if you agree with me then I can open a PR for the same.

Is it possible to have to an O(1) solution to find the minimum distance between any two words, after doing the some magic in the pre-processing logic?