DUDeactivated Userinpureilm.hashnode.devComputational Thinking & Problem Solving: The Foundation Every Developer Needs (Complete Course Framework)Most developers spend years mastering frameworks, libraries, and syntax. But when faced with a novel problem—something they haven't solved before—they hit a wall. The reason? We've been teaching progr16h ago·10 min read
MSMuppidi Srinivasinsrinivastechblog.hashnode.devMastering Fenwick Tree for Competitive ProgrammingWhile reading, don’t overthink or get stuck. Just follow along with the flow—you’ll understand everything step by step as we go. Given ArrayIndex : 0 1 2 3 4 5 6Array : 3 2 1d ago·11 min read
AWAlex Wanginleetcopilot.hashnode.devCalculating Space Complexity of Recursive Algorithms: The Hidden CostOriginally published on LeetCopilot Blog You didn't create any arrays, so why is your space complexity O(N)? Learn how to calculate the hidden 'stack space' in recursion and avoid Memory Limit Exceeded errors. You write a recursive DFS solution. Y...1d ago·5 min read
Hhimanshuinblogs-himanshu.hashnode.devDay 19 - Find Minimum in Rotated Sorted ArrayQuestion You are given an array of length n which was originally sorted in ascending order. It has now been rotated between 1 and n times. For example, the array nums = [1,2,3,4,5,6] might become: [31d ago·3 min read
SASaeed Anwar Ansariinsaeed.hashnode.devWhy Your Kubernetes Pods Aren't Scaling Down to 1: Cracking the HPA AlgorithmEvery DevOps engineer knows the thrill of watching Kubernetes scale up effortlessly to meet demand. We set our Horizontal Pod Autoscalers (HPAs) to a target CPU utilization—say, 75%—and marvel as our 2d ago·4 min read
Hhimanshuinblogs-himanshu.hashnode.devDay 18 - Koko Eating BananasQuestion You are given an integer array piles where piles[i] is the number of bananas in the ith pile. You are also given an integer h, which represents the number of hours you have to eat all the ban2d ago·3 min read
MSMuppidi Srinivasinsrinivastechblog.hashnode.devMo’s Algorithm – Step by Step GuideMo’s Algorithm is a technique used to answer range queries efficiently on arrays You are given : An array A Many queries: [L, R] Each query asks something like : sum of elements number of dis3d ago·10 min read
MSMuppidi Srinivasinsrinivastechblog.hashnode.devEfficient Range Queries Using Sqrt DecompositionSquare Root Decomposition is a technique used to answer range queries efficiently. When do we use it? When you have : An array A[0…N-1] Many queries like : Sum of range [L, R] Min/Max in range C4d ago·6 min read
Hhimanshuinblogs-himanshu.hashnode.devDay 17 - Search a 2d MatrixQuestion You are given an m x n 2-D integer array matrix and an integer target. Each row in matrix is sorted in non-decreasing order. The first integer of every row is greater than the last integer 3d ago·3 min read
Ccircobitingauchogrid.hashnode.devWhy Most Table Scrapers Fail on Wikipedia (And How to Fix It)Wikipedia is one of the most data-rich websites on the planet. Millions of tables containing everything from country populations to sports statistics to historical timelines. Yet when you try to scrape these tables programmatically, things go wrong f...4d ago·7 min read
