EEUNMIN PARK8h ago · 4 min readFinding Was 98% of the Work. A Library Had the Answer.The same day my last essay went live, a post about a new paper scrolled past. In that essay I had cited Torsten Hoefler for one line about where quantum speedups are realistic. Now his name was on a peunminpark.hashnode.dev
LLinkjob AI14h ago · 2 min readLongest Harmonious Subsequence (LeetCode 594): Count Once, Check NeighboursA harmonious array is one where the maximum and minimum differ by exactly 1. Given an array, return the length of its longest harmonious subsequence. The word "subsequence" is the whole trick: order dlinkjob-ai.hashnode.dev
LLinkjob AI18h ago · 2 min readPalindrome Linked List (LeetCode 234): O(1) Space Without Losing the ListGiven the head of a singly linked list, return true if it reads the same forward and backward. Easy version: copy to an array Push every value into a list and compare it with its reverse. That's O(n) linkjob-ai.hashnode.dev
Mmariabuzdar01d ago · 2 min readI Built a Solver That Reads Block Blast Screenshots and Plans the Best MovesLike a lot of people, I got hooked on Block Blast — and kept dying on boards that looked totally winnable. So I built a solver for it. The idea is simple: upload a screenshot of your game, and the solblock-blast-solver.hashnode.dev
VVed Patel1d ago · 5 min readBuilding a Search Engine From Scratch: Introducing My ProjectI've always been curious about what happens behind the scenes when we search for something online. We type a few words into a search bar, press Enter, and within milliseconds, we're presented with a lvedtech.hashnode.dev
TThới Hải Đức1d ago · 2 min readTwo ways to solve a maze. The faster one gives the worse answer.Same maze, two algorithms. One looked at 40 cells. The other looked at 117. You'd think the one that did less work is better. It isn't. It found a path that's 10 moves longer. BFS spreads out BFS software-atlas.hashnode.dev
ZZyVOP2d ago · 18 min readBig-O Without the Fear: Why Some Code Scales and Some Doesn'tFor the last four posts, I've been using phrases like "fast," "slow," "grows with the size," and "thousands of times faster." Big-O is the proper name for that whole idea. It has a reputation for beinblog.zyvop.com
MMaxwell2d ago · 11 min readWill This Watermark Be Readable? A Per-Photo Contrast Check for Batch Image Processing in SwiftWhen you put a watermark on one photo, you look at it. When you put the same watermark on a hundred photos, you don't. Somewhere in that batch there's a photo where your white text lands on a bright smaxwelldispatch.hashnode.dev
ZZyVOP3d ago · 18 min readAlgorithms You'll Actually Use: Sorting, Searching, Recursion, and Beam SearchAn algorithm is just a step-by-step recipe for solving a problem. "To find a name in a phone book, open it in the middle, decide which half the name is in, and repeat" is an algorithm. You use them alblog.zyvop.com
ZZyVOP4d ago · 21 min readData Structures for AI Engineers: Arrays, Hash Maps, Trees, Graphs, and HeapsWelcome to Track B, the computer science fundamentals. In Post 15 we saw that picking the right data structure can make code thousands of times faster, and nothing else we tried came close. This post blog.zyvop.com
