Divide and Conquer on Jeanphilo Bloghttps://jeanphilogong.github.io/jeanblog/tags/divide-and-conquer/Recent content in Divide and Conquer on Jeanphilo BlogHugo -- 0.168.0en-usMon, 20 Apr 2026 10:01:46 +0800Hot100: Construct Binary Tree from Preorder and Inorder Traversal (Indexed Divide-and-Conquer ACERS Guide)https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/binary-tree/105-construct-binary-tree-from-preorder-and-inorder-traversal/Mon, 20 Apr 2026 10:01:46 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/binary-tree/105-construct-binary-tree-from-preorder-and-inorder-traversal/A practical guide to LeetCode 105 covering how preorder chooses the root, how inorder splits the subtrees, and how a hash map plus index recursion reduces reconstruction to O(n).Hot100: Convert Sorted Array to Binary Search Tree (Midpoint Divide-and-Conquer ACERS Guide)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.Hot100: Sort List Linked-List Merge Sort ACERS Guidehttps://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/148-sort-list/Tue, 10 Feb 2026 17:07:38 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/148-sort-list/Sort a singly linked list in O(n log n) time using split + recursive merge sort. This guide explains derivation, invariants, engineering mappings, and runnable multi-language implementations.Hot100: Merge K Sorted Lists Divide-and-Conquer O(N log k) ACERS Guidehttps://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/23-merge-k-sorted-lists/Tue, 10 Feb 2026 17:05:53 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/23-merge-k-sorted-lists/Upgrade from LeetCode 21 to k-way merge: derive why sequential merge degrades, then use divide-and-conquer to reach O(N log k), with heap comparison and runnable multi-language implementations.Sorting Series (5): Quick Sort - Pivot Strategy, Tail Recursion, Engineering Practicehttps://jeanphilogong.github.io/jeanblog/alg/sorting/5.sorting-series-quick-sort/Fri, 05 Dec 2025 00:00:00 +0000https://jeanphilogong.github.io/jeanblog/alg/sorting/5.sorting-series-quick-sort/Comprehensive quicksort guide: pivot selection, three-way partitioning, tail recursion optimization, hybrid sorting practices, with multilingual implementations and engineering guidance.Sorting Series (4): Merge Sort - Stable Divide and Conquer and External Sortinghttps://jeanphilogong.github.io/jeanblog/alg/sorting/4.sorting-series-merge-sort/Thu, 04 Dec 2025 00:00:00 +0000https://jeanphilogong.github.io/jeanblog/alg/sorting/4.sorting-series-merge-sort/Systematic explanation of merge sort principles, stability, space trade-offs, and engineering scenarios with Python/C/C++/Go/Rust/JS implementations and external sorting guidance.