presudo 1.0.0

package/pods/DSA/lasttime.txt

@@ -0,0 +1,66 @@
+Perfect subarray
+
+
+def perfect_subarrays(arr):
+   MOD = 10**9 + 7
+   n = len(arr)
+   seen = set()
+   prefix = 0
+   left = 0
+   result = 0
+   seen.add(0)
+   for right in range(n):
+       prefix += arr[right]
+       while prefix in seen:
+           seen.remove(sum(arr[left:right+1]))
+           left += 1
+       seen.add(prefix)
+       result += (right - left + 1)
+   return result % MOD
+
+----------------------------------------------------------------------------------------------------
+
+Divisors count
+
+
+def count_good_sets(A):
+   MOD = 10**9 + 7
+   m = sum(A)
+   A = list(set(A))  # distinct elements only
+   dp = [0] * (m + 1)
+   dp[0] = 1
+   for x in A:
+       for s in range(m, x - 1, -1):
+           dp[s] = (dp[s] + dp[s - x]) % MOD
+   ans = 0
+   for i in range(1, m + 1):
+       if m % i == 0:
+           ans = (ans + dp[i]) % MOD
+   return ans
+
+----------------------------------------------------------------------------------------------------
+
+Nearly lucky 
+
+from itertools import combinations
+
+arr = [1, 1, 2, 4]
+m = sum(arr)
+
+result = []
+seen = set()
+
+for r in range(1, len(arr) + 1):
+    for combo in combinations(arr, r):
+        key = tuple(combo)
+
+        if key in seen:
+            continue
+
+        s = sum(combo)
+
+        if s != 0 and m % s == 0 and 0 < s <= m:
+            seen.add(key)
+            result.append(list(combo))
+
+print(result)

package/pods/DSA/tg.txt

@@ -0,0 +1,99 @@
+(Telegram DSA)
+
+Max permutations
+
+@classmethod
+def maxpermutationvalue(cls, input1, input2):
+    '''
+    input1 : string[]
+    input2 : int
+    Expected return type : int
+    '''
+    def fact(n):
+        if n <= 1:
+            return 1
+        return n * fact(n - 1)
+
+    val = 0
+    for word in input1:
+        res = ""
+        for char in word.lower():
+            if char not in 'aeiou':
+                res += char
+        if len(res) != 0:
+            val = max(val, fact(len(res)))
+    return val
+
+-------------------------------------------------------------------------------------
+
+Xor sum
+
+
+class UserMainCode(object):
+    @classmethod
+    def sumOR(cls, inputs, inputz):
+        '''
+        inputs : int[]
+        inputz : int
+        Expected return type : int
+        '''
+        s = 0
+        x = 0
+        arr = inputs
+
+        for i in range(inputz):
+            if i % 2 == 0:
+                x = x ^ arr[i]
+            else:
+                s += arr[i]
+
+        return s - x
+
+-------------------------------------------------------------------------------------
+
+Maximize Pair Product
+
+class UserMainCode(object):
+    @classmethod
+    def FindPair(cls, input1, input2):
+        '''
+        input1 : int
+        input2 : int[]
+        Expected return type : int[]
+        '''
+        max_pro = 0
+        arr = input2
+        res = []
+
+        for i in range(input1 - 1):
+            for j in range(i + 1, input1):
+                temp = arr[i] * arr[j]
+                if temp >= max_pro:
+                    max_pro = temp
+                    res = sorted([arr[i], arr[j]], reverse=True)
+
+        return res
+
+-------------------------------------------------------------------------------------
+
+Pair Product
+
+class UserMainCode(object):
+    @classmethod
+    def countPairs(cls, input1, input2):
+        '''
+        input1 : int
+        input2 : int[]
+        Expected return type : int
+        '''
+        x = set()
+        input2.sort()
+
+        for i in range(input1):
+            for j in range(i + 1, input1):
+                if (input2[i] * input2[j]) % 3 == 0:
+                    x.add((input2[i], input2[j]))
+
+        return len(x)
+
+-------------------------------------------------------------------------------------

package/pods/backend/inventory_management_system.txt

@@ -0,0 +1,71 @@
+# src/main.py
+ 
+from abc import ABC, abstractmethod
+from typing import List
+ 
+ 
+# Product class - base class for different product categories
+class Product(ABC):
+    def __init__(self, product_id: int, name: str, price: float, stock_level: int):
+        self.product_id = product_id
+        self.name = name
+        self.price = price
+        self.stock_level = stock_level
+ 
+    @abstractmethod
+    def display(self):
+        pass
+ 
+ 
+# Specialized product categories
+class Smartphone(Product):
+    def __init__(self, product_id: int, name: str, price: float, stock_level: int, brand: str):
+        super().__init__(product_id, name, price, stock_level)
+        self.brand = brand
+ 
+    def display(self):
+        print(f"Smartphone {self.name} by {self.brand} - {self.stock_level} units, ${self.price}")
+ 
+ 
+class Laptop(Product):
+    def __init__(self, product_id: int, name: str, price: float, stock_level: int, ram_size: str):
+        super().__init__(product_id, name, price, stock_level)
+        self.ram_size = ram_size
+ 
+    def display(self):
+        print(f"Laptop {self.name} with {self.ram_size} RAM - {self.stock_level} units, ${self.price}")
+ 
+ 
+# Singleton Design Pattern for Inventory Management System
+class InventoryManager:
+    _instance = None
+ 
+    def __new__(cls):
+        if cls._instance is None:
+            cls._instance = super().__new__(cls)
+            cls._instance.products = []
+        return cls._instance
+ 
+    def add_product(self, product: Product):
+        self.products.append(product)
+ 
+    def update_stock(self, product_id: int, quantity: int):
+        for product in self.products:
+            if product.product_id == product_id:
+                product.stock_level += quantity
+                return
+        print("Product not found.")
+ 
+    def generate_report(self):
+        print("Inventory Report:")
+        for product in self.products:
+            product.display()
+ 
+    def alert_low_stock(self, threshold: int):
+        for product in self.products:
+            if product.stock_level < threshold:
+                print(f"ALERT: {product.name} has low stock ({product.stock_level} left).")
+
+
+
+

package/pods/backend/simple_inventory_management_system_for_bookstore_using_tuples.txt

@@ -0,0 +1,59 @@
+# src/main.py
+ 
+def display_menu():
+    print("1. Add a book to inventory")
+    print("2. Display all books in inventory")
+    print("3. Search for a book")
+    print("4. Remove a book from inventory")
+    print("5. Exit")
+ 
+def add_book(inventory):
+    title = input("Enter book title: ")
+    author = input("Enter author name: ")
+    quantity = int(input("Enter quantity: "))
+    price = float(input("Enter price: "))
+    book = (title, author, quantity, price)
+    inventory.append(book)
+ 
+def display_books(inventory):
+    if not inventory:
+        print("No books in inventory.")
+        return
+    for book in inventory:
+        print(f"Title: {book[0]}, Author: {book[1]}, Quantity: {book[2]}, Price: {book[3]}")
+ 
+def search_book(inventory):
+    title = input("Enter the title of the book to search: ")
+    for book in inventory:
+        if book[0].lower() == title.lower():
+            print(f"Book found: Title: {book[0]}, Author: {book[1]}, Quantity: {book[2]}, Price: {book[3]}")
+            return
+    print("Book not found.")
+ 
+def remove_book(inventory):
+    title = input("Enter the title of the book to remove: ")
+    for book in inventory:
+        if book[0].lower() == title.lower():
+            inventory.remove(book)
+            print("Book removed.")
+            return
+    print("Book not found.")
+ 
+def main():
+    inventory = []
+    while True:
+        display_menu()
+        choice = int(input("Choose an option: "))
+        if choice == 1:
+            add_book(inventory)
+        elif choice == 2:
+            display_books(inventory)
+        elif choice == 3:
+            search_book(inventory)
+        elif choice == 4:
+            remove_book(inventory)
+        elif choice == 5:
+            print("Exiting the program.")
+            break
+        else:
+            print("Invalid option. Please try again.")