Merge branch 'TheAlgorithms:master' into master

Author: CaedenPH

dynamic_programming/minimum_tickets_cost.py

@@ -0,0 +1,129 @@
+"""
+Author  : Alexander Pantyukhin
+Date    : November 1, 2022
+
+Task:
+Given a list of days when you need to travel. Each day is integer from 1 to 365.
+You are able to use tickets for 1 day, 7 days and 30 days.
+Each ticket has a cost.
+
+Find the minimum cost you need to travel every day in the given list of days.
+
+Implementation notes:
+implementation Dynamic Programming up bottom approach.
+
+Runtime complexity: O(n)
+
+The implementation was tested on the
+leetcode: https://leetcode.com/problems/minimum-cost-for-tickets/
+
+
+Minimum Cost For Tickets
+Dynamic Programming: up -> down.
+"""
+
+from functools import lru_cache
+
+
+def mincost_tickets(days: list[int], costs: list[int]) -> int:
+    """
+    >>> mincost_tickets([1, 4, 6, 7, 8, 20], [2, 7, 15])
+    11
+
+    >>> mincost_tickets([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 30, 31],  [2, 7, 15])
+    17
+
+    >>> mincost_tickets([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 30, 31], [2, 90, 150])
+    24
+
+    >>> mincost_tickets([2], [2, 90, 150])
+    2
+
+    >>> mincost_tickets([], [2, 90, 150])
+    0
+
+    >>> mincost_tickets('hello', [2, 90, 150])
+    Traceback (most recent call last):
+     ...
+    ValueError: The parameter days should be a list of integers
+
+    >>> mincost_tickets([], 'world')
+    Traceback (most recent call last):
+     ...
+    ValueError: The parameter costs should be a list of three integers
+
+    >>> mincost_tickets([0.25, 2, 3, 4, 5, 6, 7, 8, 9, 10, 30, 31], [2, 90, 150])
+    Traceback (most recent call last):
+     ...
+    ValueError: The parameter days should be a list of integers
+
+    >>> mincost_tickets([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 30, 31], [2, 0.9, 150])
+    Traceback (most recent call last):
+     ...
+    ValueError: The parameter costs should be a list of three integers
+
+    >>> mincost_tickets([-1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 30, 31], [2, 90, 150])
+    Traceback (most recent call last):
+     ...
+    ValueError: All days elements should be greater than 0
+
+    >>> mincost_tickets([2, 367], [2, 90, 150])
+    Traceback (most recent call last):
+     ...
+    ValueError: All days elements should be less than 366
+
+    >>> mincost_tickets([2, 3, 4, 5, 6, 7, 8, 9, 10, 30, 31], [])
+    Traceback (most recent call last):
+     ...
+    ValueError: The parameter costs should be a list of three integers
+
+    >>> mincost_tickets([], [])
+    Traceback (most recent call last):
+     ...
+    ValueError: The parameter costs should be a list of three integers
+
+    >>> mincost_tickets([2, 3, 4, 5, 6, 7, 8, 9, 10, 30, 31], [1, 2, 3, 4])
+    Traceback (most recent call last):
+     ...
+    ValueError: The parameter costs should be a list of three integers
+    """
+
+    # Validation
+    if not isinstance(days, list) or not all(isinstance(day, int) for day in days):
+        raise ValueError("The parameter days should be a list of integers")
+
+    if len(costs) != 3 or not all(isinstance(cost, int) for cost in costs):
+        raise ValueError("The parameter costs should be a list of three integers")
+
+    if len(days) == 0:
+        return 0
+
+    if min(days) <= 0:
+        raise ValueError("All days elements should be greater than 0")
+
+    if max(days) >= 366:
+        raise ValueError("All days elements should be less than 366")
+
+    days_set = set(days)
+
+    @lru_cache(maxsize=None)
+    def dynamic_programming(index: int) -> int:
+        if index > 365:
+            return 0
+
+        if index not in days_set:
+            return dynamic_programming(index + 1)
+
+        return min(
+            costs[0] + dynamic_programming(index + 1),
+            costs[1] + dynamic_programming(index + 7),
+            costs[2] + dynamic_programming(index + 30),
+        )
+
+    return dynamic_programming(1)
+
+
+if __name__ == "__main__":
+    import doctest
+
+    doctest.testmod()

other/check_strong_password.py

@@ -1,11 +1,12 @@
-"""Password Generator allows you to generate a random password of length N."""
 import secrets
 from random import shuffle
-from string import ascii_letters, digits, punctuation
+from string import ascii_letters, ascii_lowercase, ascii_uppercase, digits, punctuation
 
 
 def password_generator(length: int = 8) -> str:
     """
+    Password Generator allows you to generate a random password of length N.
+
     >>> len(password_generator())
     8
     >>> len(password_generator(length=16))
@@ -62,6 +63,45 @@ def random_characters(chars_incl, i):
     pass  # Put your code here...
 
 
+# This Will Check Whether A Given Password Is Strong Or Not
+# It Follows The Rule that Length Of Password Should Be At Least 8 Characters
+# And At Least 1 Lower, 1 Upper, 1 Number And 1 Special Character
+def strong_password_detector(password: str, min_length: int = 8) -> str:
+    """
+    >>> strong_password_detector('Hwea7$2!')
+    'This is a strong Password'
+
+    >>> strong_password_detector('Sh0r1')
+    'Your Password must be at least 8 characters long'
+
+    >>> strong_password_detector('Hello123')
+    'Password should contain UPPERCASE, lowercase, numbers, special characters'
+
+    >>> strong_password_detector('Hello1238udfhiaf038fajdvjjf!jaiuFhkqi1')
+    'This is a strong Password'
+
+    >>> strong_password_detector('0')
+    'Your Password must be at least 8 characters long'
+    """
+
+    if len(password) < min_length:
+        return "Your Password must be at least 8 characters long"
+
+    upper = any(char in ascii_uppercase for char in password)
+    lower = any(char in ascii_lowercase for char in password)
+    num = any(char in digits for char in password)
+    spec_char = any(char in punctuation for char in password)
+
+    if upper and lower and num and spec_char:
+        return "This is a strong Password"
+
+    else:
+        return (
+            "Password should contain UPPERCASE, lowercase, "
+            "numbers, special characters"
+        )
+
+
 def main():
     length = int(input("Please indicate the max length of your password: ").strip())
     chars_incl = input(

other/password_generator.py renamed to other/password.py

@@ -1,5 +1,4 @@
 beautifulsoup4
-cython>=0.29.28  # For statsmodels on Python 3.11
 fake_useragent
 keras
 lxml