calculating the factorial of a number

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))
+

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)
+
+

Challenge questions/Readme.md

@@ -1,29 +1,32 @@
-# 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
+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 ;)
 
----------------------------------------------------------------------------------------------------------------------------------------
-
-## 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 | 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: <ul><li>Words less than or equal to 3 characters need not be scrambled.</li><li>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.</li><li>Punctuation at the end of the word to be maintained as is i.e. `"Surprising,"` could become `"Spsirnirug,"` but not `"Spsirn,irug"`.</li><li>Following punctuation marks are to be supported - comma, question mark, full stop, semicolon, exclamation.</li><li>Do this for a file and maintain sequences of lines.</li></ul>|
+|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***|
+

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()

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))

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)))

README.md

@@ -1,11 +1,38 @@
-# Python_Practice
+# 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.**
+| 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: <ul><li>Words less than or equal to 3 characters need not be scrambled.</li><li>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.</li><li>Punctuation at the end of the word to be maintained as is i.e. `"Surprising,"` could become `"Spsirnirug,"` but not `"Spsirn,irug"`.</li><li>Following punctuation marks are to be supported - comma, question mark, full stop, semicolon, exclamation.</li><li>Do this for a file and maintain sequences of lines.</li></ul>|
+|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|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|
 
- **Cycle's-: These folders are for specific question Set, ranging from easy to hard.**
+**Ciphers :** This folder contains the encryption and Decryption algorithms.
 
- **Working codes-: If you are working on any code first keep them here and then move them to respective folder.**
+**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.