https://jeanphilogong.github.io/jeanblog/tags/recursion/Recent content in Recursion on Jeanphilo BlogHugo -- 0.168.0en-usFri, 21 Aug 2026 00:00:00 +0000https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/394-decode-string/Fri, 21 Aug 2026 00:00:00 +0000https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/394-decode-string/Start from the context lost by nested encoding, build a correct recursive parser, and make its saved frames explicit with a stack.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/binary-tree/108-convert-sorted-array-to-binary-search-tree/Mon, 20 Apr 2026 10:01:46 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/binary-tree/108-convert-sorted-array-to-binary-search-tree/A practical guide to LeetCode 108 covering why the midpoint is the natural root, how sorted order and balance requirements work together, and how to build the BST with stable index recursion.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/binary-tree/114-flatten-binary-tree-to-linked-list/Mon, 20 Apr 2026 10:01:46 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/binary-tree/114-flatten-binary-tree-to-linked-list/A practical guide to LeetCode 114 covering why the flattened list must follow preorder order and how reverse preorder with a prev pointer gives a stable in-place rewiring strategy.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/binary-tree/226-invert-binary-tree/Fri, 06 Mar 2026 17:58:23 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/binary-tree/226-invert-binary-tree/A practical guide to LeetCode 226 covering tree mirroring, recursive left-right swaps, BFS traversal, and engineering mappings.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/binary-tree/104-maximum-depth-of-binary-tree/Fri, 06 Mar 2026 17:58:22 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/binary-tree/104-maximum-depth-of-binary-tree/A practical guide to LeetCode 104 covering the depth definition, recursive DFS, level-order BFS, engineering mappings, and runnable multi-language implementations.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/206-reverse-linked-list/Mon, 09 Feb 2026 17:27:59 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/206-reverse-linked-list/Reverse a singly linked list in O(n) time and O(1) extra space with the three-pointer iterative template, with recursive comparison, engineering mapping, and runnable multi-language implementations.