<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>fiveyearsdev</title>
    <link>https://fiveyearsdev.space</link>
    <atom:link href="https://fiveyearsdev.space/feed.xml" rel="self" type="application/rss+xml" />
    <description>Deep, beautifully typeset articles on system design (HLD), low-level design (LLD), and the computer-science fundamentals that decide interviews — everything a developer should know by five years.</description>
    <language>en</language>
    <item>
      <title>Designing a Thread-Safe LRU Cache</title>
      <link>https://fiveyearsdev.space/articles/designing-a-thread-safe-lru-cache</link>
      <guid isPermaLink="true">https://fiveyearsdev.space/articles/designing-a-thread-safe-lru-cache</guid>
      <pubDate>Tue, 02 Jun 2026 00:00:00 GMT</pubDate>
      <description>A low-level-design walkthrough of an O(1) LRU cache in Java — HashMap plus an intrusive doubly linked list — and how to make it correct under concurrency. Includes the full, browsable implementation.</description>
      <category>lld</category>
      <category>caching</category>
      <category>concurrency</category>
      <category>java</category>
    </item>
    <item>
      <title>Dijkstra's Shortest Path, From Scratch</title>
      <link>https://fiveyearsdev.space/articles/dijkstras-shortest-path</link>
      <guid isPermaLink="true">https://fiveyearsdev.space/articles/dijkstras-shortest-path</guid>
      <pubDate>Thu, 28 May 2026 00:00:00 GMT</pubDate>
      <description>Dijkstra's algorithm derived from its invariant, with the complexity analysis that explains why a binary heap gives O((V + E) log V) and a clean Java implementation.</description>
      <category>graphs</category>
      <category>shortest-path</category>
      <category>algorithms</category>
      <category>heaps</category>
    </item>
    <item>
      <title>Designing a Rate Limiter</title>
      <link>https://fiveyearsdev.space/articles/designing-a-rate-limiter</link>
      <guid isPermaLink="true">https://fiveyearsdev.space/articles/designing-a-rate-limiter</guid>
      <pubDate>Wed, 20 May 2026 00:00:00 GMT</pubDate>
      <description>How to design a rate limiter — algorithms, trade-offs, and a production-ready, thread-safe token bucket wired into Spring Boot as an interceptor.</description>
      <category>rate-limiting</category>
      <category>system-design</category>
      <category>spring-boot</category>
      <category>concurrency</category>
    </item>
  </channel>
</rss>