<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Boundary Search on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/boundary-search/</link><description>Recent content in Boundary Search on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>en-us</language><lastBuildDate>Wed, 18 Mar 2026 13:49:55 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/boundary-search/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 34: Find First and Last Position of Element in Sorted Array</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/34-find-first-and-last-position-of-element-in-sorted-array/</link><pubDate>Wed, 18 Mar 2026 13:49:55 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/34-find-first-and-last-position-of-element-in-sorted-array/</guid><description>Start from a linear-scan baseline, derive two half-open binary-search boundaries, and return the complete target range in O(log n) time.</description></item></channel></rss>