Skip to content

Added a README for Linkled Lists #135

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.

Sign up for GitHub

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

Closed
wants to merge 3 commits into from
Closed

Added a README for Linkled Lists #135

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
75c0c47
Added README.md for Linked Lists
Zanark Dec 8, 2017
dc9ed81
Updated README.md
Zanark Dec 8, 2017
ba9f4f4
Updated README.md
Zanark Dec 8, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 19 additions & 0 deletions Competitive Coding/Linked List/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
# Linked List operations

**This folder contains files that have the following algorithms**

1. All BASIC Linked List operations on a Linked List based on *Pointers*

* Adding elements at the *end* of a Linked List.
* Adding elements at the *begining* of a Linked List.
Copy link
Member

Choose a reason for hiding this comment

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

Like give a link to the subpart of the Linked List programming demonstrating this.

Copy link
Contributor Author

Choose a reason for hiding this comment

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

Okay I will update the README and send it to you soon

* Finding the *number of nodes* in a Linked List.
* Adding an element at the *middle (Mid-point Position)* of a Linked List.
* Adding elements at a *specific position* of a Linked List.
* Displaying elements of a Linked List.
* Deleting the element at the *middle (Mid-point Position)* of the Linked List.
* Deleting a *specific element* from a Linked List.
* Sorting the Linked List *[Increasing order]*.
* Merging two Sorted *[Increasing order]* Linked Lists.
* Reversing a Linked List.

2. Removing Duplicate Elements from an unsorted Linked List.