Program for Product of unique prime factors of a number

import math

def productPrimeFactors(n):

product = 1

if (n % 2 == 0):

product *= 2

while (n%2 == 0):

n = n/2

for i in range (3, int(math.sqrt(n)), 2):

if (n % i == 0):

product = product * i

while (n%i == 0):

n = n/i

if (n > 2):

product = product * n

return product

n = 44

print (int(productPrimeFactors(n)))

Program in numpy percentile

import numpy as np

arr = [[14, 17, 12, 33, 44],

[15, 6, 27, 8, 19],

[23, 2, 54, 1, 4,]]

print("\narr : \n", arr)

print("\n50th Percentile of arr, axis = None : ",

np.percentile(arr, 50))

print("0th Percentile of arr, axis = None : ",

np.percentile(arr, 0))

print("\n50th Percentile of arr, axis = 0 : ",

np.percentile(arr, 50, axis =0))

print("0th Percentile of arr, axis = 0 : ",

np.percentile(arr, 0, axis =0))

Turtle 3D cubes

import turtle

screen=turtle.Screen()  

screen.setup(800,800)   

trtl = turtle.Turtle()

screen.title("3-D CUBES")

trtl.penup()

trtl.setposition(0,0)

trtl.setheading(90)

trtl.color('red')

def hexagon():

    for i in range(6):

        trtl.fd(50)

        trtl.rt(60)

i = 1

while i < 7:

    trtl.pendown()

    hexagon()

    trtl.right(60)

    i = i + 1 

Check if an URL is valid or not using Regular Expression

import re

def isValidURL(str):

regex = ("((http|https)://)(www.)?" +

"[a-zA-Z0-9@:%._\\+~#?&//=]" +

"{2,256}\\.[a-z]" +

"{2,6}\\b([-a-zA-Z0-9@:%" +

"._\\+~#?&//=]*)")

p = re.compile(regex)

if (str == None):

return False

if(re.search(p, str)):

return True

else:

return False

url = "https://www.pythonforengineers.in"

if(isValidURL(url) == True):

print("Yes")

else:

print("No")

Program to print double sided stair-case pattern

def pattern(n):

for i in range(1,n+1):

k =i + 1 if(i % 2 != 0) else i

for g in range(k,n):

if g>=k:

print(end=" ")

for j in range(0,k):

if j == k - 1:

print(" * ")

else:

print(" * ", end = " ")

n = 10

pattern(n)