Updated the Coding section #439
Open
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
A code to count the connected components in a graph
Added Connnect_components_using_DFS.cpp
Cycle_detection_using_DSU
…ing_DSU Added Cycle_detection_using_DSU.cpp
Added the standard CP template for Union Find Algorithm
Added Union_Find.cpp
Added the standard template for CP of segment trees
Added Segment_tree.cpp
It is an extension of the Segment tree where time complexity is reduced by propagating the updates in lazy fashion
…egment_trees Added Lazy_propagation.cpp
An code optimised way of handling the range queries and updates but with some limitations along with usefulness in CP
A must question for interviews and coding test solved using BIT .
Added Inversion_count_using_BIT.cpp
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.
Added Some of the best Techniques to ace the coding test . Hoping it will be helpful .