https://h30306.github.io/blog/tags/string-matching/Recent content in String-Matching onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungWed, 07 Sep 2022 00:00:00 +0000https://h30306.github.io/blog/leetcode/leetcode-796/Wed, 07 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-796/LeetCode 796 note: goal is a rotation of s exactly when the lengths match and goal occurs in s + shttps://h30306.github.io/blog/leetcode/leetcode-572/Sat, 27 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-572/LeetCode 572 note: for every node of root, check whether its subtree equals subRoot; recurse with isSubtree, not by comparing only the childrenhttps://h30306.github.io/blog/leetcode/leetcode-459/Wed, 24 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-459/LeetCode 459 note: s is a repetition of a substring exactly when s occurs in s + s with its first and last characters removedhttps://h30306.github.io/blog/leetcode/leetcode-28/Wed, 11 May 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-28/LeetCode 28 note: try matching needle at every start, or use str.find; index raises when not found