<?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>Divide and Conquer on Priyanshu Debnath</title><link>https://priyanshudebnath.me/tags/divide-and-conquer/</link><description>Recent content in Divide and Conquer on Priyanshu Debnath</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 26 Sep 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://priyanshudebnath.me/tags/divide-and-conquer/feed.xml" rel="self" type="application/rss+xml"/><item><title>Scan From Both Ends: How One Line Took My Divide and Conquer From TLE to AC</title><link>https://priyanshudebnath.me/posts/scan-from-both-ends/</link><pubDate>Sat, 26 Sep 2026 00:00:00 +0000</pubDate><guid>https://priyanshudebnath.me/posts/scan-from-both-ends/</guid><description>My solution to Vlad, Misha and Two Arrays was correct and still got TLE on test 14. The fix was to check the split candidates in the order l, r, l+1, r-1, ... instead of left to right. Here is why that one change turns O(n²) into O(n log n).</description></item></channel></rss>