LeetCode

This repository is built for coding practice on LeetCode. The Solutions are not optimal but pass all test cases.

LC140 Word BreakII: Backtracking + Memorization, using HashMap to record both successful and failed cases.

Word Transform:

(1) "hit" and "cog" . dict = ("hot", "dot", "dog", "lot", "log") . min step = 5; hit -> hot -> dot -> dog -> cog