Sliding Window
Problem You are given an array of size N and an integer K. Your task:Find the maximum sum of any subarray of size exactly K Understanding the Problem Let’s take an example: arr = [2, 1, 5, 1, 3, 2] k
Apr 28, 20263 min read8
Command Palette
Search for a command to run...
#dsa
Articles tagged with #dsa
Aggressive Cows Problem using Binary Search
Problem Core Idea You are not directly placing cows. Instead, you are guessing the answer (minimum distance) and checking: “Is it possible to place all cows with at least this distance?” Goal Find
Apr 28, 20264 min read14
Binary Seach
Imagine you’re searching for a word in a dictionary.You don’t start from page 1, right?You open somewhere in the middle. If your word comes before → go left If it comes after → go right This is ex
Apr 13, 20263 min read19
Cyclic Sort
Problem Idea You are given an array of size n containing numbers from 1 to n. Your task:Place every number at its correct index Core Idea (Think Like This) “If the current number is not at its correc
Apr 9, 20264 min read10
Sort 0, 1, 2 (Dutch National Flag Algorithm)
When I first solved the 0s and 1s segregation problem, it felt simple. If you haven’t seen it, you can check it here:🔗 https://shubhamsinghbundela.hashnode.dev/segregate-0s-and-1s-in-place-sorting
Apr 7, 20263 min read8
Segregate 0s and 1s (In-Place Sorting)
When I first saw this problem, it looked very simple… But it actually teaches an important concept:How to optimize from 2 passes → 1 pass using two pointers Problem Statement You are given an array c
Apr 7, 20263 min read5