algorithms

Pagination is a key component on web-applications that let users navigate through pages making easy to read/find records. Also, pagination is a great strategy to improve performance by avoiding to load entire dataset at once. However, while working with Kaminari, a popular pagination gem in Rails, I encountered an unexpected issue that revealed an interesting edge case. Identify the issue Basical…

graphlens: turn any repo into one typed graph — across Python, TypeScript, Go and Rust Every code-intelligence tool I've ever used falls into one of two traps. The first is the grep-and-read loop : you (or your AI agent) search for a name, open ten files, read around the matches, follow an import, search again. It works, but it's slow, it burns tokens, and it has no idea that the process_order yo…

Problem Statement Given: Positions of stalls k cows Place the cows in stalls such that: Minimum distance between any two cows is maximized. Return the maximum possible minimum distance. Brute Force Intuition In an interview, you can explain it like this: We can try every possible distance from 1 up to the maximum distance between stalls. For each distance, check whether all cows can be placed whi…

geeksforgeeks.org Problem Statement Given: books[i] = pages in ith book m students Allocate books such that: Every student gets at least one book. Books are allocated contiguously. Every book is assigned. Minimize: Maximum pages assigned to any student Return the minimum possible value. Brute Force Intuition In an interview, you can explain it like this: Try every possible maximum page limit and …

Problem Statement Given two sorted arrays arr1[] and arr2[] and an integer k , return the kth smallest element from the combined sorted array. Brute Force Intuition In an interview, you can explain it like this: Since both arrays are sorted, we can merge them similar to Merge Sort. While merging, keep counting elements. The moment we reach the kth element, return it. Complexity Time Complexity: O…

Problem Statement Given two sorted arrays nums1 and nums2 , return the median of the two sorted arrays. The overall run time complexity should be: O(log(min(N,M))) Brute Force Intuition In an interview, you can explain it like this: Since both arrays are sorted, we can merge them into a single sorted array and then directly compute the median from the merged array. Complexity Time Complexity: O(N…

The Quest Begins (The "Why") I still remember the first time I stared at a competitive‑programming statement and felt my brain short‑circuit. The problem talked about “arrays of length n where each element is at most 10⁹ and you need to count pairs whose sum is divisible by k”. I started scribbling brute‑force loops, then switched to sorting, then tried hash maps… and after twenty minutes I was s…

Modern backend systems spend enormous effort optimizing databases, tuning queries, and scaling infrastructure. Yet some of the most expensive production incidents begin with a single innocent event: A cache entry expires. Everything looks healthy. CPU is low. Memory is stable. Latency is acceptable. Then suddenly: PostgreSQL reaches 100% CPU Redis traffic spikes Request latency explodes Pods star…

You add a sixth Lambda trigger to your OrderEvents table, deploy it, and within 20 minutes your SLA dashboard goes red. Latency on order writes jumps from 4ms to 40ms. The function itself is fine. The table is fine. The problem is that five other Lambdas are already hitting the same partition key on every write, and you just made it six. DynamoDB's internal partition throttling doesn't care that …

leetcode.com Problem Statement Given a sorted array where: Every element appears exactly twice. Only one element appears once. Find the single element in O(log N) time and O(1) space. Brute Force Intuition In an interview, you can explain it like this: Since every element appears twice except one, we can iterate through the array and count frequencies. The element with frequency 1 is our answer. …

leetcode.com Problem Statement Given a rotated sorted array nums and an integer target , return the index of target . If the target does not exist, return -1 . You must solve it in: O(log N) time. Brute Force Intuition In an interview, you can explain it like this: We can scan the array from left to right and compare every element with the target. As soon as we find the target, we return its inde…

geeksforgeeks.org Problem Statement Given a row-wise sorted matrix of size N × M , find the median of the matrix. The matrix contains an odd number of elements. Brute Force Intuition In an interview, you can explain it like this: Since every row is sorted, one straightforward approach is to collect all elements into a single array, sort them, and return the middle element. This works but ignores …

N-th root of a number - GeeksforGeeks Your All-in-One Learning Portal: GeeksforGeeks is a comprehensive educational platform that empowers learners across domains-spanning computer science and programming, school education, upskilling, commerce, software tools, competitive exams, and more. geeksforgeeks.org Problem Statement Given two integers: n → root value m → number Find the integer x such th…

Introduction This is my ninth article as a Java engineer learning TypeScript and Python from scratch. Last time I moved into the Python series, and the first project was a weight tracker CLI . Centered on type hints, pure functions, and pytest, it confirmed that "separate logic from I/O" still works in Python. For the second Python project, this time it's a password generator CLI . You specify th…

Enterprise Document Intelligence [Vol.1 #5quinquies] - Same 1974 scanned PDF, two engines. EasyOCR recovers text. Docling recovers text + sections + figures. The structural gap makes one output usable downstream and the other one a flat string. The post Parse Scanned PDFs for RAG with EasyOCR: Free OCR Gives You Words, Not a Document appeared first on Towards Data Science .

Researchers developed a Wordle-solving strategy that succeeds 99% of the time by focusing on information gain rather than likely answers. The method uses Shannon entropy to identify guesses that reveal the most about the hidden word. Each guess is designed to slash uncertainty and narrow the possibilities faster. The result significantly outperformed more traditional Wordle tactics.

The PCIe transfer latency is silently bottlenecking your agentic inference. Here is how building a custom device-resident vector search kernel bypasses the CPU to unlock deterministic microsecond tail latencies. The post GPU-Resident Top-K for Agentic RAG: I Built a CUDA Kernel So My Retrieval Step Would Stop Bouncing Off the GPU appeared first on Towards Data Science .

Grinding 500 LeetCode problems is the slow way to prep. The fast way is pattern recognition — because most interview questions are a remix of ~15 underlying patterns. Once you can name the pattern in the first 30 seconds, you stop solving from scratch and start adapting a template you already know. Here are the 15 that, in my experience, cover the vast majority of what actually shows up. For each…

You run git diff dozens of times a day. You read the red and green lines, you stage the hunks, you move on. But there's a small algorithmic miracle happening every time: out of the astronomically many ways to describe "how file A became file B," the tool quietly finds one of the shortest ones. That's not a formatting trick. It's a shortest-path search. Once you see it, code review, merge conflict…

AlgoVisual Hub – Interactive Algorithm & Data Structure VisualizerAlgoVisual Hub – Interactive Algorithm & Data Structure Visualizer Free interactive algorithm visualizations for computer science students. Learn CPU scheduling, sorting, memory management and more through step-by-step animations. cpuos-ae329.web.app