leetcode-the-hard-way
leetcode-the-hard-way copied to clipboard
Tutorial writeup - Segment Tree
It should cover
- overview
- basic segment tree (with LC problems walk through)
- dynamic segment tree (with LC problems walk through)
- lazy propagation (with LC problems walk through)
- suggested problems
For those who wanna take it, please state 2 - 3 LC problems that you're gonna use for this writeup. Prefer someone who has deep knowledge on this topic.
Hey I have basic knowledge of segment tree and willing to work on this issue. Basic segment tree. range-frequency-queries range-sum-query-mutalble. And I have started researching about dynamic segment tree and lazy propagation. Can you assign it to me.
@Dhruvil-Lakhtaria assigned. remember to read CONTRIBUTING.md first.
I am done with
- basic segment tree (tutorial + solution).
- lazy propagation (tutorial). can I make a pull request for this much and get it reviewed. I will start working on the rest after review if that's fine.
PR added #278
Unassigned due to inactivity.
Hello,
I'm eager to work on this issue and prepare a comprehensive tutorial writeup covering the following topics:
- Overview: I'll provide an introduction to the concept of segment trees and their applications.
- Basic Segment Tree (with LC problems walk-through): I'll explain the basics with LeetCode problems like LeetCode 307 - Range Sum Query - Mutable and LeetCode 315 - Count of Smaller Numbers After Self.
- Dynamic Segment Tree (with LC problems walk-through): I'll delve into dynamic segment trees using examples from LeetCode 699 - Falling Squares and LeetCode 732 - My Calendar III.
- Lazy Propagation (with LC problems walk-through): I'll explore lazy propagation techniques with a focus on optimizing solutions, using LeetCode 307 - Range Sum Query - Mutable (Revisited) and LeetCode 715 - Range Module.
- Suggested Problems: I'll recommend additional LeetCode problems like LeetCode 218 - The Skyline Problem and LeetCode 327 - Count of Range Sum for further practice.
Thank you!
@SHAY2407 Go ahead.
Unassigned due to inactivity