<?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[Dev Nectar - Medium]]></title>
        <description><![CDATA[Your go-to guide for mastering system design, data structures, algorithms, AI, GPT, and LLM skills - Medium]]></description>
        <link>https://medium.com/dev-nectar?source=rss----14192d4e4bd2---4</link>
        <image>
            <url>https://cdn-images-1.medium.com/proxy/1*TGH72Nnw24QL3iV9IOm4VA.png</url>
            <title>Dev Nectar - Medium</title>
            <link>https://medium.com/dev-nectar?source=rss----14192d4e4bd2---4</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Thu, 12 Nov 2026 16:08:28 GMT</lastBuildDate>
        <atom:link href="https://medium.com/feed/dev-nectar" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[5ms vs 50ms Latency — When Does It Really Matter?]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-snippet">&#x26A1;&#xFE0F;5ms sounds blazing fast. But is it always worth the engineering cost to shave off those extra milliseconds?</p><p class="medium-feed-link"><a href="https://medium.com/dev-nectar/5ms-vs-50ms-latency-when-does-it-really-matter-c04211ec0946?source=rss----14192d4e4bd2---4">Continue reading on Dev Nectar »</a></p></div>]]></description>
            <link>https://medium.com/dev-nectar/5ms-vs-50ms-latency-when-does-it-really-matter-c04211ec0946?source=rss----14192d4e4bd2---4</link>
            <guid isPermaLink="false">https://medium.com/p/c04211ec0946</guid>
            <category><![CDATA[latency]]></category>
            <category><![CDATA[system-design-concepts]]></category>
            <category><![CDATA[system-design-interview]]></category>
            <dc:creator><![CDATA[CodingThread]]></dc:creator>
            <pubDate>Sun, 27 Jul 2025 07:13:14 GMT</pubDate>
            <atom:updated>2025-07-27T07:12:50.026Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Why 99.99% Availability Is Harder Than You Think]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/dev-nectar/why-99-99-availability-is-harder-than-you-think-a22dc4fe50ec?source=rss----14192d4e4bd2---4"><img src="https://cdn-images-1.medium.com/max/2600/1*5_MqfoKXCKxj6hIwjSpayw.png" width="3840"></a></p><p class="medium-feed-snippet">The difference between 99.9% and 99.99% isn&#x2019;t just one more 9&#x200A;&#x2014;&#x200A;it&#x2019;s an entirely different engineering problem.</p><p class="medium-feed-link"><a href="https://medium.com/dev-nectar/why-99-99-availability-is-harder-than-you-think-a22dc4fe50ec?source=rss----14192d4e4bd2---4">Continue reading on Dev Nectar »</a></p></div>]]></description>
            <link>https://medium.com/dev-nectar/why-99-99-availability-is-harder-than-you-think-a22dc4fe50ec?source=rss----14192d4e4bd2---4</link>
            <guid isPermaLink="false">https://medium.com/p/a22dc4fe50ec</guid>
            <category><![CDATA[system-design-concepts]]></category>
            <category><![CDATA[sde-interview]]></category>
            <category><![CDATA[system-design-interview]]></category>
            <dc:creator><![CDATA[CodingThread]]></dc:creator>
            <pubDate>Sun, 27 Jul 2025 06:58:26 GMT</pubDate>
            <atom:updated>2025-07-27T06:58:03.910Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Why Erlang’s Process Model is Better Suited for Massive Concurrency]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-snippet">Erlang&#x2019;s process model is designed for massive concurrency, making it superior to traditional OS threads for several reasons:</p><p class="medium-feed-link"><a href="https://medium.com/dev-nectar/why-erlangs-process-model-is-better-suited-for-massive-concurrency-167966ac46eb?source=rss----14192d4e4bd2---4">Continue reading on Dev Nectar »</a></p></div>]]></description>
            <link>https://medium.com/dev-nectar/why-erlangs-process-model-is-better-suited-for-massive-concurrency-167966ac46eb?source=rss----14192d4e4bd2---4</link>
            <guid isPermaLink="false">https://medium.com/p/167966ac46eb</guid>
            <category><![CDATA[erlang]]></category>
            <category><![CDATA[concurrency]]></category>
            <dc:creator><![CDATA[CodingThread]]></dc:creator>
            <pubDate>Mon, 30 Jun 2025 00:40:37 GMT</pubDate>
            <atom:updated>2025-06-30T00:35:07.534Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Building Blocks of Distributed POI Systems: Scaling Real-Time Geospatial Platforms Globally (p1)]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/dev-nectar/building-blocks-of-distributed-poi-systems-scaling-real-time-geospatial-platforms-globally-p1-30016942a97e?source=rss----14192d4e4bd2---4"><img src="https://cdn-images-1.medium.com/max/1024/1*R1-ENM-yIjBaXeS-EEJNcg.png" width="1024"></a></p><p class="medium-feed-snippet">A deep dive into the core architectural patterns&#x200A;&#x2014;&#x200A;S2 Cells, Geo-Sharding, Spatial Queries, Real-Time Indexing, and Global Replication &#x2014;&#x2026;</p><p class="medium-feed-link"><a href="https://medium.com/dev-nectar/building-blocks-of-distributed-poi-systems-scaling-real-time-geospatial-platforms-globally-p1-30016942a97e?source=rss----14192d4e4bd2---4">Continue reading on Dev Nectar »</a></p></div>]]></description>
            <link>https://medium.com/dev-nectar/building-blocks-of-distributed-poi-systems-scaling-real-time-geospatial-platforms-globally-p1-30016942a97e?source=rss----14192d4e4bd2---4</link>
            <guid isPermaLink="false">https://medium.com/p/30016942a97e</guid>
            <category><![CDATA[uber]]></category>
            <category><![CDATA[software-architecture]]></category>
            <category><![CDATA[system-design-interview]]></category>
            <category><![CDATA[distributed-systems]]></category>
            <category><![CDATA[system-design-concepts]]></category>
            <dc:creator><![CDATA[ScalaBrix]]></dc:creator>
            <pubDate>Mon, 23 Jun 2025 11:43:29 GMT</pubDate>
            <atom:updated>2025-06-23T11:38:33.823Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Top K Frequent Words | Sorting by Frequency & Lex Order — Most Candidates Miss This]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/dev-nectar/top-k-frequent-words-sorting-by-frequency-lex-order-most-candidates-miss-this-1f8e73b66a8a?source=rss----14192d4e4bd2---4"><img src="https://cdn-images-1.medium.com/max/1024/1*L3CsaeeSSMVXHt0M65qeBg.png" width="1024"></a></p><p class="medium-feed-snippet">Solve it in O(N log K)&#x200A;&#x2014;&#x200A;Explore how heaps and custom comparators unlock hidden efficiency.</p><p class="medium-feed-link"><a href="https://medium.com/dev-nectar/top-k-frequent-words-sorting-by-frequency-lex-order-most-candidates-miss-this-1f8e73b66a8a?source=rss----14192d4e4bd2---4">Continue reading on Dev Nectar »</a></p></div>]]></description>
            <link>https://medium.com/dev-nectar/top-k-frequent-words-sorting-by-frequency-lex-order-most-candidates-miss-this-1f8e73b66a8a?source=rss----14192d4e4bd2---4</link>
            <guid isPermaLink="false">https://medium.com/p/1f8e73b66a8a</guid>
            <category><![CDATA[topkfrequent]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[sde-interview]]></category>
            <dc:creator><![CDATA[CodingThread]]></dc:creator>
            <pubDate>Sat, 21 Jun 2025 02:19:01 GMT</pubDate>
            <atom:updated>2025-06-21T02:21:40.277Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Sliding Window Median | Eviction Penalty Makes O(N log K) Trickier Than You Think]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/dev-nectar/sliding-window-median-eviction-penalty-makes-o-n-log-k-trickier-than-you-think-41c949c5c7a5?source=rss----14192d4e4bd2---4"><img src="https://cdn-images-1.medium.com/max/1024/1*E-nsa8PS__tmL2NBj493-w.png" width="1024"></a></p><p class="medium-feed-snippet">Solve it in O(N log K)&#x200A;&#x2014;&#x200A;but only if you handle the evicted median correctly.</p><p class="medium-feed-link"><a href="https://medium.com/dev-nectar/sliding-window-median-eviction-penalty-makes-o-n-log-k-trickier-than-you-think-41c949c5c7a5?source=rss----14192d4e4bd2---4">Continue reading on Dev Nectar »</a></p></div>]]></description>
            <link>https://medium.com/dev-nectar/sliding-window-median-eviction-penalty-makes-o-n-log-k-trickier-than-you-think-41c949c5c7a5?source=rss----14192d4e4bd2---4</link>
            <guid isPermaLink="false">https://medium.com/p/41c949c5c7a5</guid>
            <category><![CDATA[trees]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[sliding-windows]]></category>
            <category><![CDATA[heap]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[CodingThread]]></dc:creator>
            <pubDate>Wed, 18 Jun 2025 01:45:06 GMT</pubDate>
            <atom:updated>2025-06-18T01:44:45.385Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Prefix Sum Subarrays | O(N) Time — Most Candidates Miss the 0 → -1 Trick]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/dev-nectar/prefix-sum-subarrays-o-n-time-most-candidates-miss-the-0-1-trick-57f570d3f1f9?source=rss----14192d4e4bd2---4"><img src="https://cdn-images-1.medium.com/max/1536/1*elzUVFhYfgc03D0LSWoRxA.png" width="1536"></a></p><p class="medium-feed-snippet">Solve it in O(N)&#x200A;&#x2014;&#x200A;but only if you transform 0s to -1s first</p><p class="medium-feed-link"><a href="https://medium.com/dev-nectar/prefix-sum-subarrays-o-n-time-most-candidates-miss-the-0-1-trick-57f570d3f1f9?source=rss----14192d4e4bd2---4">Continue reading on Dev Nectar »</a></p></div>]]></description>
            <link>https://medium.com/dev-nectar/prefix-sum-subarrays-o-n-time-most-candidates-miss-the-0-1-trick-57f570d3f1f9?source=rss----14192d4e4bd2---4</link>
            <guid isPermaLink="false">https://medium.com/p/57f570d3f1f9</guid>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[prefix-sum]]></category>
            <category><![CDATA[arrays]]></category>
            <category><![CDATA[data-structures]]></category>
            <dc:creator><![CDATA[CodingThread]]></dc:creator>
            <pubDate>Tue, 17 Jun 2025 16:48:33 GMT</pubDate>
            <atom:updated>2025-06-17T16:48:12.518Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[ScalaBrix Digest: Jul’25 | Real-World System Design at Scale]]></title>
            <link>https://medium.com/dev-nectar/scalabrix-digest-jul25-real-world-system-design-at-scale-74b03971f24a?source=rss----14192d4e4bd2---4</link>
            <guid isPermaLink="false">https://medium.com/p/74b03971f24a</guid>
            <category><![CDATA[system-design-concepts]]></category>
            <category><![CDATA[distributed-systems]]></category>
            <category><![CDATA[system-design-interview]]></category>
            <dc:creator><![CDATA[ScalaBrix]]></dc:creator>
            <pubDate>Sun, 15 Jun 2025 14:57:03 GMT</pubDate>
            <atom:updated>2025-06-15T14:57:03.908Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*f8JGXiF09HqHKD6NpNGjPw.png" /></figure><p>System design isn’t just about microservices and buzzwords — it’s about making real systems work at scale. In our latest drops, we dive deep into distributed querying, from raw data to actionable insights.</p><p>If you’re solving for <strong>scale, reliability, and real-world architecture</strong>, these latest deep-dives are crafted for you. Each article explores practical distributed system design with production-grade thinking.</p><p>📌 <strong>1. </strong><a href="https://scalabrix.medium.com/architecting-distributed-query-systems-for-scale-ae0e9e251a71"><strong>Architecting Distributed Query Systems for Scale</strong></a><br> Explore how to design a distributed query engine — covering architecture patterns, worker coordination, and query routing for scalable reads.</p><p>📌 <strong>2. </strong><a href="https://scalabrix.medium.com/distributed-top-k-ip-query-at-web-scale-b867c3b9e358"><strong>Distributed Top-K IP Query at Web-Scale</strong></a><br> How do engineers find the most frequent IPs from 500M+ logs? Learn the design of a memory-efficient, parallel Top-K aggregation system built for scale.</p><p>📌 <strong>3. </strong><a href="https://scalabrix.medium.com/designing-robust-asynchronous-operations-architecture-and-end-to-end-workflow-part-1-eaff509b6991"><strong>Designing Robust Asynchronous Operations: Architecture and Workflow (Part 1)</strong></a><br> A detailed guide to async system design — covering task queues, retry handling, delayed execution, and observability.</p><p>📌 <strong>4. </strong><a href="https://scalabrix.medium.com/beyond-hashsets-architecting-high-throughput-unique-device-counting-systems-a4cd9d73c723"><strong>Beyond HashSets: High-Throughput Unique Device Counting</strong></a><br> Counting unique users across billions of events? Go beyond naïve approaches — this guide covers HyperLogLog, windowed aggregations, and deduplicated pipelines.</p><p>📌 <strong>5. </strong><a href="https://scalabrix.medium.com/from-log-chaos-to-order-scalable-reliable-log-merging-with-kafka-c6e4fdb1a38c"><strong>From Log Chaos to Order: Scalable Log Merging with Kafka</strong></a><br> Logs coming from multiple sources out of sync? This article shows how to build a robust Kafka-based log compaction and ordering system with deduplication and time consistency.</p><p>🧠 <em>Each article is crafted for engineers who design, debug, and scale systems in production.</em></p><p><strong>🔁 Read, share, and architect better.</strong></p><p>BR, Team ScalaBrix <br>July 15, 2025<br>💬 Let’s Connect &amp; Discuss:🔗 <a href="https://scalabrix.medium.com/"><em>ScalaBrix</em></a><em> </em>| <a href="https://x.com/designnerds24">X</a></p><p><strong><em>Disclaimer</em></strong><em> — Some of the articles mentioned above were originally published under the </em><a href="https://levelup.gitconnected.com/"><em>Level Up Coding</em></a><em> authored by </em><a href="https://scalabrix.medium.com/"><em>ScalaBrix</em></a><em>.</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=74b03971f24a" width="1" height="1" alt=""><hr><p><a href="https://medium.com/dev-nectar/scalabrix-digest-jul25-real-world-system-design-at-scale-74b03971f24a">ScalaBrix Digest: Jul’25 | Real-World System Design at Scale</a> was originally published in <a href="https://medium.com/dev-nectar">Dev Nectar</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[System Architecture : Client-Side Caching Layer with ETag Validation]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/dev-nectar/system-architecture-client-side-caching-layer-with-etag-validation-67b2ce6e3347?source=rss----14192d4e4bd2---4"><img src="https://cdn-images-1.medium.com/max/1536/1*IPsxyhq_4H0vUAoBgc5bUA.png" width="1536"></a></p><p class="medium-feed-snippet">Decentralized caching meets intelligent ETag validation&#x200A;&#x2014;&#x200A;scale faster, load smarter, fail gracefully.</p><p class="medium-feed-link"><a href="https://medium.com/dev-nectar/system-architecture-client-side-caching-layer-with-etag-validation-67b2ce6e3347?source=rss----14192d4e4bd2---4">Continue reading on Dev Nectar »</a></p></div>]]></description>
            <link>https://medium.com/dev-nectar/system-architecture-client-side-caching-layer-with-etag-validation-67b2ce6e3347?source=rss----14192d4e4bd2---4</link>
            <guid isPermaLink="false">https://medium.com/p/67b2ce6e3347</guid>
            <category><![CDATA[system-design-interview]]></category>
            <category><![CDATA[software-architecture]]></category>
            <category><![CDATA[software-development]]></category>
            <category><![CDATA[system-design-concepts]]></category>
            <category><![CDATA[caching]]></category>
            <dc:creator><![CDATA[ScalaBrix]]></dc:creator>
            <pubDate>Wed, 30 Apr 2025 10:45:35 GMT</pubDate>
            <atom:updated>2025-05-08T03:51:39.139Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Load Balancers, API Gateways, Forward Proxies, and Reverse Proxies]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/dev-nectar/load-balancers-api-gateways-forward-proxies-and-reverse-proxies-cdd03e629553?source=rss----14192d4e4bd2---4"><img src="https://cdn-images-1.medium.com/max/2600/1*GvY8DHCGMxhmFDC-cq4u0Q.png" width="2668"></a></p><p class="medium-feed-snippet">Understanding Key Network Components: Functionality, Architectural Differences, Performance Impact for Optimized System Design</p><p class="medium-feed-link"><a href="https://medium.com/dev-nectar/load-balancers-api-gateways-forward-proxies-and-reverse-proxies-cdd03e629553?source=rss----14192d4e4bd2---4">Continue reading on Dev Nectar »</a></p></div>]]></description>
            <link>https://medium.com/dev-nectar/load-balancers-api-gateways-forward-proxies-and-reverse-proxies-cdd03e629553?source=rss----14192d4e4bd2---4</link>
            <guid isPermaLink="false">https://medium.com/p/cdd03e629553</guid>
            <category><![CDATA[forward-proxy]]></category>
            <category><![CDATA[api-gateway]]></category>
            <category><![CDATA[system-design-interview]]></category>
            <category><![CDATA[load-balancer]]></category>
            <category><![CDATA[system-design-concepts]]></category>
            <dc:creator><![CDATA[ScalaBrix]]></dc:creator>
            <pubDate>Thu, 03 Oct 2024 04:26:00 GMT</pubDate>
            <atom:updated>2024-11-05T03:06:50.844Z</atom:updated>
        </item>
    </channel>
</rss>