<?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>Performance on Priyanshu Debnath</title><link>https://priyanshudebnath.me/tags/performance/</link><description>Recent content in Performance on Priyanshu Debnath</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sun, 05 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://priyanshudebnath.me/tags/performance/feed.xml" rel="self" type="application/rss+xml"/><item><title>Why My PBDS ordered_multiset Solution TLE'd (and the Fenwick Fix)</title><link>https://priyanshudebnath.me/posts/pbds-vs-fenwick-cache-tle/</link><pubDate>Sun, 05 Jul 2026 00:00:00 +0000</pubDate><guid>https://priyanshudebnath.me/posts/pbds-vs-fenwick-cache-tle/</guid><description>My approach to Zhily and Barknights was correct from the start, but the PBDS ordered_multiset implementation TLE&amp;#39;d twice. This post covers how Red-Black trees and order statistics work, and why a Fenwick tree passed instead.</description></item></channel></rss>