Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Tutorial writeup - Segment Tree #215

Open
wingkwong opened this issue Oct 7, 2022 · 8 comments
Open

Tutorial writeup - Segment Tree #215

wingkwong opened this issue Oct 7, 2022 · 8 comments

Comments

@wingkwong
Copy link
Owner

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.

@Dhruvil-Lakhtaria
Copy link

Dhruvil-Lakhtaria commented Oct 14, 2022

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.

@wingkwong
Copy link
Owner Author

wingkwong commented Oct 14, 2022

@Dhruvil-Lakhtaria assigned. remember to read CONTRIBUTING.md first.

@Dhruvil-Lakhtaria
Copy link

Dhruvil-Lakhtaria commented Oct 14, 2022

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.

@Dhruvil-Lakhtaria
Copy link

PR added #278

@wingkwong
Copy link
Owner Author

Unassigned due to inactivity.

@SHAY2407
Copy link

SHAY2407 commented Oct 4, 2023

Hello,

I'm eager to work on this issue and prepare a comprehensive tutorial writeup covering the following topics:

  1. Overview: I'll provide an introduction to the concept of segment trees and their applications.
  2. 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.
  3. 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.
  4. 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.
  5. 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!

@wingkwong
Copy link
Owner Author

@SHAY2407 Go ahead.

@wingkwong
Copy link
Owner Author

Unassigned due to inactivity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants