• Apr 21, 2023 •sebastianagauyao2002-61a8
0 likes • 4 views
print("hellur")
• Nov 18, 2022 •AustinLeath
0 likes • 2 views
# 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 5, 2026 •CodeCatch
def binary_search(arr, target): low = 0 high = len(arr) - 1 while low <= high: mid = (low + high) // 2 if arr[mid] == target: return mid elif arr[mid] < target: low = mid + 1 else: high = mid - 1 return -1
• Oct 4, 2023 •AustinLeath
0 likes • 11 views
weigh = lambda a,b: sum(b)-sum(a) FindCoin = lambda A: 0 if (n := len(A)) == 1 else (m := n//3) * (w := 1 + weigh(A[:m], A[2*m:])) + FindCoin(A[m*w:m*(w+1)]) print(FindCoin([1,1,1,1,1,1,1,2,1]))
0 likes • 1 view
import re def find_pattern(text, pattern): match = re.search(pattern, text) if match: return match.group() else: return 'No match found' text = 'Hello, world! This is a test.' pattern = r'world!.*test.' result = find_pattern(text, pattern) print(result)
• Nov 19, 2022 •CodeCatch
0 likes • 3 views
from math import pi def rads_to_degrees(rad): return (rad * 180.0) / pi rads_to_degrees(pi / 2) # 90.0