@srinivas364

Sliding Window Technique: A Powerful Tool for Subarray Problems

21h ago · 4 min read · Sliding Window Technique When solving array or string problems in competitive programming, we often deal with subarrays or substrings. A naive solution usually checks every possible subarray, which le

Understanding Graphs, Recursion, and Depth First Search (DFS)

1d ago · 10 min read · Introduction to Graphs A graph consists of : Nodes (Vertices) → entities Edges → connections between nodes Example : Students in a classroom and their friendships. 1 — 2 | | 3 — 4 Here : Node

Mastering Fenwick Tree for Competitive Programming

Feb 23 · 11 min read · While 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

Mo’s Algorithm – Step by Step Guide

Feb 21 · 10 min read · Mo’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 dis

Efficient Range Queries Using Sqrt Decomposition

Feb 21 · 6 min read · Square 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 C