Skip to main content

AnyTree Randomizer

Apr 15, 2021NoahEaton
Loading...

More Python Posts

Palindrome checker

Nov 19, 2022CodeCatch

0 likes • 3 views

# function which return reverse of a string
def isPalindrome(s):
return s == s[::-1]
# Driver code
s = "malayalam"
ans = isPalindrome(s)
if ans:
print("Yes")
else:
print("No")

Display Calendar

May 31, 2023CodeCatch

0 likes • 0 views

import calendar
# Prompt user for year and month
year = int(input("Enter the year: "))
month = int(input("Enter the month: "))
# Create a calendar object
cal = calendar.monthcalendar(year, month)
# Display the calendar
print(calendar.month_name[month], year)
print("Mon Tue Wed Thu Fri Sat Sun")
for week in cal:
for day in week:
if day == 0:
print(" ", end="")
else:
print(str(day).rjust(2), " ", end="")
print()

Untitled

Jul 24, 2024AustinLeath

0 likes • 3 views

from statistics import median, mean, mode
def print_stats(array):
print(array)
print("median =", median(array))
print("mean =", mean(array))
print("mode =", mode(array))
print()
print_stats([1, 2, 3, 3, 4])
print_stats([1, 2, 3, 3])

LeetCode Flood Fill

Oct 15, 2022CodeCatch

0 likes • 0 views

class Solution(object):
def floodFill(self, image, sr, sc, newColor):
R, C = len(image), len(image[0])
color = image[sr][sc]
if color == newColor: return image
def dfs(r, c):
if image[r][c] == color:
image[r][c] = newColor
if r >= 1: dfs(r-1, c)
if r+1 < R: dfs(r+1, c)
if c >= 1: dfs(r, c-1)
if c+1 < C: dfs(r, c+1)
dfs(sr, sc)
return image

Dictionary Sort

Nov 18, 2022AustinLeath

0 likes • 4 views

mydict = {'carl':40, 'alan':2, 'bob':1, 'danny':0}
# How to sort a dict by value Python 3>
sort = {key:value for key, value in sorted(mydict.items(), key=lambda kv: (kv[1], kv[0]))}
print(sort)
# How to sort a dict by key Python 3>
sort = {key:mydict[key] for key in sorted(mydict.keys())}
print(sort)

Print "X" pattern

Nov 19, 2022CodeCatch

0 likes • 0 views

def print_x_pattern(size):
i,j = 0,size - 1
while j >= 0 and i < size:
initial_spaces = ' '*min(i,j)
middle_spaces = ' '*(abs(i - j) - 1)
final_spaces = ' '*(size - 1 - max(i,j))
if j == i:
print(initial_spaces + '*' + final_spaces)
else:
print(initial_spaces + '*' + middle_spaces + '*' + final_spaces)
i += 1
j -= 1
print_x_pattern(7)