Binary Search on Jeanphilo Bloghttps://shio-chan-dev.github.io/jeanblog/tags/binary-search/Recent content in Binary Search on Jeanphilo BlogHugo -- 0.159.2en-usWed, 18 Mar 2026 13:49:55 +0800LeetCode 2089: Find Target Indices After Sorting Array ACERS Guidehttps://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.LeetCode 2529: Maximum Count of Positive Integer and Negative Integer ACERS Guidehttps://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.LeetCode 34: Find First and Last Position of Element in Sorted Array ACERS Guidehttps://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.LeetCode 35: Search Insert Position Lower-Bound Binary Search ACERS Guidehttps://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.LeetCode 744: Find Smallest Letter Greater Than Target Upper-Bound ACERS Guidehttps://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.