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

Segment_tree with lazy propagation for range sum problem. #148

Open
wants to merge 2 commits into
base: master
Choose a base branch
from

Conversation

Cryptedknight
Copy link

Description

Please include a small description of your algorithm/data structure and add reference to the Hacktoberfest issue (#66)

@dnery dnery self-assigned this Oct 15, 2019
@@ -0,0 +1,138 @@
#include<bits/stdc++.h>
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

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>
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

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
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants