Discussion on: A coding interview question asked at Google

Some Java code that:

• Walks backward through the shortest string, jumping passed as much as possible to build a string.
• Uses that string while walking back through the second and comparing.
• Tires to fail as quickly as possible.