https://h30306.github.io/blog/tags/bracket-sequences/Recent content in Bracket-Sequences onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungTue, 03 Nov 2026 00:00:00 +0000https://h30306.github.io/blog/leetcode/leetcode-32/Tue, 03 Nov 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-32/LeetCode 32 note: a stack of indices whose bottom is the position just before the current valid run; the length is i - stack[-1]https://h30306.github.io/blog/leetcode/leetcode-2267/Tue, 13 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2267/LeetCode 2267 note: the state is (r, c, open balance); the balance can be neither negative nor more than the remaining steps; search the states with BFS / DP and succeed at the end with balance 0https://h30306.github.io/blog/leetcode/leetcode-1021/Tue, 27 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1021/LeetCode 1021 note: track depth instead of a stack; the ‘(’ raising depth from 0 to 1 and the ‘)’ lowering it from 1 to 0 are outermost, everything else stays