📰 Medium · JavaScript

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 »

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

Arrays are the first data structure most of us learn, yet they’re where some of the most elegant optimization techniques in computer… Continue reading on Medium

As JavaScript developers, we often focus on writing code that works. But in interviews and production systems, writing code that scales is… Continue reading on

Difficulty: Hard Topic: Computational Geometry, Rectangle Intersection, Constraint Propagation  View original problem statement Continue reading on Javascript

Discovering the hidden beauty of algorithms doesn’t require a math degree. Today, we are breaking down one of LeetCode’s most popular… Continue reading on Mediu

Difficulty: Hard Topic: Polynomials, parenthesization, root-finding  View original problem statement Continue reading on Javascript by doing »

I’m going to be honest with you: my first three runs at learning data structures and algorithms were embarrassing. Continue reading on Medium »

Difficulty: Medium Topic: Greedy Algorithms & Interval Covering Round: Qualification Link… Continue reading on Javascript by doing »

Huffman coding is a lossless compression technique that assigns shorter binary codes to frequently used characters and longer codes to… Continue reading on Medi

Years ago I opened an internal talk on frontend algorithms with one line: Continue reading on Medium »

What if finding the maximum in every window could be done in O(n) instead of O(n × k)? Continue reading on Medium »

Single linked list a famous problem is: reverse linked list. before moving to explanation of problem let’s understand the single link list… Continue reading on

Today i went through the Leetcode Famous linked list problem was : 23. Merge k Sorted Lists. So when i started to solve this i was blank… Continue reading on Me

This problem looks completely different… but secretly uses the SAME “at most” trick. Continue reading on Medium »

What if I told you the hardest sliding window problems are solved… indirectly? Continue reading on Medium »

A permutation is an array containing each number from 1 to n exactly once, just arranged in a different order. Continue reading on Medium »

Meta Hacker Cup 2020 · Final Round · Problem E Continue reading on Javascript by doing »

From “longest valid window” → to “smallest valid window” (complete mindset shift) Continue reading on Medium »

Set tells you if something exists. Map tells you how many times it exists. Continue reading on Medium »