Segment_tree with lazy propagation for range sum problem. #148
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
dnery
requested changes
Oct 19, 2019
| @@ -0,0 +1,138 @@ | |||
| #include<bits/stdc++.h> | |||
Member
There was a problem hiding this comment.
Hey @Cryptedknight, thanks for the contribution! 😄
Please take a look at our rules and guidelines. I apologize, but we cannot accept this file.
Source found on: https://www.geeksforgeeks.org/lazy-propagation-in-segment-tree/
| @@ -0,0 +1,56 @@ | |||
| #include<bits/stdc++.h> | |||
Member
There was a problem hiding this comment.
Does this file relate to the problem at all?
Although we cannot accept the previous file, perhaps we could change your contribution to focus on this trie structure implementation... what do you think? 😸
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description
Please include a small description of your algorithm/data structure and add reference to the Hacktoberfest issue (#66)