<?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>Binary-Search on Hitesh Patel</title><link>https://hiteshbuilds.com/tags/binary-search/</link><description>Recent content in Binary-Search on Hitesh Patel</description><generator>Hugo -- 0.155.3</generator><language>en-us</language><lastBuildDate>Sun, 15 Feb 2026 00:00:00 +0530</lastBuildDate><atom:link href="https://hiteshbuilds.com/tags/binary-search/index.xml" rel="self" type="application/rss+xml"/><item><title>Three Sum (Blind 75) — O(n²) Solution</title><link>https://hiteshbuilds.com/blind-75/three-sum/</link><pubDate>Sun, 15 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/three-sum/</guid><description>A complete breakdown of finding unique triplets that sum to zero — from the brute force approach to reducing Three Sum into a Two Sum problem for an optimal O(n²) solution.</description></item><item><title>Search in Rotated Sorted Array (Blind 75) — O(log n) Solution</title><link>https://hiteshbuilds.com/blind-75/search-in-rotated-sorted-array/</link><pubDate>Fri, 13 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/search-in-rotated-sorted-array/</guid><description>A complete breakdown of searching an element from an rotated sorted array. Starting from brute force to using binary search for optimal solution.</description></item><item><title>Blind 75: Find Minimum in Rotated Sorted Array — Understanding Binary Search Deeper</title><link>https://hiteshbuilds.com/blind-75/find-minimum-in-rotated-sorted-array/</link><pubDate>Wed, 11 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/find-minimum-in-rotated-sorted-array/</guid><description>A complete breakdown of finding the minimum element from an roated sorted array from Blind 75 List. Starting from brute force to using binary search for optimal solution.</description></item></channel></rss>