From 19a07726614fe5243745c9b3d2c79cee3ad28583 Mon Sep 17 00:00:00 2001 From: Abhishek Kumar Date: Fri, 11 Oct 2019 16:35:06 +0530 Subject: [PATCH 01/23] Update README.md --- README.md | 9 ++++----- 1 file changed, 4 insertions(+), 5 deletions(-) diff --git a/README.md b/README.md index 51e43bf..477150f 100644 --- a/README.md +++ b/README.md @@ -1,11 +1,10 @@ # Python_Practice -### Note: -**Challenge Questions-: This Folder contains the challenge question which you might want to do.** +**Challenge Questions :** This folder contains the challenge question which you might want to do. - **Ciphers-: This folder contains the encryption and Decryption algorithms.** +**Ciphers :** This folder contains the encryption and Decryption algorithms. - **Cycle's-: These folders are for specific question Set, ranging from easy to hard.** +**Cycle's :** These folders are for specific question set, ranging from easy to hard. - **Working codes-: If you are working on any code first keep them here and then move them to respective folder.** +**Working codes :** If you are working on any code first keep them here and then move them to respective folder. From 41b154d6726c3e777bc44d2aa972333d0dd4313b Mon Sep 17 00:00:00 2001 From: Abhishek Kumar Date: Fri, 11 Oct 2019 16:35:25 +0530 Subject: [PATCH 02/23] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 477150f..4710f9c 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,4 @@ -# Python_Practice +# Python Practice **Challenge Questions :** This folder contains the challenge question which you might want to do. From 03dcec197d70138d2762ce440833479a95f984ca Mon Sep 17 00:00:00 2001 From: Abhishek Kumar Date: Fri, 11 Oct 2019 17:01:55 +0530 Subject: [PATCH 03/23] Update Readme.md --- Challenge questions/Readme.md | 50 ++++++++++++++++++++++------------- 1 file changed, 31 insertions(+), 19 deletions(-) diff --git a/Challenge questions/Readme.md b/Challenge questions/Readme.md index 7f70233..314148d 100644 --- a/Challenge questions/Readme.md +++ b/Challenge questions/Readme.md @@ -1,10 +1,8 @@ -# Python_Practice +# Challenges -## Challenges +**All set of challenges are the sub set difficulty which would be faced while doing other challenges** -**All set of Challenges are the sub set Difficulty which would be faced while doing other challenges** - -**More you complete the challenges, More you will be able to do** +**More you complete the challenges, more you will be able to do** ### Note: Make a Folder of your Name and complete the Challenges given below @@ -13,17 +11,31 @@ Wish to give a challenge? sure just make an edit, and throw the pull request ;) --------------------------------------------------------------------------------------------------------------------------------------- -## Challenge: -1. Write a Code that accepts String in a format like "My name is someone", then it has to be formatted into "MyNameIsSomeone" and then back to original -2. Write a Code that accepts the inversemod of num to inversemodnum -> num inverse% inversemodnum = ? -3. Write a Code that scrambles the words by following the rules below: - a)Words less than or equal to 3 characters need not be scrambled . - b)Don't scramble first and last char, so Scrambling can become Srbmnacilg or Srbmnailcg or Snmbracilg , i.e. letters except first and last can be scrambled in any order . - c)Punctuation at the end of the word to be maintained as is i.e. "Surprising," could become "Spsirnirug," but not "Spsirn,irug" . - d)Following punctuation marks are to be supported - Comma Question mark, Full stop, Semicolon, Exclamation . - e)Do this for a file and maintain sequences of lines . -4. Reading from a CSV file and printing all colums as rows. -5. Given Strings of code equations like, "45 >= 67 56==70 30 <= 78" and output should be binary "0 0 1" { input is seprated with space and output should be on new line} -6. ***Challenge Awaits*** -7. ***Challenge Awaits*** ---------------------------------------------------------------------------------------------------------------------------------------- +## Challenges: + +### Challenge 1 +Write a Code that accepts String in a format like `"My name is someone"`, then it has to be formatted into `"MyNameIsSomeone"` and then back to original + +### Challenge 2 +Write program that accepts the inversemod of num to inversemodnum -> num inverse% inversemodnum = ? + +### Challenge 3 +Write a Code that scrambles the words by following the rules below: + +* Words less than or equal to 3 characters need not be scrambled. + +* Don't scramble first and last char, so `Scrambling` can become `Srbmnacilg` or `Srbmnailcg` or `Snmbracilg` , i.e. letters except first and last can be scrambled in any order. + +* Punctuation at the end of the word to be maintained as is i.e. `"Surprising,"` could become `"Spsirnirug,"` but not `"Spsirn,irug"`. + +* Following punctuation marks are to be supported - comma, question mark, full stop, semicolon, exclamation. + +* Do this for a file and maintain sequences of lines. + + +### Challenge 4 +Reading from a CSV file and printing all colums as rows. +### Challenge 5 +Given Strings of code equations like, `"45 >= 67 56==70 30 <= 78"` and output should be binary `"0 0 1"` { input is seprated with space and output should be on new line} +### Challenge 6 +***Challenge Awaits*** From 93067ce752193a3f6c6ceb723e7afe46e853d379 Mon Sep 17 00:00:00 2001 From: Abhishek Kumar Date: Fri, 11 Oct 2019 17:02:51 +0530 Subject: [PATCH 04/23] Update Readme.md --- Challenge questions/Readme.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Challenge questions/Readme.md b/Challenge questions/Readme.md index 314148d..8722511 100644 --- a/Challenge questions/Readme.md +++ b/Challenge questions/Readme.md @@ -5,7 +5,7 @@ **More you complete the challenges, more you will be able to do** ### Note: -Make a Folder of your Name and complete the Challenges given below +Make a folder of your **Github username** and complete the challenges given below Wish to give a challenge? sure just make an edit, and throw the pull request ;) From 44759ccdc2e9e380f6bfc71b3ac1edd21467b6e8 Mon Sep 17 00:00:00 2001 From: Naman1233 <45735998+Naman1233@users.noreply.github.com> Date: Fri, 11 Oct 2019 18:37:20 +0530 Subject: [PATCH 05/23] Challenge4 pandas required! --- Challenge questions/Naman1233/Chellange4 | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 Challenge questions/Naman1233/Chellange4 diff --git a/Challenge questions/Naman1233/Chellange4 b/Challenge questions/Naman1233/Chellange4 new file mode 100644 index 0000000..85b826b --- /dev/null +++ b/Challenge questions/Naman1233/Chellange4 @@ -0,0 +1,14 @@ +from pandas import read_csv + +def CSV_print(filename): + df = read_csv(filename) + columns = df.columns + for i in range(len(columns)): + print("Row ", i+1, ": ", ", ".join(map(str, df[columns[i]]))) + +if __name__ == "__main__": + filename = str(input("Enter filename or path:")) + print(filename) + CSV_print(filename) + + From 4486619f8781026f007447881fe3c44dc1827bcb Mon Sep 17 00:00:00 2001 From: Kusum P Grandhi Date: Fri, 11 Oct 2019 21:50:38 +0530 Subject: [PATCH 06/23] add question6 --- Challenge questions/Readme.md | 10 ++++++++++ 1 file changed, 10 insertions(+) diff --git a/Challenge questions/Readme.md b/Challenge questions/Readme.md index 8722511..e125d40 100644 --- a/Challenge questions/Readme.md +++ b/Challenge questions/Readme.md @@ -38,4 +38,14 @@ Reading from a CSV file and printing all colums as rows. ### Challenge 5 Given Strings of code equations like, `"45 >= 67 56==70 30 <= 78"` and output should be binary `"0 0 1"` { input is seprated with space and output should be on new line} ### Challenge 6 +WAP that inputs the length and breadth of a sheet, this sheet should be made of a diamond design with '~' and the rest of the corners should be filled with '#' +eg- size=7X7 + ###~### + ##~~~## + #~~~~~# + ~~~~~~~ + #~~~~~# + ##~~~## + ###~### + ***Challenge Awaits*** From f01f192503263ccc5e58b791d342d28e56d187bd Mon Sep 17 00:00:00 2001 From: Tanay Findley <46724628+Chr0nicT@users.noreply.github.com> Date: Fri, 11 Oct 2019 18:45:34 -0400 Subject: [PATCH 07/23] Update Readme.md --- Challenge questions/Readme.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/Challenge questions/Readme.md b/Challenge questions/Readme.md index 8722511..908278f 100644 --- a/Challenge questions/Readme.md +++ b/Challenge questions/Readme.md @@ -38,4 +38,6 @@ Reading from a CSV file and printing all colums as rows. ### Challenge 5 Given Strings of code equations like, `"45 >= 67 56==70 30 <= 78"` and output should be binary `"0 0 1"` { input is seprated with space and output should be on new line} ### Challenge 6 +Write a program that converts text written numbers (Ex: Thirty-One) to its numeric form (Ex: 31) and perform the opposite. Input: 31 Output: (Thirty-One) +### Challenge 7 ***Challenge Awaits*** From b47b1e7bfca01108e7329bf6ddf723f858bcca51 Mon Sep 17 00:00:00 2001 From: godfreyduke Date: Fri, 11 Oct 2019 22:03:46 -0700 Subject: [PATCH 08/23] Add a rot13 cipher in response to Issue #7 --- Ciphers/rot13.py | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 Ciphers/rot13.py diff --git a/Ciphers/rot13.py b/Ciphers/rot13.py new file mode 100644 index 0000000..966603d --- /dev/null +++ b/Ciphers/rot13.py @@ -0,0 +1,21 @@ +#rot13 +OFFSET_LOWER = ord('a') +OFFSET_UPPER = ord('A') + +def rot13(text): + rot13_text = '' + for i in range(len(text)): + ch = text[i] + if ch.isalpha(): + if(ch.islower()): + offset = OFFSET_LOWER + else: + offset = OFFSET_UPPER + rot13_text += chr(((ord(ch)-offset+13)%26+offset)) + else: + rot13_text += ch + return rot13_text + +plain_text = input("Enter the string: ") +print(rot13(plain_text)) +print(rot13(rot13(plain_text))) From aec919932bd4445f00337cd945ce94e705a62d27 Mon Sep 17 00:00:00 2001 From: Abhishek Kumar Date: Sat, 12 Oct 2019 12:06:37 +0530 Subject: [PATCH 09/23] Update Readme.md --- Challenge questions/Readme.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/Challenge questions/Readme.md b/Challenge questions/Readme.md index b477979..bf9213b 100644 --- a/Challenge questions/Readme.md +++ b/Challenge questions/Readme.md @@ -42,6 +42,7 @@ Write a program that converts text written numbers (Ex: Thirty-One) to its numer ### Challenge 7 WAP that inputs the length and breadth of a sheet, this sheet should be made of a diamond design with '~' and the rest of the corners should be filled with '#' eg- size=7X7 +``` ###~### ##~~~## #~~~~~# @@ -49,5 +50,6 @@ eg- size=7X7 #~~~~~# ##~~~## ###~### + ``` ### Challenge 8 ***Challenge Awaits*** From d99559133933a38a5239dd49bf3f0502d2cef1b7 Mon Sep 17 00:00:00 2001 From: Sofiia2001 Date: Sun, 13 Oct 2019 14:33:41 +0300 Subject: [PATCH 10/23] Adding the solved problem 1 --- Challenge questions/Sofiia2001/problem_1.py | 33 +++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 Challenge questions/Sofiia2001/problem_1.py diff --git a/Challenge questions/Sofiia2001/problem_1.py b/Challenge questions/Sofiia2001/problem_1.py new file mode 100644 index 0000000..4957842 --- /dev/null +++ b/Challenge questions/Sofiia2001/problem_1.py @@ -0,0 +1,33 @@ +def formatting(sentence): + sentence = list(sentence) + for symbol in range(len(sentence) - 1): + if sentence[symbol] == ' ': + sentence[symbol] = '' + sentence[symbol + 1] = sentence[symbol + 1].upper() + + sentence = ''.join(sentence) + return sentence + + +def formatting_back(sentence): + to_return = [sentence[0]] + for symbol in sentence[1:]: + if symbol == symbol.upper(): + to_return.append(' ') + to_return.append(symbol.lower()) + else: + to_return.append(symbol) + to_return = ''.join(to_return) + return to_return + + +def main(): + sentence = str(input('Enter yor string: ')) + formatted = formatting(sentence) + print(f'Formatted: {formatted}') + formatted_back = formatting_back(formatted) + print(f'Formatted back: {formatted_back}') + + +if __name__ == '__main__': + main() \ No newline at end of file From b7e9dc4fbdd1ec987b0fa559bb813ebe0f3a340b Mon Sep 17 00:00:00 2001 From: Hemant Rana <38358739+Hemant-60@users.noreply.github.com> Date: Sun, 13 Oct 2019 19:27:45 +0530 Subject: [PATCH 11/23] Challange-1 --- Hemant-60/c1.py | 41 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 Hemant-60/c1.py diff --git a/Hemant-60/c1.py b/Hemant-60/c1.py new file mode 100644 index 0000000..8515cf0 --- /dev/null +++ b/Hemant-60/c1.py @@ -0,0 +1,41 @@ +def print_without_spaces(some_str): + flag = 0 + other_str="" + for i in some_str: + if flag == 0 and i!=" ": + other_str+=i + elif i==" ": + flag=1 + elif flag==1 and i!=" ": + flag=0 + i=i.upper() + other_str+=i + + return other_str +def print_with_spaces(some_str): + flag=0 + other_str="" + for i in some_str: + if i>="A" and i<="Z": + flag=1 + + if flag==0 and i!=" ": + other_str+=i + + + if flag == 1: + i=i.lower() + flag=0 + other_str+=" " + other_str+=i + + other_str = other_str[1].capitalize()+other_str[2:] + + return other_str + + +some_str=input("Enter the string : ") +some_str=print_without_spaces(some_str) +print(some_str) +print(print_with_spaces(some_str)) + From 8ae812f3d7a0bd845b6a2f86e507e90d7e3abb0f Mon Sep 17 00:00:00 2001 From: Hemant Rana <38358739+Hemant-60@users.noreply.github.com> Date: Sun, 13 Oct 2019 19:28:31 +0530 Subject: [PATCH 12/23] Delete c1.py --- Hemant-60/c1.py | 41 ----------------------------------------- 1 file changed, 41 deletions(-) delete mode 100644 Hemant-60/c1.py diff --git a/Hemant-60/c1.py b/Hemant-60/c1.py deleted file mode 100644 index 8515cf0..0000000 --- a/Hemant-60/c1.py +++ /dev/null @@ -1,41 +0,0 @@ -def print_without_spaces(some_str): - flag = 0 - other_str="" - for i in some_str: - if flag == 0 and i!=" ": - other_str+=i - elif i==" ": - flag=1 - elif flag==1 and i!=" ": - flag=0 - i=i.upper() - other_str+=i - - return other_str -def print_with_spaces(some_str): - flag=0 - other_str="" - for i in some_str: - if i>="A" and i<="Z": - flag=1 - - if flag==0 and i!=" ": - other_str+=i - - - if flag == 1: - i=i.lower() - flag=0 - other_str+=" " - other_str+=i - - other_str = other_str[1].capitalize()+other_str[2:] - - return other_str - - -some_str=input("Enter the string : ") -some_str=print_without_spaces(some_str) -print(some_str) -print(print_with_spaces(some_str)) - From dc371b1e8567c1dab338965544d41d6f32288010 Mon Sep 17 00:00:00 2001 From: Hemant Rana <38358739+Hemant-60@users.noreply.github.com> Date: Sun, 13 Oct 2019 19:29:12 +0530 Subject: [PATCH 13/23] challange-1 --- Challenge questions/Hemant-60/c1.py | 41 +++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 Challenge questions/Hemant-60/c1.py diff --git a/Challenge questions/Hemant-60/c1.py b/Challenge questions/Hemant-60/c1.py new file mode 100644 index 0000000..8515cf0 --- /dev/null +++ b/Challenge questions/Hemant-60/c1.py @@ -0,0 +1,41 @@ +def print_without_spaces(some_str): + flag = 0 + other_str="" + for i in some_str: + if flag == 0 and i!=" ": + other_str+=i + elif i==" ": + flag=1 + elif flag==1 and i!=" ": + flag=0 + i=i.upper() + other_str+=i + + return other_str +def print_with_spaces(some_str): + flag=0 + other_str="" + for i in some_str: + if i>="A" and i<="Z": + flag=1 + + if flag==0 and i!=" ": + other_str+=i + + + if flag == 1: + i=i.lower() + flag=0 + other_str+=" " + other_str+=i + + other_str = other_str[1].capitalize()+other_str[2:] + + return other_str + + +some_str=input("Enter the string : ") +some_str=print_without_spaces(some_str) +print(some_str) +print(print_with_spaces(some_str)) + From 5e000b949637d84e3304595a08fbea30c4378801 Mon Sep 17 00:00:00 2001 From: Anant Kaushik Date: Sun, 13 Oct 2019 20:18:11 +0530 Subject: [PATCH 14/23] Challenge 1 --- .../anantkaushik/challenge1.py | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 Challenge questions/anantkaushik/challenge1.py diff --git a/Challenge questions/anantkaushik/challenge1.py b/Challenge questions/anantkaushik/challenge1.py new file mode 100644 index 0000000..f00b027 --- /dev/null +++ b/Challenge questions/anantkaushik/challenge1.py @@ -0,0 +1,25 @@ +def encodeString(sentence): + sentence = sentence.split() + for i in range(len(sentence)): + sentence[i] = sentence[i].capitalize() + return "".join(sentence) + +def decodeString(sentence): + if not sentence: + return "" + decodedSentence = [] + word = sentence[0] + for i in range(1,len(sentence)): + if sentence[i].isupper(): + decodedSentence.append(word) + word = sentence[i].lower() + else: + word += sentence[i] + decodedSentence.append(word) + return " ".join(decodedSentence) + +sentence = input("Enter a String: ") +encodedSentence = encodeString(sentence) +decodedSentence = decodeString(encodedSentence) +print("Converted String is {}".format(encodedSentence)) +print("Original String is {}".format(decodedSentence)) \ No newline at end of file From 708b9ee95991532aaa87beb6a095596bf13dd439 Mon Sep 17 00:00:00 2001 From: Paul Bennett Date: Sun, 13 Oct 2019 16:07:41 +0100 Subject: [PATCH 15/23] adding table for issue #22 --- Challenge questions/Readme.md | 58 +++++++++++------------------------ 1 file changed, 18 insertions(+), 40 deletions(-) diff --git a/Challenge questions/Readme.md b/Challenge questions/Readme.md index bf9213b..5de088e 100644 --- a/Challenge questions/Readme.md +++ b/Challenge questions/Readme.md @@ -13,43 +13,21 @@ Wish to give a challenge? sure just make an edit, and throw the pull request ;) ## Challenges: -### Challenge 1 -Write a Code that accepts String in a format like `"My name is someone"`, then it has to be formatted into `"MyNameIsSomeone"` and then back to original - -### Challenge 2 -Write program that accepts the inversemod of num to inversemodnum -> num inverse% inversemodnum = ? - -### Challenge 3 -Write a Code that scrambles the words by following the rules below: - -* Words less than or equal to 3 characters need not be scrambled. - -* Don't scramble first and last char, so `Scrambling` can become `Srbmnacilg` or `Srbmnailcg` or `Snmbracilg` , i.e. letters except first and last can be scrambled in any order. - -* Punctuation at the end of the word to be maintained as is i.e. `"Surprising,"` could become `"Spsirnirug,"` but not `"Spsirn,irug"`. - -* Following punctuation marks are to be supported - comma, question mark, full stop, semicolon, exclamation. - -* Do this for a file and maintain sequences of lines. - - -### Challenge 4 -Reading from a CSV file and printing all colums as rows. -### Challenge 5 -Given Strings of code equations like, `"45 >= 67 56==70 30 <= 78"` and output should be binary `"0 0 1"` { input is seprated with space and output should be on new line} -### Challenge 6 -Write a program that converts text written numbers (Ex: Thirty-One) to its numeric form (Ex: 31) and perform the opposite. Input: 31 Output: (Thirty-One) -### Challenge 7 -WAP that inputs the length and breadth of a sheet, this sheet should be made of a diamond design with '~' and the rest of the corners should be filled with '#' -eg- size=7X7 -``` - ###~### - ##~~~## - #~~~~~# - ~~~~~~~ - #~~~~~# - ##~~~## - ###~### - ``` -### Challenge 8 -***Challenge Awaits*** +| Challenge | Description | +| :---: | --- | +|1 | Write a Code that accepts String in a format like `"My name is someone"`, then it has to be formatted into `"MyNameIsSomeone"` and then back to original | +|2| Write program that accepts the inversemod of num to inversemodnum -> num inverse% inversemodnum = ? | +|3 | Write a Code that scrambles the words by following the rules below:
  • Words less than or equal to 3 characters need not be scrambled.
  • Don't scramble first and last char, so `Scrambling` can become `Srbmnacilg` or `Srbmnailcg` or `Snmbracilg` , i.e. letters except first and last can be scrambled in any order.
  • Punctuation at the end of the word to be maintained as is i.e. `"Surprising,"` could become `"Spsirnirug,"` but not `"Spsirn,irug"`.
  • Following punctuation marks are to be supported - comma, question mark, full stop, semicolon, exclamation.
  • Do this for a file and maintain sequences of lines.
| +|4|Reading from a CSV file and printing all colums as rows.| +|5|Given Strings of code equations like, `"45 >= 67 56==70 30 <= 78"` and output should be binary `"0 0 1"` { input is seprated with space and output should be on new line}| +|6|Write a program that converts text written numbers (Ex: Thirty-One) to its numeric form (Ex: 31) and perform the opposite. Input: 31 Output: (Thirty-One)| +|7|WAP that inputs the length and breadth of a sheet, this sheet should be made of a diamond design with '~' and the rest of the corners should be filled with '#' eg- size=7X7 | +| |`###~###`| +| |`##~~~##`| +| |`#~~~~~#`| +| |`~~~~~~~`| +| |`#~~~~~#`| +| |`##~~~##`| +| |`###~###`| +|8|***Challenge Awaits***| + From 67f343590a48ed5aac6cadbabe6ac3dec9ad2f55 Mon Sep 17 00:00:00 2001 From: Abhishek Kumar Date: Sun, 13 Oct 2019 22:07:28 +0530 Subject: [PATCH 16/23] Update Readme.md --- Challenge questions/Readme.md | 1 - 1 file changed, 1 deletion(-) diff --git a/Challenge questions/Readme.md b/Challenge questions/Readme.md index 5de088e..f54ea33 100644 --- a/Challenge questions/Readme.md +++ b/Challenge questions/Readme.md @@ -9,7 +9,6 @@ Make a folder of your **Github username** and complete the challenges given belo Wish to give a challenge? sure just make an edit, and throw the pull request ;) ---------------------------------------------------------------------------------------------------------------------------------------- ## Challenges: From 6de8fb3c10149923c6884c53dddd30f52fcdf31e Mon Sep 17 00:00:00 2001 From: Abhishek Kumar Date: Sun, 13 Oct 2019 22:07:58 +0530 Subject: [PATCH 17/23] Update README.md --- README.md | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/README.md b/README.md index 4710f9c..7c88e05 100644 --- a/README.md +++ b/README.md @@ -3,6 +3,24 @@ **Challenge Questions :** This folder contains the challenge question which you might want to do. +| Challenge | Description | +| :---: | --- | +|1 | Write a Code that accepts String in a format like `"My name is someone"`, then it has to be formatted into `"MyNameIsSomeone"` and then back to original | +|2| Write program that accepts the inversemod of num to inversemodnum -> num inverse% inversemodnum = ? | +|3 | Write a Code that scrambles the words by following the rules below:
  • Words less than or equal to 3 characters need not be scrambled.
  • Don't scramble first and last char, so `Scrambling` can become `Srbmnacilg` or `Srbmnailcg` or `Snmbracilg` , i.e. letters except first and last can be scrambled in any order.
  • Punctuation at the end of the word to be maintained as is i.e. `"Surprising,"` could become `"Spsirnirug,"` but not `"Spsirn,irug"`.
  • Following punctuation marks are to be supported - comma, question mark, full stop, semicolon, exclamation.
  • Do this for a file and maintain sequences of lines.
| +|4|Reading from a CSV file and printing all colums as rows.| +|5|Given Strings of code equations like, `"45 >= 67 56==70 30 <= 78"` and output should be binary `"0 0 1"` { input is seprated with space and output should be on new line}| +|6|Write a program that converts text written numbers (Ex: Thirty-One) to its numeric form (Ex: 31) and perform the opposite. Input: 31 Output: (Thirty-One)| +|7|WAP that inputs the length and breadth of a sheet, this sheet should be made of a diamond design with '~' and the rest of the corners should be filled with '#' eg- size=7X7 | +| |`###~###`| +| |`##~~~##`| +| |`#~~~~~#`| +| |`~~~~~~~`| +| |`#~~~~~#`| +| |`##~~~##`| +| |`###~###`| +|8|***Challenge Awaits***| + **Ciphers :** This folder contains the encryption and Decryption algorithms. **Cycle's :** These folders are for specific question set, ranging from easy to hard. From 58c5c112dc3a1349a70dad7e865ee9a3fcf114e3 Mon Sep 17 00:00:00 2001 From: prachijustin Date: Thu, 24 Oct 2019 21:10:13 +0530 Subject: [PATCH 18/23] 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 19/23] 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 20/23] 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 21/23] 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 22/23] 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 23/23] 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.