---
title: "Muppidi Srinivas (@srinivas364) | Hashnode"
description: "Simplifying DSA & Tech Concepts. Read the latest articles by Muppidi Srinivas on Hashnode."
url: "https://hashnode.com/@srinivas364"
---

@srinivas364

# Muppidi Srinivas

@srinivas364 · India · Joined February 2026

Simplifying DSA & Tech Concepts

### [Sliding Window Technique: A Powerful Tool for Subarray Problems](https://srinivastechblog.hashnode.dev/sliding-window-technique-a-powerful-tool-for-subarray-problems?utm_source=hashnode&utm_medium=feed)

Learn the Sliding Window technique to efficiently solve subarray and substring problems and reduce time complexity from O(N²) to O(N).

4 min read · [srinivastechblog.hashnode.dev](https://srinivastechblog.hashnode.dev/sliding-window-technique-a-powerful-tool-for-subarray-problems?utm_source=hashnode&utm_medium=feed)

[Mar 16](https://hashnode.com/posts/sliding-window-technique-a-powerful-tool-for-subarray-problems/69b817892ad6ae5184b1f46d)

### [Understanding Graphs, Recursion, and Depth First Search (DFS)](https://srinivastechblog.hashnode.dev/understanding-graphs-recursion-and-depth-first-search-dfs?utm_source=hashnode&utm_medium=feed)

Discover how recursion helps DFS explore graphs deeply and efficiently.

10 min read · [srinivastechblog.hashnode.dev](https://srinivastechblog.hashnode.dev/understanding-graphs-recursion-and-depth-first-search-dfs?utm_source=hashnode&utm_medium=feed)

[Mar 16](https://hashnode.com/posts/understanding-graphs-recursion-and-depth-first-search-dfs/69b7c6bb6ca8e7d49b9bc29f)

### [Mastering Fenwick Tree for Competitive Programming](https://srinivastechblog.hashnode.dev/mastering-fenwick-tree-for-competitive-programming?utm_source=hashnode&utm_medium=feed)

Crack range queries and updates in O(log n) with this powerful and easy-to-implement data structure.

11 min read · [srinivastechblog.hashnode.dev](https://srinivastechblog.hashnode.dev/mastering-fenwick-tree-for-competitive-programming?utm_source=hashnode&utm_medium=feed)

[Feb 23](https://hashnode.com/posts/mastering-fenwick-tree-for-competitive-programming/699bed5e96cb64f7288301aa)

### [Mo’s Algorithm – Step by Step Guide](https://srinivastechblog.hashnode.dev/mo-s-algorithm-step-by-step-guide?utm_source=hashnode&utm_medium=feed)

A powerful trick to handle complex range queries in competitive programming

10 min read · [srinivastechblog.hashnode.dev](https://srinivastechblog.hashnode.dev/mo-s-algorithm-step-by-step-guide?utm_source=hashnode&utm_medium=feed)

[Feb 21](https://hashnode.com/posts/mo-s-algorithm-step-by-step-guide/69994b6ca20b74e093e1b5df)

### [Efficient Range Queries Using Sqrt Decomposition](https://srinivastechblog.hashnode.dev/efficient-range-queries-using-sqrt-decomposition?utm_source=hashnode&utm_medium=feed)

Learn how Sqrt Decomposition speeds up range queries

6 min read · [srinivastechblog.hashnode.dev](https://srinivastechblog.hashnode.dev/efficient-range-queries-using-sqrt-decomposition?utm_source=hashnode&utm_medium=feed)

[Feb 21](https://hashnode.com/posts/efficient-range-queries-using-sqrt-decomposition/699930b5a20b74e093de1618)
