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

New challenges #37

Merged
merged 6 commits into from
Oct 24, 2019
Merged
Changes from all commits
Commits
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
12 changes: 11 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,17 @@
| |`#~~~~~#`|
| |`##~~~##`|
| |`###~###`|
|8|***Challenge Awaits***|
|8|Given a singly linked list of N nodes, find the middle of the linked list. For example, if given linked list is 1->2->3->4->5 then output should be 3. If there are even nodes, then there would be two middle nodes. So we need to print second middle element. Eg., if given linked list is 1->2->3->4->5->6 then output should be 4.|
|9| Input a list having negative and positive integers.
| |Output: Arranging them in increasing order(excluding negative impact).|
| |Eg: Input: -8,-5,-3,-1,3,6,9|
| |Output: -1, -3, 3, -5, 6, -8, 9|
| |Excluding negation, list is 1,3,3,5,6,8,9. So list will be accordingly.|
| |Order should be followed.(If -3 came before 3, then order should be same i.e., -3,3)|
|10|Given a list with N numbers and a sum S, find all pairs(2 numbers) from the list which add upto S.
| |Input: list: 1,4,6,45,10,8,8|
| |Sum: 16|
| |Output: 10 and 6, 8 and 8|

**Ciphers :** This folder contains the encryption and Decryption algorithms.

Expand Down