📰 Medium · JavaScript

If you’re starting Data Structures and Algorithms, you’ll eventually come across words like: Continue reading on Medium »

If you are learning Data Structures and Algorithms (DSA), you will often hear the term Brute Force. But what does a brute force algorithm… Continue reading on M

The Internal Data Structures Behind TanStack Query’s Cache Continue reading on Level Up Coding »

If you’ve spent any time grinding through coding interview problems, you’ve probably run into a strange little trick: two pointers moving… Continue reading on M

The low-level transformations, non-mutating pipelines, single-pass aggregations, and performance-tuned patterns that eliminate nested… Continue reading on Skill

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 choosing the right root turns Optimal Binary Search Tree into another Interval DP problem Continue reading on Medium »

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 »