<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Md. Rashed Raihan — Competitive Programmer &amp; CSE Undergrad</title><description>Personal blog and portfolio of Md. Rashed Raihan — a CSE undergraduate at MBSTU writing about algorithms, problem-solving, and software engineering.</description><link>https://portfolio-byd.pages.dev/</link><language>en-us</language><item><title>Binary Search Beyond the Basics</title><link>https://portfolio-byd.pages.dev/blog/binary-search-beyond-basics/</link><guid isPermaLink="true">https://portfolio-byd.pages.dev/blog/binary-search-beyond-basics/</guid><description>Most programmers learn binary search on sorted arrays. In competitive programming, you binary-search the answer — and that changes everything.</description><pubDate>Thu, 28 May 2026 00:00:00 GMT</pubDate><category>algorithms</category><category>competitive-programming</category><category>binary-search</category></item><item><title>Understanding Segment Trees: A Competitive Programmer&apos;s Deep Dive</title><link>https://portfolio-byd.pages.dev/blog/understanding-segment-trees/</link><guid isPermaLink="true">https://portfolio-byd.pages.dev/blog/understanding-segment-trees/</guid><description>A thorough walkthrough of segment trees with lazy propagation — from first principles to real contest applications.</description><pubDate>Wed, 20 May 2026 00:00:00 GMT</pubDate><category>data-structures</category><category>competitive-programming</category><category>algorithms</category></item></channel></rss>