These don't seem like paths to follow because the steps don't build on one-another. E.g., the Foundations sequence: 1. Former Coding Interview Question: Find l

These don't seem like paths to follow because the steps don't build on one-another. E.g., the Foundations sequence: 1. Former Coding Interview Question: Find longest word in dictionary that is a subsequence of a given string 2. Using strings in Java (Java For Beginners: Strings, String Functions & Chars) 3. Using arrays in Java (Java For Beginners: Arrays) ... 13. Java Object References 14. Sort array problem (considerably easier than the first problem although hash tables come after it)