Muppidi Srinivas

@srinivas364

Simplifying DSA & Tech Concepts

IndiaJoined February 2026

About

I break down complex programming and DSA topics into simple, beginner-friendly explanations. Currently learning, building, and sharing my journey in tech.

Available for

Open to internships and technical writing opportunities

Muppidi Srinivas's blogs

Srinivas Tech Blogsrinivastechblog.hashnode.dev13 posts

Articles Comments

Recently published

MSMuppidi Srinivassrinivastechblog.hashnode.devMar 16 · 4 min read

Sliding Window Technique: A Powerful Tool for Subarray Problems

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

0

MSMuppidi Srinivassrinivastechblog.hashnode.devMar 16 · 10 min read

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

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

0

MSMuppidi Srinivassrinivastechblog.hashnode.devFeb 23 · 11 min read

Mastering Fenwick Tree for Competitive Programming

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

0

MSMuppidi Srinivassrinivastechblog.hashnode.devFeb 21 · 10 min read

Mo’s Algorithm – Step by Step Guide

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

0

MSMuppidi Srinivassrinivastechblog.hashnode.devFeb 21 · 6 min read

Efficient Range Queries Using Sqrt Decomposition

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

0

Muppidi Srinivas

About

Available for

Muppidi Srinivas's blogs

Recently published

Sliding Window Technique: A Powerful Tool for Subarray Problems

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

Mastering Fenwick Tree for Competitive Programming

Mo’s Algorithm – Step by Step Guide

Efficient Range Queries Using Sqrt Decomposition

Search Hashnode

Muppidi Srinivas

About

Available for

Muppidi Srinivas's blogs

Recently published

Sliding Window Technique: A Powerful Tool for Subarray Problems

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

Mastering Fenwick Tree for Competitive Programming

Mo’s Algorithm – Step by Step Guide

Efficient Range Queries Using Sqrt Decomposition