<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Archit Agarwal on Medium]]></title>
        <description><![CDATA[Stories by Archit Agarwal on Medium]]></description>
        <link>https://medium.com/@architagr?source=rss-936daaecae4b------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*F9zUDaRbDQagxoU_wLtZ_w.png</url>
            <title>Stories by Archit Agarwal on Medium</title>
            <link>https://medium.com/@architagr?source=rss-936daaecae4b------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Mon, 16 Nov 2026 19:50:45 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@architagr/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[An all-hands invite searched the org chart 2,000 times]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://levelup.gitconnected.com/lowest-common-ancestor-in-go-one-walk-for-a-whole-invite-968374b3a6e1?source=rss-936daaecae4b------2"><img src="https://cdn-images-1.medium.com/max/1200/1*BuBIJyTaIt1VW5UIpZHxlA.png" width="1200"></a></p><p class="medium-feed-snippet">It worked in dev &#xB7; Episode 24 &#xB7; technique: lowest common ancestor, counted bottom-up</p><p class="medium-feed-link"><a href="https://levelup.gitconnected.com/lowest-common-ancestor-in-go-one-walk-for-a-whole-invite-968374b3a6e1?source=rss-936daaecae4b------2">Continue reading on Level Up Coding »</a></p></div>]]></description>
            <link>https://levelup.gitconnected.com/lowest-common-ancestor-in-go-one-walk-for-a-whole-invite-968374b3a6e1?source=rss-936daaecae4b------2</link>
            <guid isPermaLink="false">https://medium.com/p/968374b3a6e1</guid>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[golang]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[performance]]></category>
            <dc:creator><![CDATA[Archit Agarwal]]></dc:creator>
            <pubDate>Mon, 09 Nov 2026 20:22:49 GMT</pubDate>
            <atom:updated>2026-11-09T20:22:49.068Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[A price filter read 200,000 products to return 20]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://levelup.gitconnected.com/bst-range-query-in-go-prune-both-sides-of-an-in-order-walk-580d06b2f0a1?source=rss-936daaecae4b------2"><img src="https://cdn-images-1.medium.com/max/1200/1*RfFwNYESFYFW7_h3fnK6tQ.png" width="1200"></a></p><p class="medium-feed-snippet">It worked in dev &#xB7; Episode 23 &#xB7; technique: in-order walk, pruned by the ordering</p><p class="medium-feed-link"><a href="https://levelup.gitconnected.com/bst-range-query-in-go-prune-both-sides-of-an-in-order-walk-580d06b2f0a1?source=rss-936daaecae4b------2">Continue reading on Level Up Coding »</a></p></div>]]></description>
            <link>https://levelup.gitconnected.com/bst-range-query-in-go-prune-both-sides-of-an-in-order-walk-580d06b2f0a1?source=rss-936daaecae4b------2</link>
            <guid isPermaLink="false">https://medium.com/p/580d06b2f0a1</guid>
            <category><![CDATA[golang]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[performance]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[Archit Agarwal]]></dc:creator>
            <pubDate>Mon, 09 Nov 2026 16:51:33 GMT</pubDate>
            <atom:updated>2026-11-09T16:51:33.024Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Kahn’s algorithm lost to a for loop on our build graph]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://levelup.gitconnected.com/topological-sort-in-go-when-kahn-loses-to-a-simple-loop-5731c55c4675?source=rss-936daaecae4b------2"><img src="https://cdn-images-1.medium.com/max/1200/1*LeKpKZstbUljxLcmEa3YqQ.png" width="1200"></a></p><p class="medium-feed-snippet">It worked in dev &#xB7; Episode 22 &#xB7; technique: topological sort, counting what each node waits for</p><p class="medium-feed-link"><a href="https://levelup.gitconnected.com/topological-sort-in-go-when-kahn-loses-to-a-simple-loop-5731c55c4675?source=rss-936daaecae4b------2">Continue reading on Level Up Coding »</a></p></div>]]></description>
            <link>https://levelup.gitconnected.com/topological-sort-in-go-when-kahn-loses-to-a-simple-loop-5731c55c4675?source=rss-936daaecae4b------2</link>
            <guid isPermaLink="false">https://medium.com/p/5731c55c4675</guid>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[performance]]></category>
            <category><![CDATA[golang]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Archit Agarwal]]></dc:creator>
            <pubDate>Fri, 06 Nov 2026 16:49:24 GMT</pubDate>
            <atom:updated>2026-11-06T16:49:24.283Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[A config 5x longer took 28.7x longer to validate]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://levelup.gitconnected.com/graph-valid-tree-in-go-count-the-links-then-union-find-4c7d2ef237c5?source=rss-936daaecae4b------2"><img src="https://cdn-images-1.medium.com/max/1200/1*Tvk1R3ejngTDhS3HWgxDGg.png" width="1200"></a></p><p class="medium-feed-snippet">It worked in dev &#xB7; Episode 21 &#xB7; technique: count the links, then union-find</p><p class="medium-feed-link"><a href="https://levelup.gitconnected.com/graph-valid-tree-in-go-count-the-links-then-union-find-4c7d2ef237c5?source=rss-936daaecae4b------2">Continue reading on Level Up Coding »</a></p></div>]]></description>
            <link>https://levelup.gitconnected.com/graph-valid-tree-in-go-count-the-links-then-union-find-4c7d2ef237c5?source=rss-936daaecae4b------2</link>
            <guid isPermaLink="false">https://medium.com/p/4c7d2ef237c5</guid>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[performance]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[golang]]></category>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Archit Agarwal]]></dc:creator>
            <pubDate>Mon, 02 Nov 2026 05:15:09 GMT</pubDate>
            <atom:updated>2026-11-02T05:15:09.429Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[999 more stores made the delivery map 213x slower]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://levelup.gitconnected.com/distance-to-nearest-store-in-go-two-sweeps-not-a-queue-fb2948e1e15d?source=rss-936daaecae4b------2"><img src="https://cdn-images-1.medium.com/max/1200/1*BMUB83HOgtGNZCd7whieZg.png" width="1200"></a></p><p class="medium-feed-snippet">It worked in dev &#xB7; Episode 20 &#xB7; technique: two sweeps instead of a queue</p><p class="medium-feed-link"><a href="https://levelup.gitconnected.com/distance-to-nearest-store-in-go-two-sweeps-not-a-queue-fb2948e1e15d?source=rss-936daaecae4b------2">Continue reading on Level Up Coding »</a></p></div>]]></description>
            <link>https://levelup.gitconnected.com/distance-to-nearest-store-in-go-two-sweeps-not-a-queue-fb2948e1e15d?source=rss-936daaecae4b------2</link>
            <guid isPermaLink="false">https://medium.com/p/fb2948e1e15d</guid>
            <category><![CDATA[golang]]></category>
            <category><![CDATA[performance]]></category>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[Archit Agarwal]]></dc:creator>
            <pubDate>Mon, 02 Nov 2026 05:14:39 GMT</pubDate>
            <atom:updated>2026-11-02T05:14:39.159Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[499 new links made the network count 608x slower]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://levelup.gitconnected.com/counting-connected-components-in-go-one-sweep-not-n-bfs-9bfd8cf7efa0?source=rss-936daaecae4b------2"><img src="https://cdn-images-1.medium.com/max/1200/1*LbjpiDp_jVR_y772Y2upHA.png" width="1200"></a></p><p class="medium-feed-snippet">It worked in dev &#xB7; Episode 18 &#xB7; technique: connected components, one sweep</p><p class="medium-feed-link"><a href="https://levelup.gitconnected.com/counting-connected-components-in-go-one-sweep-not-n-bfs-9bfd8cf7efa0?source=rss-936daaecae4b------2">Continue reading on Level Up Coding »</a></p></div>]]></description>
            <link>https://levelup.gitconnected.com/counting-connected-components-in-go-one-sweep-not-n-bfs-9bfd8cf7efa0?source=rss-936daaecae4b------2</link>
            <guid isPermaLink="false">https://medium.com/p/9bfd8cf7efa0</guid>
            <category><![CDATA[performance]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[golang]]></category>
            <dc:creator><![CDATA[Archit Agarwal]]></dc:creator>
            <pubDate>Wed, 28 Oct 2026 16:35:34 GMT</pubDate>
            <atom:updated>2026-10-28T16:35:34.717Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Invalidation got faster; computing it got 540x slower]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://levelup.gitconnected.com/multi-source-bfs-in-go-seed-the-queue-do-not-loop-searches-44b86b6b9c8f?source=rss-936daaecae4b------2"><img src="https://cdn-images-1.medium.com/max/1200/1*M4s-DFQ1vPmo8KkzRIQkuw.png" width="1200"></a></p><p class="medium-feed-snippet">It worked in dev &#xB7; Episode 19 &#xB7; technique: multi-source BFS</p><p class="medium-feed-link"><a href="https://levelup.gitconnected.com/multi-source-bfs-in-go-seed-the-queue-do-not-loop-searches-44b86b6b9c8f?source=rss-936daaecae4b------2">Continue reading on Level Up Coding »</a></p></div>]]></description>
            <link>https://levelup.gitconnected.com/multi-source-bfs-in-go-seed-the-queue-do-not-loop-searches-44b86b6b9c8f?source=rss-936daaecae4b------2</link>
            <guid isPermaLink="false">https://medium.com/p/44b86b6b9c8f</guid>
            <category><![CDATA[performance]]></category>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[golang]]></category>
            <dc:creator><![CDATA[Archit Agarwal]]></dc:creator>
            <pubDate>Wed, 28 Oct 2026 16:35:23 GMT</pubDate>
            <atom:updated>2026-10-28T16:35:23.202Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Your category report changes its answer on refresh]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://levelup.gitconnected.com/max-level-sum-in-go-why-a-map-keyed-version-is-random-aad84b7bd501?source=rss-936daaecae4b------2"><img src="https://cdn-images-1.medium.com/max/1200/1*QXomeuRm5uhxs5oREyxNVg.png" width="1200"></a></p><p class="medium-feed-snippet">It worked in dev &#xB7; Episode 17 &#xB7; technique: depth as an index, read in order</p><p class="medium-feed-link"><a href="https://levelup.gitconnected.com/max-level-sum-in-go-why-a-map-keyed-version-is-random-aad84b7bd501?source=rss-936daaecae4b------2">Continue reading on Level Up Coding »</a></p></div>]]></description>
            <link>https://levelup.gitconnected.com/max-level-sum-in-go-why-a-map-keyed-version-is-random-aad84b7bd501?source=rss-936daaecae4b------2</link>
            <guid isPermaLink="false">https://medium.com/p/aad84b7bd501</guid>
            <category><![CDATA[golang]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[performance]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[software-engineering]]></category>
            <dc:creator><![CDATA[Archit Agarwal]]></dc:creator>
            <pubDate>Mon, 26 Oct 2026 13:39:59 GMT</pubDate>
            <atom:updated>2026-10-26T13:39:59.315Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[The collapsed thread built 55,987 previews to show 7]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://levelup.gitconnected.com/one-preview-per-nesting-level-in-go-tree-right-side-view-d2618305401f?source=rss-936daaecae4b------2"><img src="https://cdn-images-1.medium.com/max/1200/1*V4BC48JU5N0QZfKD8MSiqg.png" width="1200"></a></p><p class="medium-feed-snippet">It worked in dev &#xB7; Episode 16 &#xB7; technique: first arrival wins</p><p class="medium-feed-link"><a href="https://levelup.gitconnected.com/one-preview-per-nesting-level-in-go-tree-right-side-view-d2618305401f?source=rss-936daaecae4b------2">Continue reading on Level Up Coding »</a></p></div>]]></description>
            <link>https://levelup.gitconnected.com/one-preview-per-nesting-level-in-go-tree-right-side-view-d2618305401f?source=rss-936daaecae4b------2</link>
            <guid isPermaLink="false">https://medium.com/p/d2618305401f</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[golang]]></category>
            <category><![CDATA[performance]]></category>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[Archit Agarwal]]></dc:creator>
            <pubDate>Wed, 21 Oct 2026 21:25:04 GMT</pubDate>
            <atom:updated>2026-10-21T21:25:04.113Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Your org chart read 55,987 rows to draw the first 43]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://levelup.gitconnected.com/level-order-traversal-in-go-stop-at-depth-n-with-a-queue-9c73636cfa2e?source=rss-936daaecae4b------2"><img src="https://cdn-images-1.medium.com/max/1200/1*7maC71AlxOJBXUSqy4OcVw.png" width="1200"></a></p><p class="medium-feed-snippet">It worked in dev &#xB7; Episode 15 &#xB7; technique: level order with a queue</p><p class="medium-feed-link"><a href="https://levelup.gitconnected.com/level-order-traversal-in-go-stop-at-depth-n-with-a-queue-9c73636cfa2e?source=rss-936daaecae4b------2">Continue reading on Level Up Coding »</a></p></div>]]></description>
            <link>https://levelup.gitconnected.com/level-order-traversal-in-go-stop-at-depth-n-with-a-queue-9c73636cfa2e?source=rss-936daaecae4b------2</link>
            <guid isPermaLink="false">https://medium.com/p/9c73636cfa2e</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[golang]]></category>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[performance]]></category>
            <dc:creator><![CDATA[Archit Agarwal]]></dc:creator>
            <pubDate>Mon, 19 Oct 2026 15:48:17 GMT</pubDate>
            <atom:updated>2026-10-19T15:48:17.218Z</atom:updated>
        </item>
    </channel>
</rss>