From 58c5c112dc3a1349a70dad7e865ee9a3fcf114e3 Mon Sep 17 00:00:00 2001 From: prachijustin Date: Thu, 24 Oct 2019 21:10:13 +0530 Subject: [PATCH 1/6] New challenges --- README.md | 12 +++++++++++- 1 file changed, 11 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index 7c88e05..e5ac1c7 100644 --- a/README.md +++ b/README.md @@ -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. From dfdf2edc2f25c3222549b0328defea8492aad467 Mon Sep 17 00:00:00 2001 From: prachijustin Date: Thu, 24 Oct 2019 21:14:26 +0530 Subject: [PATCH 2/6] New challenges --- README.md | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/README.md b/README.md index e5ac1c7..d3e74e0 100644 --- a/README.md +++ b/README.md @@ -21,15 +21,15 @@ | |`###~###`| |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)| +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| +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. From cdcb63c166e79d7593c456c63bd11dca117bb325 Mon Sep 17 00:00:00 2001 From: prachijustin Date: Thu, 24 Oct 2019 21:16:11 +0530 Subject: [PATCH 3/6] New challenges --- README.md | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/README.md b/README.md index d3e74e0..b6bce30 100644 --- a/README.md +++ b/README.md @@ -21,15 +21,15 @@ | |`###~###`| |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)| +| |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| +| |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. From 13aa6be23486a2876c3ba59bb88f887af5f865b0 Mon Sep 17 00:00:00 2001 From: prachijustin Date: Thu, 24 Oct 2019 21:18:06 +0530 Subject: [PATCH 4/6] New challenges --- README.md | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/README.md b/README.md index b6bce30..b6336b9 100644 --- a/README.md +++ b/README.md @@ -21,15 +21,15 @@ | |`###~###`| |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)| +
  • 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| +
  • 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. From 7efae1e1adead7cceaa69b4d3067cc89a52bcc0a Mon Sep 17 00:00:00 2001 From: prachijustin Date: Thu, 24 Oct 2019 21:20:02 +0530 Subject: [PATCH 5/6] New challenges --- README.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index b6336b9..f6f1107 100644 --- a/README.md +++ b/README.md @@ -21,15 +21,15 @@ | |`###~###`| |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).
    • +
    • 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)| +
    • 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
    • +
    • Input: list: 1,4,6,45,10,8,8
    • Sum: 16
      • -
    • Output: 10 and 6, 8 and 8| +
    • Output: 10 and 6, 8 and 8
    | **Ciphers :** This folder contains the encryption and Decryption algorithms. From 59c4b28a3bd99f439650033e1dc3c8b1ec37bd9f Mon Sep 17 00:00:00 2001 From: prachijustin Date: Thu, 24 Oct 2019 21:20:39 +0530 Subject: [PATCH 6/6] New challenges --- README.md | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/README.md b/README.md index f6f1107..b6bce30 100644 --- a/README.md +++ b/README.md @@ -21,15 +21,15 @@ | |`###~###`| |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)
    | +| |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
    | +| |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.