I am indexing a table with 2,000,000 vectors (1,536 dimensions, OpenAI text-embedding-3-small) in PostgreSQL 16 using the pgvector extension. When executing: CREATE INDEX ON documents USING hnsw (embedding vector_cosine_ops) WITH (m = 16, ...Read more
I wrote the following modern C++20 pipeline to filter records returned by a database query helper function: #include <iostream> #include <vector> #include <ranges>std::vector<int> getTemperatures() { return {18, 25, 32, 14, 29, 36}; }int ...Read more
During deep learning training in PyTorch 2.x, my script crashed midway through an epoch with the error: RuntimeError: CUDA out of memory. Tried to allocate 512.00 MiB (GPU 0; 23.69 GiB total capacity; ...Read more
We are building a distributed task build engine (similar to Bazel or Make) that resolves dependency trees across 500,000 code packages. Textbooks teach both Kahn’s algorithm (indegree BFS) and DFS post-order reversal. Why do production build systems almost universally prefer Kahn’s ...Read more
When elements in an array appear twice except one, we can simply XOR all numbers together. But what if every element appears three times, except for a single number that appears once? The standard hash-map solution uses O(N) space. How can ...Read more
Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals k. Many people try to use a Sliding Window / Two Pointers approach, but it fails whenever the array contains negative numbers. ...Read more
In standard coding questions, Lowest Common Ancestor (LCA) in a binary tree is solved with post-order recursive DFS in O(N) time. But in production systems (like corporate organization charts or Git commit graph merges), we need to answer thousands of ...Read more