• Nov 19, 2022 •CodeCatch
1 like • 4 views
def hex_to_rgb(hex): return tuple(int(hex[i:i+2], 16) for i in (0, 2, 4)) hex_to_rgb('FFA501') # (255, 165, 1)
• Nov 18, 2022 •AustinLeath
0 likes • 1 view
# List lst = [1, 2, 3, 'Alice', 'Alice'] # One-Liner indices = [i for i in range(len(lst)) if lst[i]=='Alice'] # Result print(indices) # [3, 4]
• May 31, 2023 •CodeCatch
0 likes • 0 views
def generate_floyds_triangle(num_rows): triangle = [] number = 1 for row in range(num_rows): current_row = [] for _ in range(row + 1): current_row.append(number) number += 1 triangle.append(current_row) return triangle def display_floyds_triangle(triangle): for row in triangle: for number in row: print(number, end=" ") print() # Prompt the user for the number of rows num_rows = int(input("Enter the number of rows for Floyd's Triangle: ")) # Generate Floyd's Triangle floyds_triangle = generate_floyds_triangle(num_rows) # Display Floyd's Triangle display_floyds_triangle(floyds_triangle)
# Python program for implementation of Selection # Sort import sys A = [64, 25, 12, 22, 11] # Traverse through all array elements for i in range(len(A)): # Find the minimum element in remaining # unsorted array min_idx = i for j in range(i+1, len(A)): if A[min_idx] > A[j]: min_idx = j # Swap the found minimum element with # the first element A[i], A[min_idx] = A[min_idx], A[i] # Driver code to test above print ("Sorted array") for i in range(len(A)): print("%d" %A[i]),
• Jun 1, 2023 •CodeCatch
0 likes • 4 views
bytes_data = b'Hello, World!' string_data = bytes_data.decode('utf-8') print("String:", string_data)
def print_pyramid_pattern(n): # outer loop to handle number of rows # n in this case for i in range(0, n): # inner loop to handle number of columns # values changing acc. to outer loop for j in range(0, i+1): # printing stars print("* ",end="") # ending line after each row print("\r") print_pyramid_pattern(10)