Formatted code

Author: PTHARRISH

Prepinsta codes/11.reverse_number.py

@@ -1,30 +1,31 @@
 # Method 1: Using Simple Iteration
-num=int(input())
-reverse=0
-while num!=0:
-    remainder=num%10
-    reverse=(reverse*10)+remainder
-    num=num//10
+num = int(input())
+reverse = 0
+while num != 0:
+    remainder = num % 10
+    reverse = (reverse * 10) + remainder
+    num = num // 10
 print(reverse)
 
 
-
 # Method 2: Using String Slicing
 
-a=input()
+a = input()
 print(a[::-1])
 
 
 # Method 3: Using Recursion
 
-def recurse(n,reverse):
-    if n==0:
+
+def recurse(n, reverse):
+    if n == 0:
         return reverse
     else:
-        remainder=n%10
-        reverse=(reverse*10)+remainder
-        return recurse(n//10,reverse)
-    
-n=int(input('enter the number: '))
-reverse=0
-print(recurse(n,reverse))
+        remainder = n % 10
+        reverse = (reverse * 10) + remainder
+        return recurse(n // 10, reverse)
+
+
+n = int(input("enter the number: "))
+reverse = 0
+print(recurse(n, reverse))

Prepinsta codes/armstrong.py

@@ -4,27 +4,29 @@
 digit, sum = 0, 0
 length = len(str(num))
 for i in range(length):
-  digit = int(num%10)
-  num = num/10
-  sum += pow(digit,length)
-if sum==number:
-  print("Armstrong")
+    digit = int(num % 10)
+    num = num / 10
+    sum += pow(digit, length)
+if sum == number:
+    print("Armstrong")
 else:
-  print("Not Armstrong")
+    print("Not Armstrong")
 
 
 number = int(input("Enter the number: "))
 num = number
-sum =0
+sum = 0
 length = len(str(num))
 
-def checkArmstrong(num,length,sum):
-  if num==0:
-    return sum
-  sum+=pow(int(num%10),length)
-  return checkArmstrong(num/10,length,sum)
 
-if checkArmstrong(num,length,sum)==number:
-  print('Armstrong')
+def checkArmstrong(num, length, sum):
+    if num == 0:
+        return sum
+    sum += pow(int(num % 10), length)
+    return checkArmstrong(num / 10, length, sum)
+
+
+if checkArmstrong(num, length, sum) == number:
+    print("Armstrong")
 else:
-  print("Not Armstrong")
+    print("Not Armstrong")

Prepinsta codes/fibonacci_series.py

@@ -1,21 +1,21 @@
 # Method 1: Using Simple Iteration
-n=int(input("Enter the number: "))
-n1=0
-n2=1
-for i in range(2,n+1):
-    n3=n1+n2
-    n1=n2
-    n2=n3
+n = int(input("Enter the number: "))
+n1 = 0
+n2 = 1
+for i in range(2, n + 1):
+    n3 = n1 + n2
+    n1 = n2
+    n2 = n3
 print(n3)
 
 
 # Method 2: Using Recursive Function
 def fib(n):
-    if n<=1:
+    if n <= 1:
         return n
     else:
-        return fib(n-1)+fib(n-2)
-    
-n=int(input("Enter the number: "))
-print(fib(n))
+        return fib(n - 1) + fib(n - 2)
+
 
+n = int(input("Enter the number: "))
+print(fib(n))

Prepinsta codes/remove_vowels_form_the_string.py

@@ -1,32 +1,37 @@
 # remove the vowels
 # 1. loop
 def remove_vowels(sentence):
-    vowels=['a','e','i','o','u']
-    result=""
+    vowels = ["a", "e", "i", "o", "u"]
+    result = ""
     for i in sentence:
         if i.lower() not in vowels:
-            result+=""+i
+            result += "" + i
     print(result)
 
-sentence=input("enter the sentence: ")
+
+sentence = input("enter the sentence: ")
 remove_vowels(sentence)
 
+
 # 2. list comprehension
 def remove_vowels(sentence):
-    vowels=['a','e','i','o','u']
-    result=[i for i in sentence if i.lower() not in vowels]
-    result="".join(result) # list(result) to string conversion
+    vowels = ["a", "e", "i", "o", "u"]
+    result = [i for i in sentence if i.lower() not in vowels]
+    result = "".join(result)  # list(result) to string conversion
     print(result)
 
-sentence=input("enter the sentence: ")
+
+sentence = input("enter the sentence: ")
 remove_vowels(sentence)
 
 
 # 3 using regular expression
 import re
+
+
 def remove_vowels(sentence):
-    return re.sub("[AEIOUaeiou]","",sentence)
+    return re.sub("[AEIOUaeiou]", "", sentence)
 
 
-sentence=input("enter the sentence: ")
-print(remove_vowels(sentence))
+sentence = input("enter the sentence: ")
+print(remove_vowels(sentence))

Prepinsta codes/string_exception.py

@@ -1,17 +1,18 @@
 # check input is integer or not
 try:
-    num=int(input("enter the number:"))
+    num = int(input("enter the number:"))
     # a=float(num)
 except ValueError as e:
-    print("given input is not a number",e)
+    print("given input is not a number", e)
 
 
 def num():
-    num1=input("enter the number: ")
-    a=num1.isnumeric()
+    num1 = input("enter the number: ")
+    a = num1.isnumeric()
     if a:
         return True
     else:
         return False
-    
-print(num())
+
+
+print(num())

Prepinsta codes/sum_of_range.py

@@ -1,6 +1,7 @@
 def sum_of_range(n):
-    a=(n*(n+1))//2
+    a = (n * (n + 1)) // 2
     print(a)
 
-n=int(input())
-sum_of_range(n)
+
+n = int(input())
+sum_of_range(n)

leet code/75 leetcode/167. Two Sum II.py

@@ -1,21 +1,21 @@
-def twosum_sorted(nums,target):
+def twosum_sorted(nums, target):
     lp = 0
-    rp = len(nums)-1
-    while lp<rp:
-        s = nums[lp]+nums[rp]
-        if s==target:
-            return [lp+1,rp+1]
-        elif s<target:
-            lp+=1
+    rp = len(nums) - 1
+    while lp < rp:
+        s = nums[lp] + nums[rp]
+        if s == target:
+            return [lp + 1, rp + 1]
+        elif s < target:
+            lp += 1
         else:
-            rp-=1
+            rp -= 1
 
 
-data = sorted(list(map(int,input('enter the number: ').split(','))))
-target = int(input('target: '))
-print(twosum_sorted(data,target))
+data = sorted(list(map(int, input("enter the number: ").split(","))))
+target = int(input("target: "))
+print(twosum_sorted(data, target))
 
 # Output:
 # enter the number: 2,7,11,15
 # target: 9
-# [1, 2]
+# [1, 2]