📰 Medium · JavaScript

You are given maximum initial energy k (k<1000) and an array A of length n denoting wind speed on n days. He is stuck on a boat, and each… Continue reading on M

How adding one condition to interval splitting transforms a familiar DP pattern into Palindrome Partitioning Continue reading on Medium »

How choosing the right multiplication order transforms Matrix Chain Multiplication into a classic Interval DP problem Continue reading on Medium »

How breaking one number into smaller parts turns into a maximum-product Dynamic Programming problem Continue reading on Medium »

How replacing max() with min() transforms the Unbounded Knapsack Dynamic Programming pattern Continue reading on Medium »

If you’re preparing for coding interviews, you’ve probably solved dozens of array problems already. Continue reading on Medium »

How cutting a rod into pieces secretly becomes the Unbounded Knapsack Dynamic Programming pattern Continue reading on Medium »

How allowing repeated choices transforms the classic 0–1 Knapsack Dynamic Programming pattern Continue reading on Medium »

Difficulty: Medium Topic: Binary Search + Greedy Algorithm Problem Link: Meta Hacker Cup 2016 Round 1 — Problem B Continue reading on Javascript by doing »

While practicing sorting algorithms, I ran into a deceptively simple question that taught me more than I expected: Continue reading on Medium »

Have You Ever Wondered Why Promise.then() Runs Before setTimeout()? Continue reading on Medium »

Stacks and queues are two of the simplest data structures that you’ll often run into them when solving DSA problems. A stack works like a… Continue reading on C

Most stack problems look like they’re about pushing values. Continue reading on Medium »

Yesterday, I was solving a coding problem. Continue reading on Dev Simplified »

Difficulty: Medium Topic: String Manipulation, Greedy Matching Problem Link… Continue reading on Javascript by doing »

Finding the prime numbers between the 2 to n as given input(n) value. We know the usual solution for finding an number is prime or not in… Continue reading on M

Difficulty: Medium Topic: Tree Data Structures & Subtree Queries  View original problem statement Continue reading on Javascript by doing »

Learn the intuition behind Prefix Sum, recognize it in interviews, and solve most subarray sum problems with confidence. Continue reading on Medium »

If you’ve solved a few LeetCode problems, chances are you’ve already used the Two Pointers pattern — even if you didn’t know its name. Continue reading on Mediu

I recently solved Find Smallest Letter Greater Than Target, and this problem reminded me that sometimes one line in the problem statement… Continue reading on M

The approach that cuts your time complexity in half — and most developers have never heard of it. Continue reading on Medium »

The approach that cuts your time complexity in half — and most developers have never heard of it. Continue reading on Stackademic »

A beginner’s guide to the Call Stack, Callback Queue, and Microtask Queue — with zero hand-waving. Continue reading on Medium »

Why DSA feels impossible, why most beginners practice it wrongly, and how to build interview-ready problem-solving skills without blindly… Continue reading on D