https://shio-chan-dev.github.io/jeanblog/tags/acers/Recent content in ACERS on Jeanphilo BlogHugo -- 0.159.2en-usThu, 19 Mar 2026 13:18:26 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/133-clone-graph/Thu, 19 Mar 2026 13:18:26 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/133-clone-graph/Clone a connected undirected graph by mapping original nodes to cloned nodes, with DFS and BFS variants, cycle handling, correctness reasoning, and runnable implementations in six languages.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/2089-find-target-indices-after-sorting-array/Wed, 18 Mar 2026 13:49:55 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/2089-find-target-indices-after-sorting-array/Sort the array, locate the target block with lower and upper bounds, and return every target index, with tradeoff analysis, engineering mappings, and runnable implementations in six languages.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/2529-maximum-count-of-positive-integer-and-negative-integer/Wed, 18 Mar 2026 13:49:55 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/2529-maximum-count-of-positive-integer-and-negative-integer/Count negatives and positives in a sorted array by locating the boundaries around zero with lower-bound and upper-bound binary search, with engineering mappings and runnable implementations in six languages.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/34-find-first-and-last-position-of-element-in-sorted-array/Wed, 18 Mar 2026 13:49:55 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/34-find-first-and-last-position-of-element-in-sorted-array/Find the start and end positions of a target in a sorted array by combining lower-bound and upper-bound binary search, with boundary reasoning, engineering mappings, and runnable implementations in six languages.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/35-search-insert-position/Wed, 18 Mar 2026 13:49:55 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/35-search-insert-position/Find the insertion index of a target in a sorted array with lower-bound binary search in O(log n), with boundary reasoning, engineering mappings, and runnable implementations in six languages.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/744-find-smallest-letter-greater-than-target/Wed, 18 Mar 2026 13:49:55 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/744-find-smallest-letter-greater-than-target/Find the smallest character strictly greater than a target in a sorted circular array by using upper-bound binary search and wrap-around logic, with pitfalls, engineering mappings, and runnable implementations in six languages.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/54-spiral-matrix/Tue, 03 Feb 2026 10:01:50 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/54-spiral-matrix/Traverse a matrix in clockwise spiral order in O(mn) using boundary shrinking. Includes engineering scenarios, pitfalls, and multi-language implementations.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/42-trapping-rain-water/Sat, 24 Jan 2026 10:40:53 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/42-trapping-rain-water/Compute trapped rain water in O(n) using two pointers and left/right maxima. Includes engineering scenarios, pitfalls, and multi-language implementations.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/53-maximum-subarray/Fri, 23 Jan 2026 13:21:02 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/53-maximum-subarray/Use Kadane's algorithm to compute the maximum subarray sum in O(n). Includes engineering scenarios, pitfalls, and multi-language implementations.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/1437-check-if-all-ones-are-at-least-k-places-away/Thu, 22 Jan 2026 10:49:42 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/1437-check-if-all-ones-are-at-least-k-places-away/One-pass check to ensure all 1s are at least k apart. Includes engineering scenarios, pitfalls, and multi-language implementations.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/231-power-of-two/Wed, 21 Jan 2026 14:06:56 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/231-power-of-two/Judge whether an integer is a power of two in O(1) time using bit tricks. Includes engineering scenarios, pitfalls, and multi-language solutions.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/1456-maximum-number-of-vowels-in-a-substring-of-given-length/Tue, 20 Jan 2026 13:40:45 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/1456-maximum-number-of-vowels-in-a-substring-of-given-length/Use a fixed-size sliding window to compute the maximum number of vowels in O(n). Includes engineering scenarios and multi-language implementations.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/1512-number-of-good-pairs/Tue, 30 Dec 2025 11:40:00 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/1512-number-of-good-pairs/Solve Good Pairs with one-pass hash counting, plus engineering scenarios, complexity, and multi-language solutions.