Building the Two-Heap Median Stream Algorithm from Scratch
A step-by-step guide to solving the Find Median from Data Stream problem, building intuition from brute force to the optimal dual-heap approach.
Journal
The LoopPass Blog
Technical guides and strategies to help you navigate the modern interview landscape.
The Living Giant Python Syntax and Traps LeetCode Document
Yes, this is long. It is the continuously updated, ultimate compilation of every Python idiom, trick, and trap for efficient interview coding.
Choosing the Right Shortest Path Algorithm
A guide to selecting BFS, Dijkstra, Bellman-Ford, or Floyd-Warshall based on graph constraints.
Designing from Invariants
Why the simplest solution to a complex system starts with local coherence and business logic rather than infrastructure choice.
Memory Types in LangChain
A breakdown of how Large Language Models maintain context through various architectural memory patterns with code examples.
The Battle Between RAG and Long Context
A technical comparison of Retrieval Augmented Generation and Long Context strategies for managing private data in Large Language Models.
Comparing LangChain, CrewAI, and ADK
An engineering first perspective on choosing between LangChain, CrewAI, and Google's Agent Builder Kit (ADK) without the framework hype.
Choosing between Layer 4 and Layer 7 Load Balancing for WebSockets
Why persistent connections like WebSockets change the rules for load balancing and how to pick the right strategy for your scale.
How to Actually use Python's heapq for Kth Largest Problems
Learn how to efficiently find the Kth largest element using Python's heapq module with the Min heap of size K strategy.