Merge branch 'searchengine' of github.com:Xceptions/geekcomputersPython into searchengine

bringing in the commit from origin

Author: Xceptions

Laundary System/README.md

@@ -0,0 +1,91 @@
+# Laundry Service Class
+
+## Overview
+The LaundryService class is designed to manage customer details and calculate charges for a cloth and apparel cleaning service. It provides methods to create customer-specific instances, print customer details, calculate charges based on cloth type, branding, and season, and print final details including the expected day of return.
+
+## Class Structure
+### Methods
+1. `__init__(name, contact, email, cloth_type, branded, season)`: Initializes a new customer instance with the provided details and assigns a unique customer ID.
+   - Parameters:
+     - `name`: String, name of the customer.
+     - `contact`: Numeric (integer), contact number of the customer.
+     - `email`: Alphanumeric (string), email address of the customer.
+     - `cloth_type`: String, type of cloth deposited (Cotton, Silk, Woolen, or Polyester).
+     - `branded`: Boolean (0 or 1), indicating whether the cloth is branded.
+     - `season`: String, season when the cloth is deposited (Summer or Winter).
+     
+2. `customerDetails()`: Prints out the details of the customer, including name, contact number, email, cloth type, and whether the cloth is branded.
+
+3. `calculateCharge()`: Calculates the charge based on the type of cloth, branding, and season.
+   - Returns:
+     - Numeric, total charge for cleaning the cloth.
+
+4. `finalDetails()`: Calls `customerDetails()` and `calculateCharge()` methods within itself and prints the total charge and the expected day of return.
+   - Prints:
+     - Total charge in Rupees.
+     - Expected day of return (4 days if total charge > 200, otherwise 7 days).
+
+## Example Usage
+```python
+# Example usage:
+name = input("Enter customer name: ")
+contact = int(input("Enter contact number: "))
+email = input("Enter email address: ")
+cloth_type = input("Enter cloth type (Cotton/Silk/Woolen/Polyester): ")
+branded = bool(int(input("Is the cloth branded? (Enter 0 for No, 1 for Yes): ")))
+season = input("Enter season (Summer/Winter): ")
+
+customer = LaundryService(name, contact, email, cloth_type, branded, season)
+customer.finalDetails()
+
+
+markdown
+Copy code
+# Laundry Service Class
+
+## Overview
+The LaundryService class is designed to manage customer details and calculate charges for a cloth and apparel cleaning service. It provides methods to create customer-specific instances, print customer details, calculate charges based on cloth type, branding, and season, and print final details including the expected day of return.
+
+## Class Structure
+### Methods
+1. `__init__(name, contact, email, cloth_type, branded, season)`: Initializes a new customer instance with the provided details and assigns a unique customer ID.
+   - Parameters:
+     - `name`: String, name of the customer.
+     - `contact`: Numeric (integer), contact number of the customer.
+     - `email`: Alphanumeric (string), email address of the customer.
+     - `cloth_type`: String, type of cloth deposited (Cotton, Silk, Woolen, or Polyester).
+     - `branded`: Boolean (0 or 1), indicating whether the cloth is branded.
+     - `season`: String, season when the cloth is deposited (Summer or Winter).
+     
+2. `customerDetails()`: Prints out the details of the customer, including name, contact number, email, cloth type, and whether the cloth is branded.
+
+3. `calculateCharge()`: Calculates the charge based on the type of cloth, branding, and season.
+   - Returns:
+     - Numeric, total charge for cleaning the cloth.
+
+4. `finalDetails()`: Calls `customerDetails()` and `calculateCharge()` methods within itself and prints the total charge and the expected day of return.
+   - Prints:
+     - Total charge in Rupees.
+     - Expected day of return (4 days if total charge > 200, otherwise 7 days).
+
+## Example Usage
+```python
+# Example usage:
+name = input("Enter customer name: ")
+contact = int(input("Enter contact number: "))
+email = input("Enter email address: ")
+cloth_type = input("Enter cloth type (Cotton/Silk/Woolen/Polyester): ")
+branded = bool(int(input("Is the cloth branded? (Enter 0 for No, 1 for Yes): ")))
+season = input("Enter season (Summer/Winter): ")
+
+customer = LaundryService(name, contact, email, cloth_type, branded, season)
+customer.finalDetails()
+Usage Instructions
+Create an instance of the LaundryService class by providing customer details as parameters to the constructor.
+Use the finalDetails() method to print the customer details along with the calculated charge and expected day of return.
+
+
+Contributors
+(Rohit Raj)[https://github.com/MrCodYrohit]
+
+

Laundary System/code.py

@@ -0,0 +1,75 @@
+id=1
+class LaundryService:
+  def __init__(self,Name_of_customer,Contact_of_customer,Email,Type_of_cloth,Branded,Season,id):
+    self.Name_of_customer=Name_of_customer
+    self.Contact_of_customer=Contact_of_customer
+    self.Email=Email
+    self.Type_of_cloth=Type_of_cloth
+    self.Branded=Branded
+    self.Season=Season
+    self.id=id
+
+  def customerDetails(self):
+    print("The Specific Details of customer:")
+    print("customer ID: ",self.id)
+    print("customer name:", self.Name_of_customer)
+    print("customer contact no. :", self.Contact_of_customer)
+    print("customer email:", self.Email)
+    print("type of cloth", self.Type_of_cloth)
+    if self.Branded == 1:
+      a=True
+    else:
+      a=False
+    print("Branded", a)
+  def calculateCharge(self):
+    a=0
+    if self.Type_of_cloth=="Cotton":
+      a=50.0
+    elif self.Type_of_cloth=="Silk":
+      a=30.0
+    elif self.Type_of_cloth=="Woolen":
+      a=90.0
+    elif self.Type_of_cloth=="Polyester":
+      a=20.0
+    if self.Branded==1:
+      a=1.5*(a)
+    else:
+      pass
+    if self.Season=="Winter":
+      a=0.5*a
+    else:
+      a=2*a
+    print(a)
+    return a
+  def finalDetails(self):
+    self.customerDetails()
+    print("Final charge:",end="")
+    if self.calculateCharge() >200:
+      print("to be return in 4 days")
+    else:
+      print("to be return in 7 days")
+while True:
+  name=input("Enter the name: ")
+  contact=int(input("Enter the contact: "))
+  email=input("Enter the email: ")
+  cloth=input("Enter the type of cloth: ")
+  brand=bool(input("Branded ? "))
+  season=input("Enter the season: ")
+  obj=LaundryService(name,contact,email,cloth,brand,season,id)
+  obj.finalDetails()
+  id=id+1
+  z=input("Do you want to continue(Y/N):")
+  if z=="Y":
+    continue
+  elif z =="N":
+    print("Thanks for visiting!")
+    break
+  else:
+    print("Select valid option")
+
+
+
+
+
+
+      

News_App/requirements.txt

@@ -1,4 +1,4 @@
-solara == 1.26.1
+solara == 1.32.2
 Flask 
 gunicorn ==22.0.0
 simple-websocket

Password Generator/requirements.txt

@@ -1,2 +1,2 @@
 colorama==0.4.6
-inquirer==3.2.1
+inquirer==3.2.4

README.md

@@ -53,6 +53,7 @@ Feel free to explore the scripts and use them for your learning and automation n
 39. [space_invader.py.py](https://github.com/meezan-mallick/space_invader_game) - Classical 2D space invader game to recall your childhood memories.
 40. [Test Case Generator](https://github.com/Tanmay-901/test-case-generator/blob/master/test_case.py) - Generate different types of test cases with a clean and friendly UI, used in competitive programming and software testing.
 41. [Extract Thumbnail From Video](https://github.com/geekcomputers/Python/tree/ExtractThumbnailFromVideo) - Extract Thumbnail from video files
+42. [How to begin the journey of open source (first contribution)](https://www.youtube.com/watch?v=v2X51AVgl3o) - First Contribution of open source
 <hr>
 
 _**Note**: The content in this repository belongs to the respective authors and creators. I'm just providing a formatted README.md for better presentation._

TowerOfHanoi.py

@@ -0,0 +1,35 @@
+from inorder_successor import inorder_successor
+# The above line imports the inorder_successor function from the inorder_successor.py file
+def delete_node(root,val):
+  """ This function deletes a node with value val from the BST"""
+  
+  # search in the left subtree
+  if root.data < val:
+    root.right = delete_node(root.right,val)
+    
+  # search in the right subtree
+  elif root.data>val:
+    root.left=delete_node(root.left,val)
+    
+  # node to be deleted is found
+  else:
+    # case 1: no child leaf node
+    if root.left is None and root.right is None:
+      return None
+    
+    # case 2: one child
+    if root.left is None:
+      return root.right
+    
+    # case 2: one child
+    elif root.right is None:
+      return root.left
+    
+    # case 3: two children
+    
+    # find the inorder successor
+    IS=inorder_successor(root.right)
+    root.data=IS.data
+    root.right=delete_node(root.right,IS.data)
+  return root
+    

binary_search_trees/delete_a_node_in_bst.py

@@ -0,0 +1,10 @@
+def inorder_successor(root):
+  # This function returns the inorder successor of a node in a BST
+  
+  # The inorder successor of a node is the node with the smallest value greater than the value of the node
+  current=root
+  
+  # The inorder successor is the leftmost node in the right subtree
+  while current.left is not None:
+    current=current.left
+  return current

binary_search_trees/inorder_successor.py

@@ -0,0 +1,15 @@
+def inorder(root):
+    """ This function performs an inorder traversal of a BST"""
+    
+    # The inorder traversal of a BST is the nodes in increasing order
+    if root is None:
+        return
+    
+    # Traverse the left subtree
+    inorder(root.left)
+    
+    # Print the root node
+    print(root.data)
+    
+    # Traverse the right subtree
+    inorder(root.right)

binary_search_trees/inorder_traversal.py

@@ -0,0 +1,17 @@
+from tree_node import Node
+def insert(root,val):
+    
+    """ This function inserts a node with value val into the BST"""
+    
+    # If the tree is empty, create a new node
+    if root is None:
+        return Node(val)
+    
+    # If the value to be inserted is less than the root value, insert in the left subtree
+    if val < root.data:
+        root.left = insert(root.left,val)
+    
+    # If the value to be inserted is greater than the root value, insert in the right subtree
+    else:
+        root.right = insert(root.right,val)
+    return root

binary_search_trees/insert_in_bst.py

@@ -0,0 +1,85 @@
+from tree_node import Node
+from insert_in_bst import insert
+from delete_a_node_in_bst import delete_node
+from search_in_bst import search
+from inorder_successor import inorder_successor
+from mirror_a_bst import create_mirror_bst
+from print_in_range import print_in_range
+from root_to_leaf_paths import print_root_to_leaf_paths
+from validate_bst import is_valid_bst
+
+
+def main():
+    
+    # Create a BST
+    root = None
+    root = insert(root, 50)
+    root = insert(root, 30)
+    root = insert(root, 20)
+    root = insert(root, 40)
+    root = insert(root, 70)
+    root = insert(root, 60)
+    root = insert(root, 80)
+    
+    # Print the inorder traversal of the BST
+    print("Inorder traversal of the original BST:")
+    print_in_range(root, 10, 90)
+    
+    # Print the root to leaf paths
+    print("Root to leaf paths:")
+    print_root_to_leaf_paths(root, [])
+    
+    # Check if the tree is a BST
+    print("Is the tree a BST:", is_valid_bst(root,None,None))
+    
+    
+    # Delete nodes from the BST
+    print("Deleting 20 from the BST:")
+    root = delete_node(root, 20)
+    
+    # Print the inorder traversal of the BST
+    print("Inorder traversal of the BST after deleting 20:")
+    print_in_range(root, 10, 90)
+    
+    # Check if the tree is a BST
+    print("Is the tree a BST:", is_valid_bst(root,None,None))
+    
+    
+    # Delete nodes from the BST
+    print("Deleting 30 from the BST:")
+    root = delete_node(root, 30)
+    
+    # Print the inorder traversal of the BST after deleting 30
+    print("Inorder traversal of the BST after deleting 30:")
+    print_in_range(root, 10, 90)
+    
+    # Check if the tree is a BST
+    print("Is the tree a BST:", is_valid_bst(root,None,None))
+    
+    # Delete nodes from the BST
+    print("Deleting 50 from the BST:")
+    root = delete_node(root, 50)
+    
+    # Print the inorder traversal of the BST after deleting 50
+    print("Inorder traversal of the BST after deleting 50:")
+    print_in_range(root, 10, 90)
+    
+    # Check if the tree is a BST
+    print("Is the tree a BST:", is_valid_bst(root,None,None))
+    
+    
+    print("Searching for 70 in the BST:", search(root, 70))
+    print("Searching for 100 in the BST:", search(root, 100))
+    print("Inorder traversal of the BST:")
+    print_in_range(root, 10, 90)
+    print("Creating a mirror of the BST:")
+    mirror_root = create_mirror_bst(root)
+    print("Inorder traversal of the mirror BST:")
+    print_in_range(mirror_root, 10, 90)
+
+if __name__ == "__main__":
+    main()
+
+
+
+

binary_search_trees/main.py

@@ -0,0 +1,16 @@
+from tree_node import Node
+def create_mirror_bst(root):
+    """ Function to create a mirror of a binary search tree"""
+    
+    # If the tree is empty, return None
+    if root is None:
+        return None
+    
+    # Create a new node with the root value
+    
+    # Recursively create the mirror of the left and right subtrees
+    left_mirror = create_mirror_bst(root.left)
+    right_mirror = create_mirror_bst(root.right)
+    root.left = right_mirror
+    root.right = left_mirror
+    return root