<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Memory Management on miti99</title><link>https://miti99.com/en/tags/memory-management/</link><description>Recent content in Memory Management on miti99</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 16 Nov 2026 17:39:19 +0700</lastBuildDate><atom:link href="https://miti99.com/en/tags/memory-management/index.xml" rel="self" type="application/rss+xml"/><item><title>Newsletter #97</title><link>https://miti99.com/en/post/2026/04/17/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0700</pubDate><guid>https://miti99.com/en/post/2026/04/17/</guid><description>&lt;p&gt;&lt;em&gt;Enjoy Newsletter #97.&lt;/em&gt;&lt;/p&gt;
&lt;h2 id="why-we"&gt;&lt;a href="https://blog.cloudflare.com/rethinking-cache-ai-humans/" rel="noopener noreferrer"&gt;Why we&amp;rsquo;re rethinking cache for the AI era&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Cloudflare reports that 32% of traffic across its network is automated, with AI bots alone surpassing 10 billion requests per week. Unlike human visitors, AI crawlers—especially agentic RAG loops that iteratively refine queries—exhibit 70–100% unique URL ratios, constantly fetching fresh deep links across documentation, source code, and media rather than revisiting popular pages, and they maintain no session state so every worker instance looks like a separate client. The result is soaring cache-miss rates, ineffective traditional prefetching, and degraded performance for real humans: Wikimedia saw multimedia bandwidth jump 50%, while Read the Docs, Fedora, and Diaspora all suffered slowdowns from crawlers repeatedly pulling large assets.&lt;/p&gt;
&lt;p&gt;In the short term, Cloudflare is experimenting with replacing classic LRU cache eviction with SIEVE and S3-FIFO—early tests show human cache-hit ratios stay protected even under heavy AI crawler load—while developing ML-driven, workload-aware caching policies. Longer term, they envision dedicated caching tiers for AI traffic: human users stay on fast latency-optimized edge caches, latency-sensitive AI workloads like live RAG or summarization use an intermediate tier, and latency-tolerant model-training crawlers get routed to deeper storage tiers or queued during origin overload.&lt;/p&gt;
&lt;h2 id="a-behind-the-scenes-look-at-how-we-release-the-spotify-app-part-1"&gt;&lt;a href="https://engineering.atspotify.com/2025/04/how-we-release-the-spotify-app-part-1" rel="noopener noreferrer"&gt;A Behind-the-Scenes Look at How We Release the Spotify App (Part 1)&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Spotify pulls back the curtain on how its Release team ships the iOS and Android apps to more than 675 million users, bundling hundreds of changes into every weekly release. Release Managers both coordinate across feature squads and build the internal release tooling, constantly balancing velocity against stability. Following version 8.9.2 as a case study, each release cycle spans roughly two weeks: week one is active development with nightly builds shipped to internal alpha testers; in week two, a release branch is cut that accepts only critical cherry-pick fixes while moving through beta testing and manual regression QA; the weekend and Monday cover final stabilization and app-store submission, followed by a staged rollout from 1% to 100% of users on Tuesday and Wednesday.&lt;/p&gt;
&lt;p&gt;Before submission, every release must clear strict quality gates: all commits pass automated test suites, zero release-blocking bugs remain open, stakeholder teams sign off, crash-free rates stay above threshold, and content-consumption telemetry looks healthy. To de-risk big launches like Audiobooks in 8.9.2, major features get dedicated rollout schedules and extra crash scrutiny; feature flags let engineers merge unfinished code safely while keeping it dark in production; and the initial 1% rollout catches severe regressions before they hit the wider user base. Thanks to this discipline, roughly 95% of scheduled releases ship to 100% of users on time every week.&lt;/p&gt;
&lt;h2 id="components-of-a-coding-agent"&gt;&lt;a href="https://magazine.sebastianraschka.com/p/components-of-a-coding-agent" rel="noopener noreferrer"&gt;Components of A Coding Agent&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Sebastian Raschka explains that coding agents like Claude Code or Codex CLI are fundamentally software harnesses wrapped around an LLM that turn a raw text model into a capable engineering tool. An agent&amp;rsquo;s real-world effectiveness, he argues, comes not just from the underlying model weights, but largely from the harness—its control loop, runtime environment, and context-management discipline. A well-engineered harness makes both reasoning and non-reasoning models perform dramatically better than they ever could inside a plain chat window.&lt;/p&gt;
&lt;p&gt;The article breaks a coding agent down into six core components. First is &lt;em&gt;live repo context&lt;/em&gt;: gathering directory structure, Git status, and project instructions before acting on a prompt. Second is &lt;em&gt;prompt prefix caching&lt;/em&gt;: splitting the prompt into a stable prefix (tools, system instructions) and a dynamic suffix so KV caches can be reused across turns, slashing latency and cost. Third is &lt;em&gt;structured tool access&lt;/em&gt;: an explicit catalog of typed tools gated by permission checks, far safer and more reliable than parsing free-form shell commands from prose. Fourth is &lt;em&gt;context compaction&lt;/em&gt;: truncating giant tool outputs, deduplicating repeated file reads, and summarizing old turns to prevent context bloat. Fifth is &lt;em&gt;structured session memory&lt;/em&gt;: maintaining both a full on-disk transcript and a compact working memory so long sessions stay sharp and resumable. Sixth is &lt;em&gt;bounded subagents&lt;/em&gt;: letting the primary agent delegate subtasks to scoped worker agents with isolated context windows, enabling parallel execution without losing control.&lt;/p&gt;
&lt;h2 id="say-the-thing-you-want"&gt;&lt;a href="https://terriblesoftware.org/2026/04/01/say-the-thing-you-want/" rel="noopener noreferrer"&gt;Say the Thing You Want&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The author of &lt;em&gt;Terrible Software&lt;/em&gt; offers a simple piece of career advice that engineers routinely ignore: tell your manager explicitly what you want. At the end of a 1:1, when asked &amp;ldquo;anything else?&amp;rdquo;, countless engineers say &amp;ldquo;nope, all good&amp;rdquo; even when they badly want to lead the next project, get promoted, or switch teams—afraid of sounding entitled, being told they aren&amp;rsquo;t ready, or admitting out loud that they want something they might not get. Yet as the post puts it, a goal you keep in your head has &amp;ldquo;zero surface area&amp;rdquo;—nobody can react to it, build on it, or help you reach it.&lt;/p&gt;
&lt;p&gt;Even the most caring manager cannot read your mind and is juggling a dozen other priorities. When a tech-lead opportunity opens up between two equally capable engineers, the one who previously said &amp;ldquo;I want to lead a project&amp;rdquo; gets the nod almost every time. Saying it out loud also unlocks actionable feedback: your manager can tell you the exact skill gaps between where you are and where you want to go—a roadmap self-assessment can never provide because we all have blind spots. Speaking the goal also makes it real and forces you to act on it. Starting doesn&amp;rsquo;t require a grand speech: just ask what the path to Senior looks like or what it would take to lead an upcoming initiative. And if merely stating a career goal gets held against you, that tells you something vital about your workplace too.&lt;/p&gt;
&lt;h2 id="agentic-coding-and-microservices"&gt;&lt;a href="https://www.natemeyvis.com/agentic-coding-and-microservices/" rel="noopener noreferrer"&gt;Agentic Coding and Microservices&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Nate Meyvis responds to Ben Borgers&amp;rsquo;s argument that AI coding agents will push the industry toward microservices because LLMs work better inside small, strictly encapsulated contexts. Meyvis agrees with the premise—strict encapsulation helps LLMs—but points out that encapsulation has &lt;em&gt;always&lt;/em&gt; helped humans, teams, and agents alike, and isn&amp;rsquo;t unique to AI. In fact, coding with AI has pushed his own projects &lt;em&gt;more&lt;/em&gt; toward monoliths: microservices still suffer from all the classic distributed-data headaches whenever features span service boundaries, and moving faster with AI means you hit those cross-service walls even sooner; meanwhile, deploying a monolith is faster and simpler, matching the tight iteration loop of AI-assisted development.&lt;/p&gt;
&lt;p&gt;His core point is that network boundaries between microservices are neither necessary nor sufficient for good encapsulation: microservices regularly degenerate into distributed monoliths with hidden coupling, while a single-repo monolith can enforce clean module boundaries with discipline. Left to their own devices, LLMs naturally prefer adding code to an existing service over standing up a new one, and a clear &lt;code&gt;AGENTS.md&lt;/code&gt; file paired with regular refactoring prompts is usually enough to keep subsystem boundaries clean inside a monolith without paying the operational tax of distributed systems. In an AI-first workflow, a well-structured, well-documented monolith is often the most pragmatic choice.&lt;/p&gt;
&lt;h2 id="garbage-collection-from-first-principles-to-modern-collectors-in-java-go-and-python"&gt;&lt;a href="https://shbhmrzd.github.io/systems/garbage-collection/memory-management/2026/04/01/garbage-collectors-deep-dive.html" rel="noopener noreferrer"&gt;Garbage Collection: From First Principles to Modern Collectors in Java, Go and Python&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;This comprehensive guide traces garbage collection from its theoretical roots—starting with John McCarthy&amp;rsquo;s 1960 Lisp paper introducing mark-and-sweep—up through modern collectors in Java, Go, and Python. Following Paul Wilson&amp;rsquo;s classic 1992 survey taxonomy, automatic memory management rests on three foundational families: &lt;em&gt;mark-and-sweep&lt;/em&gt; (simple, but fragments the heap), &lt;em&gt;semi-space copying&lt;/em&gt; (copies live objects into a fresh half-heap, enabling fast bump-pointer allocation at the cost of reserving half of memory), and &lt;em&gt;reference counting&lt;/em&gt; (frees memory deterministically as soon as the count hits zero, but struggles with cyclic references). The weak generational hypothesis—&amp;ldquo;most objects die young&amp;rdquo;—underpins modern collectors that focus collection effort on a small young generation to dramatically cut pause times.&lt;/p&gt;
&lt;p&gt;Comparing production runtimes: Go uses a non-moving, concurrent tri-color mark-and-sweep collector with a hybrid write barrier targeting sub-millisecond pauses without heap compaction. Java&amp;rsquo;s G1GC divides the heap into 1–32MB regions and uses Snapshot-At-The-Beginning (SATB) concurrent marking, while ZGC encodes metadata into unused pointer bits (&lt;em&gt;colored pointers&lt;/em&gt;) and uses load barriers to remap pointers lazily, achieving sub-millisecond pauses even on multi-hundred-gigabyte heaps. CPython relies primarily on GIL-protected reference counting backed by a three-generation (0, 1, 2) cycle detector. Looking at the trade-offs: tracing collectors dominate server runtimes because reference counting&amp;rsquo;s per-write overhead compounds quickly; compacting collectors unlock fast bump allocation at the cost of moving objects and rewriting pointers, while non-compacting collectors like Go&amp;rsquo;s avoid pointer updates and accept more complex free-list/span allocation instead.&lt;/p&gt;
&lt;h2 id="i-told-claude-code-to-build-me-an-executive-assistant"&gt;&lt;a href="https://x.com/obie/status/2013955736292704342" rel="noopener noreferrer"&gt;I told Claude Code to build me an executive assistant&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Obie Fernandez, CTO at ZAR, recounts turning Claude Code into a personal executive assistant with a single prompt: asking Claude to design a markdown-based system from scratch to help him operate as a world-class CTO. He didn&amp;rsquo;t create a single folder or template himself—he let Claude design and evolve the structure. Three weeks later, the system had processed 82 meeting transcripts (47 meetings that month alone), tracked 23 team members across 264 lines of rich interpersonal context, and accumulated 11,579 lines of structured organizational knowledge—all while he managed 10 engineers, shipped code, and handled executive duties.&lt;/p&gt;
&lt;p&gt;The secret is that he &amp;ldquo;never thinks about the system&amp;rdquo;: he just talks to Claude naturally, usually dictating via Wispr Flow, with at least one Claude Code terminal session open all day (and multiple parallel sessions when prepping for back-to-back meetings). Everyday prompts include &lt;code&gt;&amp;quot;morning sync&amp;quot;&lt;/code&gt; to synthesize his calendar and top priorities, &lt;code&gt;&amp;quot;prep for 1:1 with Daniel&amp;quot;&lt;/code&gt; to review past notes and surface talking points, and &lt;code&gt;&amp;quot;log decision about X&amp;quot;&lt;/code&gt; to record architectural or org decisions; after every meeting, he simply pastes the raw transcript and lets Claude extract notes and action items. Connecting Calendar, Slack, Twitter, and Linear through Rube/MCP is the linchpin that lets Claude take action directly without context-switching. Fernandez&amp;rsquo;s conclusion: every knowledge worker will eventually run a personal agent harness like this, and those who wait will fall behind.&lt;/p&gt;
&lt;h3 id="bonus"&gt;Bonus&lt;/h3&gt;&lt;p&gt;&lt;strong&gt;Images:&lt;/strong&gt;
&lt;img src="https://substackcdn.com/image/fetch/$s_!OXGA!,w_1100,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F6025205d-78d1-4aa9-b2ba-281d1b9fc57e_2484x3002.png" alt="Monolithic vs Microservices vs Serverless"&gt;
&lt;img src="https://substackcdn.com/image/fetch/$s_!70vn!,w_1100,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F71e475fe-34fa-44f8-a564-02f946456588_2508x3042.png" alt="CLI vs MCP"&gt;
&lt;img src="https://substackcdn.com/image/fetch/$s_!INti!,w_1100,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F29e4bde9-65ea-4d95-bc99-1802e4f74448_2484x3002.png" alt="Comparing 5 Major Coding Agents"&gt;
&lt;img src="https://substackcdn.com/image/fetch/$s_!ujMG!,w_1100,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F1fd50345-af15-4236-ab47-73225d1aa660_800x803.jpeg" alt="JWT Visualized"&gt;&lt;/p&gt;
&lt;hr&gt;
&lt;p&gt;&lt;em&gt;This post was rewritten by Claude Code with Opus 5.5 on 27/09/2026; reviewed and edited by Codex with GPT 6.1 Sol on 09/11/2026, and re-verified by Claude Code with Sonnet 5.5 on 16/11/2026.&lt;/em&gt;&lt;/p&gt;</description></item><item><title>Newsletter #20</title><link>https://miti99.com/en/post/2025/05/07/</link><pubDate>Wed, 07 May 2025 00:00:00 +0700</pubDate><guid>https://miti99.com/en/post/2025/05/07/</guid><description>&lt;p&gt;&lt;em&gt;Enjoy Newsletter #20.&lt;/em&gt;&lt;/p&gt;
&lt;h2 id="performance-improvements-in-jdk-24"&gt;&lt;a href="https://inside.java/2025/03/19/performance-improvements-in-jdk24/" rel="noopener noreferrer"&gt;Performance Improvements in JDK 24&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;This Inside.java article rounds up the most notable performance improvements in JDK 24 over JDK 23, organized by JDK bug tracker issue. In the core libraries, bulk operations in the Foreign Function &amp;amp; Memory API such as &lt;code&gt;MemorySegment::fill&lt;/code&gt;, &lt;code&gt;copy&lt;/code&gt;, and &lt;code&gt;mismatch&lt;/code&gt; are now handled in pure Java when memory segments are small enough, avoiding the overhead of transitioning to native code via &lt;code&gt;Unsafe&lt;/code&gt;. String concatenation now uses cacheable, reusable hidden classes instead of constructing chains of intermediate &lt;code&gt;MethodHandle&lt;/code&gt; combinators; SHA3 digests are up to 27% faster by reducing conversions between &lt;code&gt;byte&lt;/code&gt; and &lt;code&gt;long&lt;/code&gt; arrays; and internal migrations to the new Class-File API have been tuned to minimize startup overhead.&lt;/p&gt;
&lt;p&gt;At the runtime layer, JEP 491 allows virtual threads blocked inside a &lt;code&gt;synchronized&lt;/code&gt; block to unmount from their carrier thread rather than pinning it, significantly improving scalability for code that uses &lt;code&gt;synchronized&lt;/code&gt;. &lt;code&gt;String::indexOf&lt;/code&gt; is roughly 1.3x faster on x64 platforms with AVX2. JEP 483 (Ahead-of-Time Class Loading &amp;amp; Linking), the first deliverable from Project Leyden, uses an AOT cache to cut startup time by around 42% in the article&amp;rsquo;s benchmark. JEP 450 introduces experimental 8-byte compact object headers, reducing memory footprint by 10–20% on typical workloads. Finally, the RISC-V port gained several new intrinsics including CRC32, Adler32, string comparison optimizations, and byte-reversal operations.&lt;/p&gt;
&lt;h2 id="clean-your-memory-from-finalize-to-cleaner"&gt;&lt;a href="https://blog.frankel.ch/java-cleaner/" rel="noopener noreferrer"&gt;Clean your Memory: From Finalize to Cleaner&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Stefano Fago explains that Java&amp;rsquo;s garbage collector (GC) only manages heap memory and does not automatically release external resources like sockets or file handles; mismanaging them can lead to resource leaks, gradual slowdowns, or crashes. The old approach was overriding &lt;code&gt;finalize()&lt;/code&gt;, which has been deprecated because its execution timing is unpredictable, objects require at least one extra GC cycle to be reclaimed, accidental object resurrection can cause leaks, and the dedicated Finalizer thread is prone to contention. Its replacement is the &lt;code&gt;Cleaner&lt;/code&gt; API, introduced in Java 9: under the hood, it uses &lt;code&gt;PhantomReference&lt;/code&gt; and a background daemon thread while hiding the complexity of raw reference queues. You register an object alongside a cleanup action, and once the object becomes phantom-reachable, that action is enqueued to run on the background thread.&lt;/p&gt;
&lt;p&gt;&lt;code&gt;Cleaner&lt;/code&gt; pairs well with &lt;code&gt;AutoCloseable&lt;/code&gt;: the &lt;code&gt;close()&lt;/code&gt; method invokes &lt;code&gt;clean()&lt;/code&gt; for immediate deterministic cleanup, while the &lt;code&gt;Cleaner&lt;/code&gt; acts as a safety net. Even so, Fago stresses that &lt;code&gt;Cleaner&lt;/code&gt; should only be a fallback when resources cannot be released via &lt;code&gt;try-with-resources&lt;/code&gt; or an explicit &lt;code&gt;close()&lt;/code&gt; call, since cleanup is asynchronous and carries background-thread overhead. When writing a cleanup action, avoid lambdas that capture fields through &lt;code&gt;this&lt;/code&gt;, as doing so accidentally keeps a strong reference to the very object you want collected; cleanup logic should also be short and non-blocking, since multiple actions may share the same &lt;code&gt;Cleaner&lt;/code&gt; thread pool.&lt;/p&gt;
&lt;h2 id="5-hidden-git-tips-for-java-developers"&gt;&lt;a href="https://www.azul.com/blog/5-hidden-git-tips-for-java-developers/" rel="noopener noreferrer"&gt;5 Hidden Git Tips for Java Developers&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;On the Azul blog, Luqman Saeed walks through five underappreciated Git features beyond the everyday &lt;code&gt;commit&lt;/code&gt;, &lt;code&gt;push&lt;/code&gt;, and &lt;code&gt;pull&lt;/code&gt; trio, with examples tailored to Java projects. First is &lt;code&gt;git bisect&lt;/code&gt;: when you don&amp;rsquo;t know which commit introduced a bug, you mark the current commit as bad (&lt;code&gt;git bisect bad&lt;/code&gt;) and an older working commit as good (&lt;code&gt;git bisect good &amp;lt;commit-hash&amp;gt;&lt;/code&gt;), and Git performs a binary search by checking out midpoint commits for you to test until the culprit is found, finishing with &lt;code&gt;git bisect reset&lt;/code&gt;. Next, &lt;code&gt;git blame &amp;lt;file&amp;gt;&lt;/code&gt; shows who last modified each line and when (pass &lt;code&gt;-L 50,60&lt;/code&gt; to inspect a specific line range), giving you helpful context before debugging or refactoring. When you need to switch tasks mid-flight, &lt;code&gt;git stash&lt;/code&gt; shelves uncommitted changes and &lt;code&gt;git stash pop&lt;/code&gt; restores them; &lt;code&gt;git stash list&lt;/code&gt; and &lt;code&gt;git stash apply &amp;lt;stash-id&amp;gt;&lt;/code&gt; let you manage multiple stashes.&lt;/p&gt;
&lt;p&gt;For temporary build artifacts generated by Maven or Gradle like &lt;code&gt;.class&lt;/code&gt; files or the &lt;code&gt;target/&lt;/code&gt; directory, &lt;code&gt;git clean -n&lt;/code&gt; previews what would be deleted, &lt;code&gt;-f&lt;/code&gt; removes untracked files, &lt;code&gt;-fd&lt;/code&gt; removes untracked directories as well, and &lt;code&gt;-x&lt;/code&gt; also deletes ignored files such as &lt;code&gt;.idea/&lt;/code&gt;. Finally, Git hooks are scripts that run automatically before or after events like commits, pushes, or merges—for example, a &lt;code&gt;pre-commit&lt;/code&gt; hook in &lt;code&gt;.git/hooks&lt;/code&gt; can run &lt;code&gt;mvn test&lt;/code&gt; and abort the commit if tests fail. As a bonus tip, &lt;code&gt;git checkout -&lt;/code&gt; jumps straight back to the previous branch you were working on without retyping its name, saving time and avoiding typos.&lt;/p&gt;
&lt;h2 id="simplify-your-system-by-challenging-the-status-quo-and-learning-from-other-ecosystems"&gt;&lt;a href="https://www.infoq.com/podcasts/simplify-system-learning-ecosystems/" rel="noopener noreferrer"&gt;Simplify Your System by Challenging the Status-Quo and Learning from Other Ecosystems&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In this InfoQ podcast, Max Rydahl Andersen—Distinguished Engineer at Red Hat and creator of JBang—recounts how taking a year away from Java helped him see upon returning that the ecosystem had accumulated too much accidental complexity, like &amp;ldquo;a thousand paper cuts&amp;rdquo;: each small feature is useful on its own, but together they become a burden. Quarkus, which he works on, flips traditional Java conventions by shifting most framework processing from runtime to build time, enabling near-instant startup. That speed unlocks a much better developer experience: live reload, continuous testing, Dev Services that automatically spin up containers like PostgreSQL or Kafka, and an interactive chat UI for testing AI services via LangChain4j right inside the Dev UI.&lt;/p&gt;
&lt;p&gt;With JBang, he drew inspiration from Python and Node.js to let developers run Java from a single source file—even downloading a JDK automatically if none is installed; he jokes that if you find any development environment easier to set up, that&amp;rsquo;s a bug in JBang. Andersen also argues that AI cannot replace core software engineering fundamentals and systems thinking, and warns that AI will accelerate CVE exploitation, meaning legacy systems will need much more frequent patching. The overarching takeaway: challenge the status quo and borrow good ideas from other ecosystems to keep systems simple.&lt;/p&gt;
&lt;h2 id="about"&gt;&lt;a href="https://tryingthings.wordpress.com/2025/03/24/about-vibe-coding/" rel="noopener noreferrer"&gt;About &amp;ldquo;vibe coding&amp;rdquo;&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Sorin Costea writes a brief reflection on &amp;ldquo;vibe coding&amp;rdquo;—the trend of letting AI write code in place of the developer. After reading &amp;ldquo;Vibe Coding vs Reality,&amp;rdquo; he was relieved to see he wasn&amp;rsquo;t the only skeptic, recounting his own attempt to use Cursor on a Java Maven project where the tool couldn&amp;rsquo;t even rename a class properly: first it renamed the class declaration without renaming the file, and when asked to fix it, it created an empty file with the new name—twice in a row.&lt;/p&gt;
&lt;p&gt;When he shared the experience on Hacker News, the replies were mostly along the lines of &amp;ldquo;haha Java,&amp;rdquo; leaving him wondering whether Cursor was only trained on trendy frontend frameworks or whether its vocal fans simply don&amp;rsquo;t care about real-world enterprise codebases. He ended up uninstalling Cursor and feeling even more skeptical of &amp;ldquo;magical&amp;rdquo; AI coding tools, though he leaves the door open: &amp;ldquo;Next year though? Next year we&amp;rsquo;ll see.&amp;rdquo;&lt;/p&gt;
&lt;h2 id="visual-focused-algorithms-cheat-sheet"&gt;&lt;a href="https://photonlines.substack.com/p/visual-focused-algorithms-cheat-sheet" rel="noopener noreferrer"&gt;Visual-Focused Algorithms Cheat Sheet&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Nick M compiles a visual-first cheat sheet of essential algorithms used in practice, following up on his earlier data structures cheat sheet; each algorithm is explained through everyday analogies and diagrams. The sorting section progresses from Selection Sort and Insertion Sort—simple but O(n²)—to Heap Sort and Merge Sort at O(n log n), Quick Sort with an O(n log n) average case and O(n²) worst case, and Tim Sort, the hybrid of Insertion Sort and Merge Sort used in Python and Java. Searching covers Binary Search at O(log n) alongside DFS and BFS for depth-first and breadth-first graph traversal. The graph section walks through Prim&amp;rsquo;s and Kruskal&amp;rsquo;s algorithms for minimum spanning trees, Dijkstra&amp;rsquo;s and Bellman-Ford for shortest paths (with Bellman-Ford handling negative edge weights), A* using heuristics, plus Union-Find and Ford-Fulkerson.&lt;/p&gt;
&lt;p&gt;Later sections cover string search, data compression and encoding (Huffman coding, LZ compression, Fourier transforms, JPEG compression), optimization (Simplex, Simulated Annealing), machine learning and data science, and security and cryptography algorithms. The post wraps up with coding interview resources like &amp;ldquo;14 Patterns to Ace Any Coding Interview&amp;rdquo; and &amp;ldquo;5 Simple Steps for Solving Dynamic Programming Problems,&amp;rdquo; making it a handy reference for junior developers preparing for interviews.&lt;/p&gt;
&lt;h2 id="bonus-interesting-images-from-bytebytego"&gt;Bonus: Interesting images from &lt;a href="https://bytebytego.com/" rel="noopener noreferrer"&gt;ByteByteGo&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;img src="https://substack-post-media.s3.amazonaws.com/public/images/81074d22-5821-4aec-bb2d-0a099d06b6ac_1600x840.png" alt="3 Steps to Master Your Software"&gt;
&lt;img src="https://substack-post-media.s3.amazonaws.com/public/images/67c39b9a-9a91-4e57-9e24-7714b4f806dd_1280x1349.gif" alt="The Ultimate Software Architect Roadmap"&gt;
&lt;img src="https://substack-post-media.s3.amazonaws.com/public/images/fb1b1cd1-eac3-4b66-a391-9ec73f6c37f3_1280x1502.gif" alt="How Two-factor Authentication (2FA) Works?"&gt;
&lt;img src="https://substack-post-media.s3.amazonaws.com/public/images/3efae3ad-8c45-4fb2-a79f-6b3387b0751e_1280x1601.gif" alt="How Amazon S3 Works?"&gt;&lt;/p&gt;
&lt;hr&gt;
&lt;p&gt;&lt;em&gt;This post was rewritten by Claude Code with Opus 5.5 on 27/09/2026; reviewed and edited by Codex with GPT 6.1 Sol on 09/11/2026, and re-verified by Claude Code with Sonnet 5.5 on 16/11/2026.&lt;/em&gt;&lt;/p&gt;</description></item></channel></rss>