Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upLinked list queue #1
Open
Conversation
* updating docs * deleting csv files * solving conflict
Py-Contributors#225) * Created Bitmasking Directory and Added important Bitmasking Operations * Delete fast_exponention_uisng_bitmasking.cpp Fast Expo Deleted as already there
* updating docs * deleting csv files * solving conflict * managing docs
The Algorithms And DataStructure banner at the start of Readme.md was aligned to the top of the rectangle. Brought it to the center.
* Re-arranged Files * Update PULL_REQUEST_TEMPLATE.md * Update PULL_REQUEST_TEMPLATE.md
* Subset Sum * Subset Sum Problem * Update Subset_sum.py * Update Subset_sum.py * Update Subset_sum.py Co-authored-by: Ayush Modi <[email protected]>
* Implement Segment Tree | Python [Py-Contributors#314] * Improve Documentation There were some speling mistakes and other slight grammatical errors in the documentation.
…ors#598) * Added solution to Shortest Common Supersequence problem * Removed linting errors * Addressed review comment
* added Pollard Rho Algorithm * Linted PollardRho per flake8 guidelines * Delete .PollardRho.py.swp * Update PollardRho.py * Update PollardRho.py
* count 1 added * Update countDigitOne.py fixing flake8
* Update LinkedList.py * Added DP on DAG problem
)" (Py-Contributors#646) This reverts commit ff3e2f8.
* Create find_path_dist_in_matrix.py * fixed flake8 problem * fixed linting * fixed all linting
* Added new file * Delete Wiggle_sort.py
* Create BogoSort.py Implementation of Bogosort. It is based on the random reordering of the elements. * Update BogoSort.py Correction of flake8 errors
* Subset Sum * Subset Sum Problem * Update Subset_sum.py * Update Subset_sum.py * Subset Sum * Update Subset_sum.py * Comb Sort Co-authored-by: Ayush Modi <[email protected]>
* Create Fibonacci_Search.py * Add FibonacciSearch.py * Update Fibonacci_Search.py * Update Fibonacci_Search.py Taking input from the user * Update Fibonacci_Search.py * Update Fibonacci_Search.py Improved output * Improved output Co-authored-by: Ayush Modi <[email protected]>
…o added the readqueue() feature that lets us traverse the queue and check if an element exists. Test codes included.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Pull Request Template
--First-contribution
-- new feature suggested
-- Hacktoberfest 2020 participant
What have you Changed(must)
added a file
LinkedListQueue.cpp
which does the job of a queue implemented through linked lists, making understanding and execution easier for newcomers.
Feature: Readqueue() added that lets you traverse through the queue and check if an element exists.
just a contribution to your code-base for Hacktoberfest 2020. :-)
Issue no.(must) - 0
Pr will be close and marked as spam. If issue number not found or issue was assigned to someone else.
Marking as spam can block your account from HacktoberFest.
Self Check(Tick After Making pull Request)
README - How to Contribute