Python Practice Problems

Sagar Paul · Sagar Paul · commit ef5a07e1967a · 2021-04-10T00:54:13.000+05:30
diff --git a/Python Problem Solving/02.py b/Python Problem Solving/02.py
diff --git a/Python Problem Solving/10_Floyd's Triangle | Printing Numbers in Right Triangle Shape.py b/Python Problem Solving/10_Floyd's Triangle | Printing Numbers in Right Triangle Shape.py
@@ -15,3 +15,4 @@
         num = num +1
     print()
 
+
diff --git a/Python Problem Solving/24_Printing Stars in Pyramid Shape Using while loop.py b/Python Problem Solving/24_Printing Stars in Pyramid Shape Using while loop.py
@@ -1,8 +1,11 @@
 '''
-   * 
-  * *
- * * *
-* * * *
+       * 
+      * * 
+     * * * 
+    * * * * 
+   * * * * * 
+  * * * * * * 
+ * * * * * * * 
 '''
 n = int(input("enter no. of rows: "))
 i = 1
diff --git a/Python Problem Solving/25_Printing Stars in Hollow Diamond Shape.py b/Python Problem Solving/25_Printing Stars in Hollow Diamond Shape.py
@@ -1,7 +1,32 @@
+'''
+  *
+ * *
+*   *
+ * *
+  *
 
 
+# for 5 rows and 5 columns
 
+for row in range(5):
+    for col in range(5):
+        if row + col ==2 or row - col == 2 or col - row ==2 or col+row ==6:
+            print("*",end="")
+        else:
+            print(end=" ")
+    print()
 
+'''
+
+# for 7 rows and 7 columns
+
+for row in range(7):
+    for col in range(7):
+        if row +col == 3 or row-col==3 or col-row ==3 or row +col==9:
+            print("*",end="") 
+        else:
+            print(end=" ")
+    print()
 
 
 
diff --git a/Python Problem Solving/26_Reverse a String Using for loop.py b/Python Problem Solving/26_Reverse a String Using for loop.py
@@ -0,0 +1,8 @@
+def reverse(string):
+    rev_string = ""
+    for i in string:
+        rev_string  = i + rev_string
+    print(rev_string)
+
+string = input("--->>")
+reverse(string)
diff --git a/Python Problem Solving/27_Printing Numbers in Square Shape.py b/Python Problem Solving/27_Printing Numbers in Square Shape.py
diff --git a/Python Problem Solving/28_Highest Common Factor of Two Positive Numbers using Recursion.py b/Python Problem Solving/28_Highest Common Factor of Two Positive Numbers using Recursion.py
@@ -0,0 +1,11 @@
+def computeGCD(a,b):
+    if b ==0:
+        return a
+    else:
+        return computeGCD(b, a%b)
+
+a = int(input("a =  "))
+b = int(input("b =  "))
+
+print(computeGCD(a,b))
+
diff --git a/Python Problem Solving/28_Highest Common Factor of Two Positive Numbers using math.gcd .py b/Python Problem Solving/28_Highest Common Factor of Two Positive Numbers using math.gcd .py
@@ -0,0 +1,11 @@
+#Program To Find out the GCD of Two Positive Numbers
+import math
+
+x = int(input("x =  "))
+y = int(input("y =  "))
+
+z = math.gcd(x,y)
+
+print(f"Highest common factor or GCD of {x} and {y} is:  {z}")
+
+
diff --git a/Python Problem Solving/29_Number Pattern (Printing Numbers in Pyramid Shape).py b/Python Problem Solving/29_Number Pattern (Printing Numbers in Pyramid Shape).py
@@ -0,0 +1,25 @@
+'''
+                              1  
+                           2  1  2  
+                        3  2  1  2  3  
+                     4  3  2  1  2  3  4  
+                  5  4  3  2  1  2  3  4  5  
+               6  5  4  3  2  1  2  3  4  5  6  
+            7  6  5  4  3  2  1  2  3  4  5  6  7  
+         8  7  6  5  4  3  2  1  2  3  4  5  6  7  8  
+      9  8  7  6  5  4  3  2  1  2  3  4  5  6  7  8  9  
+   10 9  8  7  6  5  4  3  2  1  2  3  4  5  6  7  8  9  10 
+11 10 9  8  7  6  5  4  3  2  1  2  3  4  5  6  7  8  9  10 11 
+'''
+
+n = int(input("Enter Number of rows:  "))
+
+for row in range(1,n+1):
+    for i in range(1,n-row+1):
+        print(format(" ","<3"),end="")
+    for j in range(row,0,-1):
+        print(format(j,"<3"),end="")
+    for k in range(2,row+1):
+        print(format(k,"<3"),end="")
+    print()
+
diff --git a/Python Problem Solving/30_printing number in right triangle.py b/Python Problem Solving/30_printing number in right triangle.py
@@ -0,0 +1,22 @@
+'''
+1 
+2 3 
+4 5 6 
+7 8 9 10 
+11 12 13 14 15 
+16 17 18 19 20 21 
+'''
+
+
+row =  int(input("Enter Number:  "))
+
+n  =1
+for i in range(1,row+1):
+    for j in range(1,i+1):
+        print(n,end=" ")
+        n = n+1
+    print()
+
+
+    
+
diff --git a/Python Problem Solving/31_format function.py b/Python Problem Solving/31_format function.py
@@ -0,0 +1,22 @@
+'''
+1   
+2   3   
+4   5   6   
+7   8   9   10  
+11  12  13  14  15  
+16  17  18  19  20  21  
+22  23  24  25  26  27  28  
+29  30  31  32  33  34  35  36  
+37  38  39  40  41  42  43  44  45  
+46  47  48  49  50  51  52  53  54  55  
+'''
+
+
+row =  int(input("Enter Number:  "))
+
+n  =1
+for i in range(1,row+1):
+    for j in range(1,i+1):
+        print(format(n,"<3"),end=" ")
+        n = n+1
+    print()
diff --git a/Python Problem Solving/32_printing numbers in pyramid shape.py b/Python Problem Solving/32_printing numbers in pyramid shape.py
@@ -0,0 +1,25 @@
+'''
+                  1     
+               2     3     
+            4     5     6     
+         7     8     9     10    
+      11    12    13    14    15    
+   16    17    18    19    20    21    
+22    23    24    25    26    27    28    
+'''
+
+row = int(input("Enter the number of rows:   "))
+n = 1
+for i in range(row):
+    for j in range(row-i-1):
+        print(format(" ","<3"),end="")
+    for k in range(i+1):
+        print(format(n,"<6"),end="")
+        n = n+1
+    print()
+
+
+
+    
+
+    
diff --git a/Python Problem Solving/33_Guess The Output.py b/Python Problem Solving/33_Guess The Output.py
@@ -0,0 +1,7 @@
+x = []
+if x:
+    print(x,"True")
+else:
+    print(x,"False")
+
+### Note:  ANYTHING IN PYTHON WHICH IS EMPTY IS TREATED AS FALSE  (), {}, [], "", ---->> are False
diff --git a/Python Problem Solving/34_Guess The Output 2.py b/Python Problem Solving/34_Guess The Output 2.py
@@ -0,0 +1,9 @@
+p = [1,3,10]
+q = 0
+r = ()
+if p or q and r :
+    print("True")
+else:
+    print("False")
+
+### PRESIDENCE OF AND IS MORE OVER OR  ,  first (q and r)  then  p
diff --git a/Python Problem Solving/35_linkedlist node of nth  last element from the end.py b/Python Problem Solving/35_linkedlist node of nth  last element from the end.py
@@ -0,0 +1,45 @@
+class Node:
+    def __init__(self,data):
+        self.data = data
+        self.next = None
+
+class LinkedList:
+    def __init__(self):
+        self.head = None
+
+    def print_end_LL(self):
+        if self.head is None:
+            print("The Linked list is Empty")
+        else:
+            n = self.head
+            temp = self.head
+            for i in range(3):
+                n = n.next
+            while n is not None:
+                temp = temp.next
+                n = n.next
+            print(f"the 3rd element from the end is: {temp.data}")
+
+
+    def add_begin(self,data):
+        if self.head is None:
+            self.head = Node(data)
+        else:
+            new_node = Node(data)
+            new_node.next = self.head
+            self.head = new_node
+
+LL = LinkedList()
+LL.add_begin(100)
+LL.add_begin(90)
+LL.add_begin(80)
+LL.add_begin(70)
+LL.add_begin(60)
+LL.add_begin(50)
+LL.add_begin(40)
+LL.add_begin(30)
+LL.add_begin(20)
+LL.add_begin(10)
+
+LL.print_end_LL()
+
diff --git a/Python Problem Solving/37_Selection Sort Algorithm in increasing order.py b/Python Problem Solving/37_Selection Sort Algorithm in increasing order.py
@@ -0,0 +1,13 @@
+a = [2,5,1,0,15,226,23,933,9,0,2,15324,2,15]
+
+# In increasing order
+
+for  i in range(len(a)):
+    for j in range(i,len(a)):
+        if a[i] < a[j]:
+            None
+        else:
+            temp = a[i]
+            a[i] = a[j]
+            a[j] = temp
+print(a)
diff --git a/Python Problem Solving/38_Selection Sort Algorithm in decreasing order.py b/Python Problem Solving/38_Selection Sort Algorithm in decreasing order.py
@@ -0,0 +1,11 @@
+a = [2,5,1,0,15,226,23,933,9,0,2,15324,2,15]
+
+# In decreasing order
+
+for i in range(len(a)):
+    for j in range(i, len(a)):
+        if a[i] <a[j]:
+            temp = a[i]
+            a[i] = a[j]
+            a[j] = temp
+print(a)
diff --git a/Python Problem Solving/39_Selection Sort Algorithm in decreasing order_by max min function.py b/Python Problem Solving/39_Selection Sort Algorithm in decreasing order_by max min function.py
@@ -0,0 +1,11 @@
+a = [2,5,1,0,15,226,23,933,9]
+
+for i in range(len(a)):
+    max_val = max(a[i:])
+    max_ind = a.index(max_val)
+    a[i],a[max_ind] = a[max_ind],a[i]
+
+print(a)
+
+    
+
diff --git a/Python Problem Solving/39_Selection Sort Algorithm in increasing order_by max min function.py b/Python Problem Solving/39_Selection Sort Algorithm in increasing order_by max min function.py
@@ -0,0 +1,7 @@
+a = [2,5,1,0,15,226,23,933,9]
+
+for i in range(len(a)):
+    min_val = min(a[i:])
+    min_ind = a.index(min_val)
+    a[i],a[min_ind] = a[min_ind],a[i]
+print(a)
diff --git a/Python Problem Solving/40_Selection Sort | Program | User Input |.py b/Python Problem Solving/40_Selection Sort | Program | User Input |.py
@@ -0,0 +1,15 @@
+num = int(input("How many elements you want in the list:  "))
+a = [int(input("Enter an element:  ")) for x in range(num) ]
+
+# In increasing order
+
+for i in range(len(a)):
+    for j in range(i,len(a)):
+        if a[i] > a[j]:
+            temp = a[i]
+            a[i] = a[j]
+            a[j] = temp
+    
+print(f"The sorted list in increasing order is:   {a}")
+
+
diff --git a/Python Problem Solving/41_Bubble Sort Algorithm.py b/Python Problem Solving/41_Bubble Sort Algorithm.py
@@ -0,0 +1,16 @@
+n = int(input("How many number you want in the list: "))
+a = [int(input("Enter an element to add in the list: ")) for i in range(n) ]
+
+
+print(a)
+
+for i in range(len(a)-1):
+    for j in range(len(a)-i-1):
+        if a[j] > a[j+1]:
+            a[j],a[j+1] = a[j+1],a[j]
+       #print(a)  ----->>> to print each steps of sorting
+    #print()
+print(f"The final sorted list in increasing order is:  {a}")
+
+
+
diff --git a/Python Problem Solving/42_Palindrome Program | Reverse The String And Number | Advanced Slicing.py b/Python Problem Solving/42_Palindrome Program | Reverse The String And Number | Advanced Slicing.py
@@ -0,0 +1,43 @@
+s = input("Enter a String to check Pailindrome:   ")
+rev_s = s[::-1]
+if s == rev_s:
+    print(f"{s} is a Pailindrome")
+else:
+    print("Entered String is NOT a Pailindrome")
+
+
+
+
+
+
+'''
+
+s = input("Enter a String to check Pailindrome:   ")
+rev_s = s[::-1]
+
+if len(s)%2 ==0:
+    a = []
+    for i in range(int(len(s)/2) ):
+        if s[i] == rev_s[i]:
+            a.append(1)
+    if len(a) == int(len(s)/2):
+        print("Entered String is a Pailindrome")
+    else:
+        print("Entered String is NOT a Pailindrome")
+
+        
+
+elif len(s)%2 !=0:
+    b = []
+    for i in range(int(len(s)/2)):
+        if s[i] == rev_s[i]:
+            b.append(1)
+    if len(b) == int(len(s)/2):
+        print("Entered String is a Pailindrome")
+    else:
+        print("Entered String is NOT a Pailindrome")
+
+'''
+
+
+
diff --git a/Python Problem Solving/43_Program To Print Sum Of Digits Of Positive Integer Number.py b/Python Problem Solving/43_Program To Print Sum Of Digits Of Positive Integer Number.py
@@ -0,0 +1,24 @@
+'''
+n = int(input("Enter a numbre:  "))
+num = n
+result = 0
+
+while n != 0 :
+    result = n%10 +result
+    n = n//10
+
+print(f"Sum of each digits of the number {num} is = {result}")
+
+'''
+
+
+n = input("Enter a numbre:  ")
+
+result = 0
+
+for i in range(len(n)):
+    result = int(n[i:i+1]) + result 
+
+print(f"Sum of each digits of the number {n} is = {result}")
+
+
diff --git a/Python Problem Solving/44_Guess The Output 06.py b/Python Problem Solving/44_Guess The Output 06.py
diff --git a/Python Problem Solving/Linkedlist_Practice.py b/Python Problem Solving/Linkedlist_Practice.py

Original file line number	Diff line number	Diff line change
`@@ -15,3 +15,4 @@`
`15`	`15`	`num = num +1`
`16`	`16`	`print()`
`17`	`17`
	`18`	`+`