---
title: "#segment-tree articles | Hashnode"
description: "Explore 15 articles tagged #segment-tree on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/segment-tree"
---

Tag

# #segment-tree

15 posts · 0 followers

[Abhinandan Mishra](https://hashnode.com/@abhinandanmishra1) · [Oct 13, 2025](https://hashnode.com/posts/segment-tree-handling-large-constraints-with-coordinate-compression/68ed0eedc2c0d2d93d412e54)

### [Segment Tree: Handling Large Constraints with Coordinate Compression](https://abhinandanmishra1.hashnode.dev/segment-tree-handling-large-constraints-with-coordinate-compression?utm_source=hashnode&utm_medium=feed)

Explore Salary Queries in CSES Problem Set Using Segment Trees for Range Queries

11 min read · [abhinandanmishra1.hashnode.dev](https://abhinandanmishra1.hashnode.dev/segment-tree-handling-large-constraints-with-coordinate-compression?utm_source=hashnode&utm_medium=feed)

[Abhinandan Mishra](https://hashnode.com/@abhinandanmishra1) · [Oct 5, 2025](https://hashnode.com/posts/segment-tree-range-update-with-lazy-propagation/68e24bb2631b3c4f6ae6e77b)

### [Segment Tree: Range update with lazy propagation](https://abhinandanmishra1.hashnode.dev/segment-tree-range-update-with-lazy-propagation?utm_source=hashnode&utm_medium=feed)

When moving from a normal segment tree to a lazy segment tree, the main goal is to support efficient range updates. In a standard segment tree, updating a range \[l, r\] requires visiting every affected leaf node, which is O(n) in the worst case. Lazy ...

4 min read · [abhinandanmishra1.hashnode.dev](https://abhinandanmishra1.hashnode.dev/segment-tree-range-update-with-lazy-propagation?utm_source=hashnode&utm_medium=feed)

[Abhinandan Mishra](https://hashnode.com/@abhinandanmishra1) · [Oct 5, 2025](https://hashnode.com/posts/segment-tree-introduction/68e2478adb6b5f541f4611e9)

### [Segment Tree: Introduction](https://abhinandanmishra1.hashnode.dev/segment-tree-introduction?utm_source=hashnode&utm_medium=feed)

This article covers about the basics of segment tree

6 min read · [abhinandanmishra1.hashnode.dev](https://abhinandanmishra1.hashnode.dev/segment-tree-introduction?utm_source=hashnode&utm_medium=feed)

[MrHe](https://hashnode.com/@MrHe) · [Oct 3, 2025](https://hashnode.com/posts/segment-tree/68dfd34ed54a8fe8012469a8)

### [Segment Tree](https://xiaoh.hashnode.dev/segment-tree?utm_source=hashnode&utm_medium=feed)

好久没更新了，今天咱们来聊聊一个面试中的常客，也是一个能把很多复杂问题变简单的神器——线段树（Segment Tree）。 别一听到“树”就头大，这东西说白了就是个“高级版的分块数组”，核心思想就是“预处理”和“分治”。咱们的目标是，通过这篇文章，让你不仅能手撕线段树，还能理解它背后的思维方式，这样以后遇到类似的区间问题，脑子里能立马浮现出这个结构。 场景引入：从最笨的方法开始 老规矩，先看题。给你一个数组 arr，现在有两个操作： 把 arr\[i\] 的值更新成 v。 查询 arr 数组在 ...

5 min read · [xiaoh.hashnode.dev](https://xiaoh.hashnode.dev/segment-tree?utm_source=hashnode&utm_medium=feed)

[Animesh Kumar](https://hashnode.com/@animeshkmr) · [Jun 28, 2025](https://hashnode.com/posts/meesho-open-campus-recruitment-2025/685fae3beb4b1ace4416d004)

### [Meesho Open Campus Recruitment 2025: My Interview Journey & Key Learnings](https://animeshk.hashnode.dev/meesho-open-campus-recruitment-2025?utm_source=hashnode&utm_medium=feed)

Meesho Interview Experience 2025, Meesho OA Questions, Meesho Hackathon Solutions, Campus Recruitment Guide, LLD Round Tips, Segment Tree Problems

3 min read · [animeshk.hashnode.dev](https://animeshk.hashnode.dev/meesho-open-campus-recruitment-2025?utm_source=hashnode&utm_medium=feed)

[Nitin Singh](https://hashnode.com/@ns717) · [May 23, 2025](https://hashnode.com/posts/segment-tree/6830d9651a36cd35c93ac63b)

### [🌲 Segment Tree](https://ns717.hashnode.dev/segment-tree?utm_source=hashnode&utm_medium=feed)

The Powerhouse for Range Queries

4 min read · [ns717.hashnode.dev](https://ns717.hashnode.dev/segment-tree?utm_source=hashnode&utm_medium=feed)

[Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 11, 2025](https://hashnode.com/posts/heavy-light-decomposition-an-advanced-graph-algorithm/6782086a0b6d01f755fb3836)

### [Heavy Light Decomposition: An Advanced Graph Algorithm](https://blogs.arkainfotech.in/heavy-light-decomposition-an-advanced-graph-algorithm?utm_source=hashnode&utm_medium=feed)

Heavy Light Decomposition: optimizes tree queries/updates, ideal for competitive programming and efficient tree operations

7 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/heavy-light-decomposition-an-advanced-graph-algorithm?utm_source=hashnode&utm_medium=feed)

[Saumyaa Garg](https://hashnode.com/@saumyaagarg) · [Dec 30, 2024](https://hashnode.com/posts/day-34-segment-trees-advanced/67768e78b728a980e1296e1f)

### [Day 34: Segment Trees Advanced](https://saumyaagarg.hashnode.dev/day-34-segment-trees-advanced?utm_source=hashnode&utm_medium=feed)

Welcome to Day 34 of my 100 Days of DSA challenge! Today, I delved into advanced Segment Tree concepts, focusing on optimizing range updates and queries using lazy propagation. These advanced techniques allow for efficient solutions to problems invol...

14 min read · [saumyaagarg.hashnode.dev](https://saumyaagarg.hashnode.dev/day-34-segment-trees-advanced?utm_source=hashnode&utm_medium=feed)

[Saumyaa Garg](https://hashnode.com/@saumyaagarg) · [Dec 29, 2024](https://hashnode.com/posts/day-33-segment-trees-basics/67768127e64c44fee2a8a871)

### [Day 33: Segment Trees Basics](https://saumyaagarg.hashnode.dev/day-33-segment-trees-basics?utm_source=hashnode&utm_medium=feed)

Welcome to Day 33 of my 100 Days of DSA challenge! Today’s focus was on mastering the fundamentals of segment trees, a versatile data structure designed for efficient range queries and updates. From implementing basic range sum queries to solving pro...

12 min read · [saumyaagarg.hashnode.dev](https://saumyaagarg.hashnode.dev/day-33-segment-trees-basics?utm_source=hashnode&utm_medium=feed)

[Saurabh Singh Gautam](https://hashnode.com/@saurabhsinghgautam) · [Dec 23, 2024](https://hashnode.com/posts/segment-tree-coordinate-compression-a-love-story-or-overkill/676972698102a8271a7140d6)

### [Segment Tree + Coordinate Compression: A love story or overkill ?](https://saurabhxalgorithms.hashnode.dev/segment-tree-coordinate-compression-a-love-story-or-overkill?utm_source=hashnode&utm_medium=feed)

Using coordinate compression and segment tree to solve problems verses using policy based data structure

6 min read · [saurabhxalgorithms.hashnode.dev](https://saurabhxalgorithms.hashnode.dev/segment-tree-coordinate-compression-a-love-story-or-overkill?utm_source=hashnode&utm_medium=feed)
