<?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>LeetCode 35 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/leetcode-35/</link><description>Recent content in LeetCode 35 on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</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/leetcode-35/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 35: Search Insert Position Lower-Bound Binary Search ACERS Guide</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/35-search-insert-position/</link><pubDate>Wed, 18 Mar 2026 13:49:55 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/35-search-insert-position/</guid><description>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.</description></item></channel></rss>